Similarity retrieval of iconic image database
Pattern Recognition
Model matching in robot vision by subgraph isomorphism
Pattern Recognition
Subgraph Isomorphism Detection in Polynominal Time on Preprocessed Model Graphs
ACCV '95 Invited Session Papers from the Second Asian Conference on Computer Vision: Recent Developments in Computer Vision
| Hi-index | 0.00 |
Many tasks in computer vision can be expressed as graph problems. This allows the task to be solved using a well studied algorithm, however, many of these algorithms are of exponential complexity. This is a disadvantage when considered in the context of searching a database of images or videos for similarity.Recent work by Messmer and Bunke has suggested a new class of graph matching algorithms which uses a priori knowledge about a database of models to reduce the time taken during on-line classification. This paper presents a new algorithm which extends the earlier work to detection of the largest common subgraph.