An eigenspace projection clustering method for inexact graph matching

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 26, Issue 4, 2004, Pages 515-519

  Caelli, Terry ^a   Kosinov, Serhiy ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Correspondence clustering; Eigendecomposition; Eigenspace projections; Inexact multisubgraph matching; Random graphs; Shape matching

Indexed keywords

CHARACTER RECOGNITION; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; IMAGE ANALYSIS; MATHEMATICAL MODELS; OBJECT RECOGNITION; PATTERN MATCHING;

EIGENDECOMPOSITION; EIGENSPACE PROJECTION CLUSTERING METHOD; EIGENSPACE PROJECTIONS; GRAPH MATCHING; SHAPE MATCHING;

COMPUTER VISION;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; CLUSTER ANALYSIS; COMPARATIVE STUDY; COMPUTER ASSISTED DIAGNOSIS; COMPUTER GRAPHICS; COMPUTER SIMULATION; EVALUATION; IMAGE ENHANCEMENT; IMAGE SUBTRACTION; INFORMATION RETRIEVAL; MATHEMATICAL COMPUTING; METHODOLOGY; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY; SIGNAL PROCESSING; THREE DIMENSIONAL IMAGING; VALIDATION STUDY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; COMPUTER GRAPHICS; COMPUTER SIMULATION; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; IMAGING, THREE-DIMENSIONAL; INFORMATION STORAGE AND RETRIEVAL; NUMERICAL ANALYSIS, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY; SIGNAL PROCESSING, COMPUTER-ASSISTED; SUBTRACTION TECHNIQUE;

EID: 1842426385     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2004.1265866     Document Type: Article

References (15)

1. D. Davies and D. Bouldin, "A Cluster Separation Measure," IEEE Trans. Pattern Recognition and Machine Intelligence, vol. 1, no. 2, pp. 224-227, 1979.
2. J.S. Ide and F.G. Cozman, "Generating Random Bayesian Networks," Proc. Brazilian Symp. Artificial Intelligence, 2002.
3. S. Lee, J. Kim, "Attributed Stokegraph Matching for Seal Imprint Verification," Pattern Recognition Letters, vol. 9, pp. 137-145, 1989.
4. B. Luo and E. Hancock, "Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1120-1136, Oct. 2001.
5. M. Pelillo, K. Siddiqi, and S.W. Zucker, "Many-to-Many Matching of Attributed Trees Using Association Graphs and Game Dynamics," Visual Form 2001, Lecture Notes in Computer Science, vol. 2059, pp. 583-593, Springer, 2001.
6. S. Sclaroff and A. Pentland, "Modal Matching for Correspondence and Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 6, pp. 545-561, June 1995.
7. G. Scott and H. Longuet-Higgins, "An Algorithm for Associating the Features of Two Patterns," Proc. Royal Soc. London, vol. B244, 1991.
8. L. Shapiro and J. Brady, "Feature-Based Correspondence-An Eigenvector Approach," Proc. Int'l Verilog HDL Conf., vol. 10, 1992.
9. L. Shapiro and J. Brady, "Feature-Based Correspondence-An Eigenvector Approach," Image and Vision Computing, vol. 10, pp. 268-281, 1992.
10. K. Siddiqi, S. Bouix, A. Tannebaum, and S. Zucker, "Hamilton-Jacobi Skeletons," Int'l J. Computer Vision, to appear.
11. K. Siddiqi, A. Shokoufandeh, S. Dickinson, and S. Zucker, "Shock Graphs and Shape Matching," Int'l J. Computer Vision, vol. 30, pp. 1-24, 1999.
12. M. Steinbach, G. Karypis, and V. Kumar, A Comparison of Document Clustering Techniques. 2000.
13. A. van Wyk, T. Tariq, and B. van Wyk, "A RKHS Interpolator-Based Graph Matching Algorithm," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 988-995, July 2002.
14. S. Wu, Y. Ren, and C. Suen, "Hierarchical Attributed Graph Representation and Recognition of Handwritten Chinese Characters," Pattern Recognition, vol. 24, pp. 617-632, 1991.
15. W. Zwick and W. Velicer, "Comparison of Five Rules for Determining the Number of Components to Retain," Psychological Bull., vol. 99, 1986.