Attributed relational graph matching based on the nested assignment structure
- 15 September 2009
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 43 (3) , 914-928
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Protein classification by matching and clustering surface graphsPattern Recognition, 2006
- Graph matching and clustering using spectral partitionsPattern Recognition, 2006
- Kronecker product graph matchingPattern Recognition, 2003
- Relational object recognition from large structural librariesPattern Recognition, 2002
- Structural graph matching using the EM algorithm and singular value decompositionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- A PCA approach for fast retrieval of structural patterns in attributed graphsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2001
- A NON-ITERATIVE PROBABILISTIC METHOD FOR CONTEXTUAL CORRESPONDENCE MATCHINGPattern Recognition, 1998
- A linear programming approach for the weighted graph matching problemIEEE Transactions on Pattern Analysis and Machine Intelligence, 1993
- Matching: Invariant to translations, rotations and scale changesPattern Recognition, 1992
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955