An Error-Correction Graph Grammar to Recognize Textured Symbols
| Autor: | Sánchez, Gemma, Lladós, Josep, Tombre, Karl |
|---|---|
| Přispěvatelé: | Models, algorithms and geometry for computer graphics and vision (ISA), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), Computer Vision Center (Centre de visio per computador) (CVC), Universitat Autònoma de Barcelona (UAB) |
| Jazyk: | angličtina |
| Rok vydání: | 2001 |
| Předmět: | |
| Zdroj: | 4th IAPR International Workshop on Graphics Recognition 4th IAPR International Workshop on Graphics Recognition, 2001, Kingston, Ontario, Canada, pp.135-146 |
| Popis: | Colloque avec actes et comité de lecture. internationale.; International audience; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|