|
|
Josep Llados and Enric Marti. 1997. Playing with error-tolerant subgraph isomorphism in line drawings. VII National Symposium on Pattern Recognition and image Analysis.
|
|
|
|
Josep Llados, Ernest Valveny, Gemma Sanchez and Enric Marti. 2002. Symbol recognition: current advances and perspectives. In Dorothea Blostein and Young- Bin Kwon, ed. Graphics Recognition Algorithms And Applications. Springer-Verlag, 104–128. (LNCS.)
Abstract: The recognition of symbols in graphic documents is an intensive research activity in the community of pattern recognition and document analysis. A key issue in the interpretation of maps, engineering drawings, diagrams, etc. is the recognition of domain dependent symbols according to a symbol database. In this work we first review the most outstanding symbol recognition methods from two different points of view: application domains and pattern recognition methods. In the second part of the paper, open and unaddressed problems involved in symbol recognition are described, analyzing their current state of art and discussing future research challenges. Thus, issues such as symbol representation, matching, segmentation, learning, scalability of recognition methods and performance evaluation are addressed in this work. Finally, we discuss the perspectives of symbol recognition concerning to new paradigms such as user interfaces in handheld computers or document database and WWW indexing by graphical content.
|
|
|
|
Josep Llados, Gemma Sanchez and Enric Marti. 1998. A string based method to recognize symbols and structural textures in architectural plans. Graphics Recognition Algorithms and Systems Second International Workshop, GREC' 97 Nancy, France, August 22–23, 1997 Selected Papers. Springer Link, 91–103. (LNCS.)
Abstract: This paper deals with the recognition of symbols and structural textures in architectural plans using string matching techniques. A plan is represented by an attributed graph whose nodes represent characteristic points and whose edges represent segments. Symbols and textures can be seen as a set of regions, i.e. closed loops in the graph, with a particular arrangement. The search for a symbol involves a graph matching between the regions of a model graph and the regions of the graph representing the document. Discriminating a texture means a clustering of neighbouring regions of this graph. Both procedures involve a similarity measure between graph regions. A string codification is used to represent the sequence of outlining edges of a region. Thus, the similarity between two regions is defined in terms of the string edit distance between their boundary strings. The use of string matching allows the recognition method to work also under presence of distortion.
|
|
|
|
Josep Llados, Ernest Valveny and Enric Marti. 2000. Symbol Recognition in Document Image Analysis: Methods and Challenges. Recent Research Developments in Pattern Recognition, Transworld Research Network,, 1, 151–178.
|
|
|
|
Josep Llados, Ernest Valveny, Gemma Sanchez and Enric Marti. 2003. A Case Study of Pattern Recognition: Symbol Recognition in Graphic Documentsa. Proceedings of Pattern Recognition in Information Systems. ICEIS Press, 1–13.
|
|
|
|
Josep Llados and Enric Marti. 1995. Interpretacio de dibuixos lineals mitjançant tècniques d isomorfisme entre grafs. Trobada de Joves Investigadors.
Abstract: L’anàlisi de documents té com a objectiu la interpretació automàtica de documents impresos sobre paper, amb la finalitat d’obtenir una descripció simbòlica d’aquests, que permeti el seu emmagatzemament i posterior tractament computacional. Les tècniques basades en grafs relacionals d’atributs permeten representar de manera compacta la informació continguda en dibuixos lineals i mitjançant mecanismes d’isomorfisme entre grafs, reconèixer-hi certes estructures i d’aquesta manera, interpretar el document. En aquest treball es dóna una visió general de les tènciques de grafs aplicades al reconeixement visual d’objectes en problemes d’anàlisi de documents. Aquestes tècniques s’il·lustren amb un exemple de reconeixement de plànols dibuixats a mà alçada. Finalment es proposa la utilització de tècniques de Hough com a mecanisme per accelerar el procés de reconeixement aplicant un cert coneixement sobre el domini en el que es treballa
|
|
|
|
Josep Llados, Enric Marti and Jaime Lopez-Krahe. 1999. A Hough-based method for hatched pattern detection in maps and diagrams. Proceeding of the Fifth Int. Conf. Document Analysis and Recognition ICDAR ’99.479–482.
Abstract: A hatched area is characterized by a set of parallel straight lines placed at regular intervals. In this paper, a Hough-based schema is introduced to recognize hatched areas in technical documents from attributed graph structures representing the document once it has been vectorized. Defining a Hough-based transform from a graph instead of the raster image allows to drastically reduce the processing time and, second, to obtain more reliable results because straight lines have already been detected in the vectorization step. A second advantage of the proposed method is that no assumptions must be made a priori about the slope and frequency of hatching patterns, but they are computed in run time for each hatched area.
|
|
|
|
Josep Llados, Enric Marti and Juan J.Villanueva. 2001. Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10), 1137–1143.
Abstract: The recognition of symbols in graphic documents is an intensive research activity in the community of pattern recognition and document analysis. A key issue in the interpretation of maps, engineering drawings, diagrams, etc. is the recognition of domain dependent symbols according to a symbol database. In this work we first review the most outstanding symbol recognition methods from two different points of view: application domains and pattern recognition methods. In the second part of the paper, open and unaddressed problems involved in symbol recognition are described, analyzing their current state of art and discussing future research challenges. Thus, issues such as symbol representation, matching, segmentation, learning, scalability of recognition methods and performance evaluation are addressed in this work. Finally, we discuss the perspectives of symbol recognition concerning to new paradigms such as user interfaces in handheld computers or document database and WWW indexing by graphical content.
|
|
|
|
Gemma Sanchez and 6 others. 2003. A system for virtual prototyping of architectural projects. Proceedings of Fifth IAPR International Workshop on Pattern Recognition.65–74.
|
|
|
|
Ernest Valveny and Enric Marti. 2001. Learning of structural descriptions of graphic symbols using deformable template matching. Proc. Sixth Int Document Analysis and Recognition Conf.455–459.
Abstract: Accurate symbol recognition in graphic documents needs an accurate representation of the symbols to be recognized. If structural approaches are used for recognition, symbols have to be described in terms of their shape, using structural relationships among extracted features. Unlike statistical pattern recognition, in structural methods, symbols are usually manually defined from expertise knowledge, and not automatically infered from sample images. In this work we explain one approach to learn from examples a representative structural description of a symbol, thus providing better information about shape variability. The description of a symbol is based on a probabilistic model. It consists of a set of lines described by the mean and the variance of line parameters, respectively providing information about the model of the symbol, and its shape variability. The representation of each image in the sample set as a set of lines is achieved using deformable template matching.
|
|
