On median graphs: Properties, algorithms, and applications

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 23, Issue 10, 2001, Pages 1144-1151

  Jiang, X ^a   Munger A ^a   Bunke, H ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Genetic algorithm; Graph distance; Graph matching; Learning; Median graph

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; INVARIANCE; PATTERN MATCHING;

MEDIAN GRAPHS;

DATA STRUCTURES;

EID: 0035481807     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.954604     Document Type: Article

References (34)

1. Introduction to the special section on learning in computer vision
2. Inexact graph matching for structural pattern recognition
3. A graph-distance metric based on the maximal common subgraph
4. Error correcting graph matching: On the influence of the underlying cost function
5. Inexact graph matching using genetic search
6. Using genetic algorithms to solve NP-complete problems
7. A graph distance metric combining maximum common subgraph and minimum common supergraph
8. Topology of strings: Median string is NP-complete
9. Computing the generalized median of a set of graphs
10. Synthesis of representative graphical symbols by computing generalized median graph
11. Fast median search in metric spaces
12. Optimization by simulated annealing
13. Median graphs: Characterizations, location theory and related structures
14. Computing the edit-distance between unrooted ordered trees
15. Translation- rotation- and scale-invariant recognition of hand-drawn symbols in schematic diagrams
16. Using consensus sequence voting to correct OCR errors
17. Hierarchical attributed graph representation and recognition of handwritten chinese characters
18. Machine vision and learning: Research issues and directions
19. Rulegraphs for graph matching in pattern recognition
20. Matching hierarchical structures using association graphs
21. A shape analysis model with applications to a character recognition system
22. A distance measure between attributed relational graphs for pattern recognition
23. Machine learning of computer vision algorithms
24. Organization of relational models for scene analysis
25. A metric for comparing relational descriptions
26. Graph distances using graph union
27. Algorithms for approximate graph matching
28. An algorithm for finding the largest approximately common substructures of two trees
29. Genetic-based search for error-correcting graph isomorphism
30. Model matching in robot vision by subgraph isomorphism
31. Generalised deformable models, statistical physics and matching problems