Inexact matching of large and sparse graphs using laplacian eigenvectors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5534 LNCS, Issue , 2009, Pages 144-153

  Knossow, David ^a   Sharma, Avinash ^a   Mateus, Diana ^a   Horaud, Radu ^a  

^a INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES; EIGENVECTOR COMPUTATIONS; EIGENVECTORS; EMBEDDINGS; GRAPH LAPLACIAN; INEXACT GRAPH MATCHING; LAPLACIAN EIGENVECTORS; LAPLACIAN MATRICES; LARGE GRAPHS; REGISTRATION ALGORITHMS; SPARSE GRAPHS; SPECTRAL MATCHING ALGORITHMS; TWO-GRAPHS;

ALGORITHMS; LAPLACE TRANSFORMS; PATTERN MATCHING;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 70349791916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02124-4_15     Document Type: Conference Paper

References (13)

1. Umeyama, S.: An eigen decomposition approach to weighted graph matching problems. IEEE PAMI 10, 695-703 (1988)
2. Scott, G., Longuet-Higgins, C.: An algorithm for associating the features of two images. Proceedings Biological Sciences 244, 21-26 (1991)
3. Shapiro, L., Brady, J.: Feature-based correspondence: an eigenvector approach. Image and Vision Computing 10, 283-288 (1992)
4. Carcassoni, M., Hancock, E.R.: Correspondence matching with modal clusters. IEEE PAMI 25, 1609-1615 (2003)
5. Carcassoni, M., Hancock, E.R.: Spectral correspondence for point pattern matching. Pattern Recognition 36, 193-204 (2003)
6. Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15, 1373-1396 (2003)
7. Caelli, T., Kosinov, S.: An eigenspace projection clustering method for inexact graph matching. IEEE PAMI 26, 515-519 (2004)
8. Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: NIPS (2002)
9. Chung, F.: Spectral Graph Theory. American Mathematical Society, Providence (1997)
10. Zhang, H., van Kaick, O., Dyer, R.: Spectral methods for mesh processing and analysis. In: Eurographics Symposium on Geometry Processing (2007)
11. Biyikoglu, T., Leydold, J., Stadler, P.F.: Laplacian Eigenvectors of Graphs. Springer, Heidelberg (2007)
12. Fraley, C., Raftery, A.: MCLUST version 3 for R: Normal mixture modeling and model-based clustering. Technical Report 504, Department of Statistics, University of Washington (2006)
13. Mateus, D., Horaud, R., Knossow, D., Cuzzolin, F., Boyer, E.: Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration. In: CVPR (2008)