|
|
Josep Llados, Jaime Lopez-Krahe, Gemma Sanchez, & Enric Marti. (2000)." Interprétation de cartes et plans par mise en correspondance de graphes de attributs" In 12 Congrès Francophone AFRIF–AFIA (Vol. 3, pp. 225–234).
|
|
|
|
Josep Llados, Jaime Lopez-Krahe, & Enric Marti. (1997). "A system to understand hand-drawn floor plans using subgraph isomorphism and Hough transform " In Machine Vision and Applications (Vol. 10, pp. 150–158).
Abstract: Presently, man-machine interface development is a widespread research activity. A system to understand hand drawn architectural drawings in a CAD environment is presented in this paper. To understand a document, we have to identify its building elements and their structural properties. An attributed graph structure is chosen as a symbolic representation of the input document and the patterns to recognize in it. An inexact subgraph isomorphism procedure using relaxation labeling techniques is performed. In this paper we focus on how to speed up the matching. There is a building element, the walls, characterized by a hatching pattern. Using a straight line Hough transform (SLHT)-based method, we recognize this pattern, characterized by parallel straight lines, and remove from the input graph the edges belonging to this pattern. The isomorphism is then applied to the remainder of the input graph. When all the building elements have been recognized, the document is redrawn, correcting the inaccurate strokes obtained from a hand-drawn input.
Keywords: Line drawings – Hough transform – Graph matching – CAD systems – Graphics recognition
|
|
|
|
Josep Llados, Jaime Lopez-Krahe, & Enric Marti. (1996). "Hand drawn document understanding using the straight line Hough transform and graph matching " In Proceedings of the 13th International Pattern Recognition Conference (ICPR’96) (Vol. 2, pp. 497–501). Vienna , Austria.
Abstract: This paper presents a system to understand hand drawn architectural drawings in a CAD environment. The procedure is to identify in a floor plan the building elements, stored in a library of patterns, and their spatial relationships. The vectorized input document and the patterns to recognize are represented by attributed graphs. To recognize the patterns as such, we apply a structural approach based on subgraph isomorphism techniques. In spite of their value, graph matching techniques do not recognize adequately those building elements characterized by hatching patterns, i.e. walls. Here we focus on the recognition of hatching patterns and develop a straight line Hough transform based method in order to detect the regions filled in with parallel straight fines. This allows not only to recognize filling patterns, but it actually reduces the computational load associated with the subgraph isomorphism computation. The result is that the document can be redrawn by editing all the patterns recognized
|
|
|
|
Josep Llados, J. Lopez-Krahe, & Enric Marti. (1999)." A Hough-based method for hatched pattern detection in maps and diagrams." .
|
|
|
|
Josep Llados, Horst Bunke, & Enric Marti. (1997). "Finding rotational symmetries by cyclic string matching " . Pattern recognition letters, 18(14), 1435–1442.
Abstract: Symmetry is an important shape feature. In this paper, a simple and fast method to detect perfect and distorted rotational symmetries of 2D objects is described. The boundary of a shape is polygonally approximated and represented as a string. Rotational symmetries are found by cyclic string matching between two identical copies of the shape string. The set of minimum cost edit sequences that transform the shape string to a cyclically shifted version of itself define the rotational symmetry and its order. Finally, a modification of the algorithm is proposed to detect reflectional symmetries. Some experimental results are presented to show the reliability of the proposed algorithm
Keywords: Rotational symmetry; Reflectional symmetry; String matching
|
|
|
|
Josep Llados, Horst Bunke, & Enric Marti. (1996)." Using cyclic string matching to find rotational and reflectional symmetric shapes" In H. B. H. N. R.C. Bolles (Ed.), Dagstuhl Seminar on Modelling and Planning for Sensor–based Intelligent Robot Systems. Saarbrucken (Germany).: World Scientific.
|
|
|
|
Josep Llados, Horst Bunke, & Enric Marti. (1996). "Structural Recognition of hand drawn floor plans " In VI National Symposium on Pattern Recognition and Image Analysis. Cordoba.
Abstract: A system to recognize hand drawn architectural drawings in a CAD environment has been deve- loped. In this paper we focus on its high level interpretation module. To interpret a floor plan, the system must identify several building elements, whose description is stored in a library of pat- terns, as well as their spatial relationships. We propose a structural approach based on subgraph isomorphism techniques to obtain a high-level interpretation of the document. The vectorized input document and the patterns to be recognized are represented by attributed graphs. Discrete relaxation techniques (AC4 algorithm) have been applied to develop the matching algorithm. The process has been divided in three steps: node labeling, local consistency and global consistency verification. The hand drawn creation causes disturbed line drawings with several accuracy errors, which must be taken into account. Here we have identified them and the AC4 algorithm has been adapted to manage them.
Keywords: Rotational Symmetry; Reflectional Symmetry; String Matching.
|
|
|
|
Josep Llados, Gemma Sanchez, & Enric Marti. (1997)." A String-Based Method to Recognize Symbols and Structural Textures in Architectural Plans." .
|
|
|
|
Josep Llados, Gemma Sanchez, & Enric Marti. (1998). "A string based method to recognize symbols and structural textures in architectural plans " In Graphics Recognition Algorithms and Systems Second International Workshop, GREC' 97 Nancy, France, August 22–23, 1997 Selected Papers (Vol. 1389, pp. 91–103). LNCS. Springer Link.
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, Gemma Sanchez, & Enric Marti. (2002). "Symbol recognition: current advances and perspectives " In Dorothea Blostein and Young- Bin Kwon (Ed.), Graphics Recognition Algorithms And Applications (Vol. 2390, pp. 104–128). Lecture Notes in Computer Science. Springer-Verlag.
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.
|
|
