Feature-based correspondence: an eigenvector approach
Image and Vision Computing - Special issue: BMVC 1991
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
International Journal of Computer Vision
Modal Matching for Correspondence and Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
A RKHS Interpolator-Based Graph Matching Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Random Generation of Bayesian Networks
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Graphical models for graph matching: Approximate models and optimal algorithms
Pattern Recognition Letters - Special issue: In memoriam Azriel Rosenfeld
Graphical Models and Point Pattern Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Riemannian approach to graph embedding
Pattern Recognition
A spectral approach to shape-based retrieval of articulated 3D models
Computer-Aided Design
Image categorization: Graph edit distance+edge direction histogram
Pattern Recognition
Probabilistic relaxation labelling using the Fokker-Planck equation
Pattern Recognition
A Path Following Algorithm for Graph Matching
ICISP '08 Proceedings of the 3rd international conference on Image and Signal Processing
Similarity Invariant Delaunay Graph Matching
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
An Inexact Graph Comparison Approach in Joint Eigenspace
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Structural Object Recognition Using Entropy Correspondence Measure of Line Features
IEICE - Transactions on Information and Systems
Exploiting temporal statistics for events analysis and understanding
Image and Vision Computing
Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
A Novel Role-Based Movie Scene Segmentation Method
PCM '09 Proceedings of the 10th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Many-to-many graph matching: a continuous relaxation approach
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Graph attribute embedding via Riemannian submersion learning
Computer Vision and Image Understanding
Graph matching based on dot product representation of graphs
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Feature point matching using a hermitian property matrix
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
High efficiency and quality: large graphs matching
Proceedings of the 20th ACM international conference on Information and knowledge management
Graph embedding using commute time
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Point pattern matching via spectral geometry
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Recognition of 3d object using attributed relation graph of silhouette's extended convex hull
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
Sub-sampling for efficient spectral mesh processing
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Efficient image matching using weighted voting
Pattern Recognition Letters
Finding deformable shapes by point set matching through nonparametric belief propagation
Miar'06 Proceedings of the Third international conference on Medical Imaging and Augmented Reality
Approximating the problem, not the solution: an alternative view of point set matching
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Graph matching based on spectral embedding with missing value
Pattern Recognition
Two new graphs kernels in chemoinformatics
Pattern Recognition Letters
Coloring based approach for matching unrooted and/or unordered trees
Pattern Recognition Letters
A spectral-multiplicity-tolerant approach to robust graph matching
Pattern Recognition
High efficiency and quality: large graphs matching
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.14 |
Abstract--In this paper, we show how inexact graph matching (that is, the correspondence between sets of vertices of pairs of graphs) can be solved using the renormalization of projections of the vertices (as defined in this case by their connectivities) into the joint eigenspace of a pair of graphs and a form of relational clustering. An important feature of this eigenspace renormalization projection clustering (EPC) method is its ability to match graphs with different number of vertices. Shock graph-based shape matching is used to illustrate the model and a more objective method for evaluating the approach using random graphs is explored with encouraging results.