An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature-based correspondence: an eigenvector approach
Image and Vision Computing - Special issue: BMVC 1991
Matching Hierarchical Structures Using Association Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shock Graphs and Shape Matching
International Journal of Computer Vision
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
On Median Graphs: Properties, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
International Journal of Computer Vision
A Unified Framework for Indexing and Matching Hierarchical Shape Structures
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Recent Advances in Structural Pattern Recognition with Applications to Visual Form Analysis
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Pattern Vectors from Algebraic Graph Theory
IEEE Transactions on Pattern Analysis and Machine Intelligence
Object Recognition as Many-to-Many Feature Matching
International Journal of Computer Vision
A study of graph spectra for comparing graphs and trees
Pattern Recognition
Many-to-many matching of scale-space feature hierarchies using metric embedding
Scale Space'03 Proceedings of the 4th international conference on Scale space methods in computer vision
Graphical models for graph matching
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Many-to-many graph matching via metric embedding
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Stability of the eigenvalues of graphs
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Coarse-to-Fine object recognition using shock graphs
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
| Hi-index | 0.00 |
In this paper we show how inexact multisubgraph matching can be solved using methods based on the projections of vertices (and their connections) into the eigenspaces of graphs - and associated clustering methods. Our analysis points to deficiencies of recent eigenspectra methods though demonstrates just how powerful full eigenspace methods can be for providing filters for such computationally intense problems. Also presented are some applications of the proposed method to shape matching,in formation retrieval and natural language processing.