Stereo Correspondence Through Feature Grouping and Maximal Cliques
IEEE Transactions on Pattern Analysis and Machine Intelligence
Constrained nets for graph matching and other quadratic assignment problems
Neural Computation
A Bayesian compatibility model for graph matching
Pattern Recognition Letters
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiple graph matching with Bayesian inference
Pattern Recognition Letters - special issue on pattern recognition in practice V
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Replicator equations, maximal cliques, and graph isomorphism
Neural Computation
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A RKHS Interpolator-Based Graph Matching Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Non-bayesian Graph Matching without Explicit Compatibility Calculations
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Matching Delauny Triangulations by Probabilistic Relaxation
CAIP '95 Proceedings of the 6th International Conference on Computer Analysis of Images and Patterns
Optimization in model matching and perceptual organization
Neural Computation
Orthonormal Kernel Kronecker product graph matching
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Orthonormal Kernel Kronecker product graph matching
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Hi-index | 0.00 |
This paper introduces a novel algorithm for performing Attributed Graph Matching (AGM). The Orthonormal Kernel Kronecker Product Graph Matching (OKKPGM) algorithm is based on the recently introduced Kronecker Product Graph Matching (KPGM) formulation. However, unlike previous algorithms based on the KPGM formulation which avoided explicit compatibility calculations, the OKKPGM algorithm obtains an estimate to the Kronecker Match Matrix (KMM) using kernel function evaluations. A permutation sub-matrix (match matrix), is then inferred from the KMM using a summation procedure.