Manifold embedding for shape analysis

Neurocomputing

Volumn 73, Issue 10-12, 2010, Pages 1606-1613

  Xiao, Bai ^a   Hancock, Edwin ^b   Yu, Hang ^c  

^a BEIHANG UNIVERSITY   (China)

^b UNIVERSITY OF YORK   (United Kingdom)

^c UNIVERSITY OF FLORIDA   (United States)

Author keywords

Graph embedding; Manifold learning; Shape analysis; Spectral alignment

Indexed keywords

CORRESPONDENCE PROBLEMS; EIGENSPACES; EIGENVALUES AND EIGENVECTORS; EUCLIDEAN SPACES; GRAPH EMBEDDINGS; GRAPH SPECTRAL METHODS; GRAPH STRUCTURES; ISOMAP ALGORITHMS; MANIFOLD LEARNING; METRIC SPACES; MPEG-7 DATABASE; PERCEPTUAL INFORMATION; POINT DISTRIBUTION MODELS; SEMI-DEFINITE PROGRAMMING; SHAPE ANALYSIS; SHAPE INFORMATION; VISUAL INFORMATION ANALYSIS;

ALIGNMENT; COMPUTER VISION; EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL PROGRAMMING; MOTION PICTURE EXPERTS GROUP STANDARDS; SPECTROSCOPY; TOPOLOGY; VISUAL COMMUNICATION;

COVARIANCE MATRIX;

ALGORITHM; ANALYTIC METHOD; ARTICLE; CALCULATION; CONTROLLED STUDY; EMBEDDING; GRAPH SPECTRAL METHOD; IMAGE DISPLAY; INFORMATION PROCESSING; INTERMETHOD COMPARISON; LEARNING; PRIORITY JOURNAL; SHAPE ANALYSIS; STATISTICAL ANALYSIS;

EID: 77952550760     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2009.10.023     Document Type: Article

References (35)

1. Belkin M., Niyogi P. Laplacian eigenmaps and spectral techniques for embedding and clustering. Neural Information Processing Systems 2002, 14:634-640.
2. Bunke H. Error correcting graph matching: on the influence of the underlying cost function. IEEE Transaction on Pattern Analysis and Machine Intelligence 1999, 21(9):917-922.
3. Carcassoni M., Hancock E.R. Correspondence matching with modal clusters. IEEE Transaction on Pattern Analysis and Machine Intelligence 2003, 25(12):1609-1615.
4. Cootes T.F., Edwards G.J., Taylor C.J. Active appearance models. European Conference on Computer Vision, Lecture Notes in Computer Science 1998, vol. 1407. Springer-Verlag, Freiburg, Germany, p. 484.
5. Cootes T.F., Taylor C.J., Cooper D.H., Graham J. Active shape models-their training and application. Computer Vision and Image Understanding 1995, 61(1):38-59.
6. Cox T., Cox M. Multidimensional Scaling 1994, Chapman and Hall.
7. Dijkstra E.W. A note on two problems in connexion with graphs. Numerische Mathematik 1959, 1:269-271.
8. Figueiredo M.A.F., Jain A.K. Unsupervised learning of finite mixture models. IEEE PAMI 2002, 24(3):381-396.
9. Fujisawa K., Kojima M., Nakata K. Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. Mathematical Programming 1997, 79:235-253.
10. Scott G.L., Longuett-Higgins H.C. An algorithm for associating the features of two images. Proceedings of the Royal Society of London B 1991, 244:21-26.
11. Harris C., Stephens M. A combined corner and edge detector. Proceedings of the 4th Alvey Vision Conference 1998, 189-192. Manchester, UK.
12. Jolliffe I.T. Principal Component Analysis 1986, Springer-Verlag.
13. Tenenbaum J.B., Silva V.D., Langford J.C. A global geometric framework for nonlinear dimensionality reduction. Science 2000, 290:586-591.
14. K. Fujisawa, Y. Futakata, M. Kojima, K. Nakata, M. Yamashita, Sdpa-m user's manual, 2002. http://sdpa.is.titech.ac.jp/SDPA-M.
15. Klassen X., Srivastava A., Mio W., Joshi S.H. Analysis of planar shapes using geodesic paths on shape spaces. IEEE Transactions on Pattern Analysis and Machine Intelligence 2004, 26:372-383.
16. Siddiqi K., Shokoufandeh A., Dickinson S., Zucker S. Shock graphs and shape matching. International Journal of Computer Vision 1999, 30:1-24.
17. Lee C.G., Small C.G. Multidimensional scaling of simplex shapes. Pattern Recognition 1999, 32:1601-1613.
18. Shapiro L.S., Brady J.M. Feature-based correspondence: an eigenvector approach. Image and Vision Computing 1992, 10:283-288.
19. Luo B., Hancock E.R. Structural graph matching using the em algorithm and singular value decomposition. IEEE Transaction on Pattern Analysis and Machine Intelligence 2001, 23(10):1120-1136.
20. Luo B., Wilson R., Hancock E. Eigenspaces for graphs. International Journal for Image Graphics 2002, 2:247-268.
21. Todd M. Semidefinite optimization. Acta Numerica 2001, 10:515-560.
22. Murase H., Nayar S.K. Illumination planning for object recognition using parametric eigenspaces. IEEE Transactions on Pattern Analysis and Machine Intelligence 1994, 16:1219-1227.
23. Nene S.A., Nayar S.K., Murase H. Columbia Object Image Library (coil 100) 1996, Columbia University.
24. Linial N., London E., Rabinovichm Y. The geometry of graphs and some its algorithmic application. Combinatorica 1995, 15:215-245.
25. Duda R.O., Hart P.E., Stork D.H. Pattern Classification 2000, Wiley Interscience.
26. Siddiqi K., Shokoufandeh A., Dickinson S.J., Zucker S.W. Shock graphs and shape matching. International Journal of Computer Vision 1999, 35(1):13-32.
27. S. Jeannin, M. Bober, Description of core experiments for mpeg-7 motion/shape, Technical Report ISO/IEC JTC 1/SC 29/WG 11 MPEG99, 1999.
28. Umeyamam S. An eigen decomposition approach to weighted graph matching problems. IEEE PAMI 1988, 10:695-703.
29. Cox T., Cox M. Multidimensional Scaling 1994, Chapman and Hall.
30. Torsello A., Robles-Kelly A., Hancock E.R. Discovering shape classes using tree edit-distance and pairwise clustering. International Journal of Computer Vision 2007, 72(3):259-285.
31. Vandenberghe L., Boyd S. Semidefinite programming. SIAM Review 1996, 38:49-95.
32. Vapnik V. Statistical Learning Theory 1998, Wiley, New York.
33. Wilson R.C., Luo B., Hancock E.R. Pattern vectors from algebraic graph theory. TPAMI 2003, 27:2220-2237.
34. Wolkowicz H., Saigal R., Vandenberghe L. Handbook of Semidefinite Programming 2000, Kluwer Academic Publishers.
35. B. Xiao, E.R. Hancock, A spectral generative model for graph structure, in: SSPR/SPR, 2006, pp. 173-181.