An error-correction graph grammar to recognize texture symbols

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents an algorithm for recognizing symbols with textured elements in a graphical document. A region adjacency graph represents the document. The texture symbols are modeled by a graph grammar. An inference algorithm is applied to learn such grammar from an instance of the texture. For recognition, a parsing process is applied. Since documents present distortions, error-correcting rules are added to the grammar.

Cite

CITATION STYLE

APA

Sánchez, G., Lladós, J., & Tombre, K. (2002). An error-correction graph grammar to recognize texture symbols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2390, pp. 128–138). Springer Verlag. https://doi.org/10.1007/3-540-45868-9_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free