Symbol recognition by error-tolerant subgraph matching between region adjacency graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 23, Issue 10, 2001, Pages 1137-1143

  Lladós, Josep ^b   Martí, Enric ^b   Villanueva, Juan José ^a,b  

^a IEEE   (Spain)

^b UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

Author keywords

Graph edit distance; Graph isomorphism; Graph matching; Inexact graph matching; Subgraph isomorphism; Symbol recognition

Indexed keywords

REGION ADJACENCY GRAPHS (RAG); SYMBOL RECOGNITION;

CODES (SYMBOLS); COMPUTER GRAPHICS; COMPUTER SIMULATION; COMPUTER VISION; DATA STRUCTURES; GRAPH THEORY; POLYNOMIALS;

PATTERN MATCHING;

EID: 0035481623     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.954603     Document Type: Article

References (39)

1. A linear programming approach for the weighted graph matching problem
2. An algorithm for the inexact matching of high level 3D polyhedric representations
3. Recent advances in graph matching
4. Structural matching in computer vision using probabilistic relaxation
5. Inexact graph matching using genetic search
6. A similarity measure between attributed relational graphs for image analysis
7. Matching delaunay graphs
8. A structural graph matching approach to image understanding
9. 3D object recognition based on subgraph matching in polynomial time
10. A graduated assignment for graph matching
11. Structural recognition of disturbed symbols using discrete relaxation
12. Stereo correspondence through feature grouping and maximal cliques
13. Synthesis of representative graphical symbols by computing generalized median graph
14. Pattern recognition by graph matching: Combinatorial versus continuous optimization
15. Translation-, rotation-, and scale-invariant recognition of hand-drawn symbols in schematic diagrams
16. Combining graph matching and hough transform for hand-drawn graphical document analysis
17. Polygonal shape recognition using string-matching techniques
18. A new algorithm for error-tolerant subgraph isomorphism detection
19. Arc and path consistency revisited
20. Matching hierarchical structures using association graphs
21. A shape analysis model with applications to a character recognition system
22. An algorithm for optimal isomorphism between two random graphs
23. Relational matching
24. Model indexing: The graph-hashing approach
25. Pattern recognition by graph matching using the potts MFT neural networks
26. Pattern recognition by homomorphic graph matching using hopfield neural networks
27. Stable and robust vectorization: How to make the right choices
28. Model-guided attributed string matching by split-and-merge for shape recognition
29. An algorithm for subgraph isomorphism
30. An eigendecomposition approach to weighted graph matching problems
31. The string-to-string correction problem
32. Region correspondence by inexact attributed planar graph matching
33. The approximate graph matching problem
34. A Bayesian compatibility model for graph matching
35. Entropy and distance of random graphs with application to structural pattern recognition
36. Model matching in robot vision by subgraph isomorphism