|
|
Josep Llados, Partha Pratim Roy, Jose Antonio Rodriguez and Gemma Sanchez. 2007. Word Spotting in Archive Documents using Shape Contexts. 3rd Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA 2007), J. Marti et al. (Eds.) LNCS 4478:290–297.
|
|
|
|
Josep Llados, Marçal Rusiñol, Alicia Fornes, David Fernandez and Anjan Dutta. 2012. On the Influence of Word Representations for Handwritten Word Spotting in Historical Documents. IJPRAI, 26(5), 1263002–126027.
Abstract: 0,624 JCR
Word spotting is the process of retrieving all instances of a queried keyword from a digital library of document images. In this paper we evaluate the performance of different word descriptors to assess the advantages and disadvantages of statistical and structural models in a framework of query-by-example word spotting in historical documents. We compare four word representation models, namely sequence alignment using DTW as a baseline reference, a bag of visual words approach as statistical model, a pseudo-structural model based on a Loci features representation, and a structural approach where words are represented by graphs. The four approaches have been tested with two collections of historical data: the George Washington database and the marriage records from the Barcelona Cathedral. We experimentally demonstrate that statistical representations generally give a better performance, however it cannot be neglected that large descriptors are difficult to be implemented in a retrieval scenario where word spotting requires the indexation of data with million word images.
Keywords: Handwriting recognition; word spotting; historical documents; feature representation; shape descriptors Read More: http://www.worldscientific.com/doi/abs/10.1142/S0218001412630025
|
|
|
|
Josep Llados and Marçal Rusiñol. 2014. Graphics Recognition Techniques. In D. Doermann and K. Tombre, eds. Handbook of Document Image Processing and Recognition. Springer London, 489–521.
Abstract: This chapter describes the most relevant approaches for the analysis of graphical documents. The graphics recognition pipeline can be splitted into three tasks. The low level or lexical task extracts the basic units composing the document. The syntactic level is focused on the structure, i.e., how graphical entities are constructed, and involves the location and classification of the symbols present in the document. The third level is a functional or semantic level, i.e., it models what the graphical symbols do and what they mean in the context where they appear. This chapter covers the lexical level, while the next two chapters are devoted to the syntactic and semantic level, respectively. The main problems reviewed in this chapter are raster-to-vector conversion (vectorization algorithms) and the separation of text and graphics components. The research and industrial communities have provided standard methods achieving reasonable performance levels. Hence, graphics recognition techniques can be considered to be in a mature state from a scientific point of view. Additionally this chapter provides insights on some related problems, namely, the extraction and recognition of dimensions in engineering drawings, and the recognition of hatched and tiled patterns. Both problems are usually associated, even integrated, in the vectorization process.
Keywords: Dimension recognition; Graphics recognition; Graphic-rich documents; Polygonal approximation; Raster-to-vector conversion; Texture-based primitive extraction; Text-graphics separation
|
|
|
|
Josep Llados, Jaime Lopez-Krahe, Gemma Sanchez and Enric Marti. 2000. Interprétation de cartes et plans par mise en correspondance de graphes de attributs. 12 Congrès Francophone AFRIF–AFIA.225–234.
|
|
|
|
Josep Llados, Jaime Lopez-Krahe and Enric Marti. 1997. A system to understand hand-drawn floor plans using subgraph isomorphism and Hough transform. Machine Vision and Applications.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 and Enric Marti. 1996. Hand drawn document understanding using the straight line Hough transform and graph matching. Proceedings of the 13th International Pattern Recognition Conference (ICPR’96). Vienna , Austria, 497–501.
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 and Enric Marti. 1999. A Hough-based method for hatched pattern detection in maps and diagrams..
|
|
|
|
Josep Llados, J. Lopez-Krahe and D. Archambault. 2007. Special Issue on Information Technologies for Visually Impaired People. Guest Editors.
|
|
|
|
Josep Llados, Horst Bunke and Enric Marti. 1997. Finding rotational symmetries by cyclic string matching. PRL, 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 and Enric Marti. 1996. Using cyclic string matching to find rotational and reflectional symmetric shapes. In R.C. Bolles, H.B.H.N., ed. Intelligent Robots: Sensing, Modeling and Planning (Dagstuhl Workshop). Saarbrucken (Germany)., World Scientific, 164–179.
|
|
