An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
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 Parallel Algorithm for Graph Matching and Its MasPar Implementation
IEEE Transactions on Parallel and Distributed Systems
Multiple graph matching with Bayesian inference
Pattern Recognition Letters - special issue on pattern recognition in practice V
A graph distance metric based on the maximal common subgraph
Pattern Recognition Letters
Graph Matching With a Dual-Step EM Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A POCS-Based Graph Matching Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
The Successive Projection Graph Matching (SPGM) algorithm, capable of performing full- and sub-graph matching, is presented in this paper. Projections Onto Convex Sets (POCS) methods have been successfully applied to signal processing applications, image enhancement, neural networks and optics. The SPGM algorithm is unique in the way a constrained cost function is minimized using POCS methodology. Simulation results indicate that the SPGM algorithm compares favorably to other well-known graph matching algorithms.