Symbol recognition by error-tolerant subgraph matching betweenregion adjacency graphs
Llados, J.
Marti, E.
Villanueva, J.J.
Dept. Inf. Edifici O, Univ. Autonoma de Barcelona ;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Oct 2001
Volume: 23,
Issue: 10
On page(s): 1137-1143
ISSN: 0162-8828
References Cited: 39
CODEN: ITPIDJ
INSPEC Accession Number: 7084282
Digital Object Identifier: 10.1109/34.954603
Current Version Published: 2002-08-07
Abstract
We propose an error-tolerant subgraph isomorphism algorithm
formulated in terms of region adjacency graphs (RAG). A set of edit
operations to transform one RAG into another one are defined as regions
are represented by polylines and string matching techniques are used to
measure their similarity. The algorithm follows a branch and bound
approach driven by the RAG edit operations. This formulation allows
matching computing under distorted inputs and also reaching a solution
in a near polynomial time. The algorithm has been used for recognizing
symbols in hand drawn diagrams
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
