HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

An Error-Correction Graph Grammar to Recognize Textured Symbols

Abstract : This paper presents an algorithm for recognizing symbols with textured elements in a graphical document. A region adjacency graph represents the graphical document, with the nodes being polygons and the edges the neighborhood relations between them. The textured symbols are modeled by a graph, where nodes are polygons (represented by strings) or textured areas (represented by a graph grammar with error-correction rules). The recognition process is done by a graph matching process that uses a string edit distance to recognize the static parts of the symbol and a parsing process that segments the subgraph in the original graph, following the rules of the graph grammar.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:56:28 PM
Last modification on : Friday, February 4, 2022 - 3:18:21 AM


  • HAL Id : inria-00101096, version 1



Gemma Sánchez, Josep Lladós, Karl Tombre. An Error-Correction Graph Grammar to Recognize Textured Symbols. 4th IAPR International Workshop on Graphics Recognition, 2001, Kingston, Ontario, Canada, pp.135-146. ⟨inria-00101096⟩



Record views