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 <>
Submitted on : Tuesday, September 26, 2006 - 2:56:28 PM
Last modification on : Monday, March 29, 2021 - 11:50:03 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