Graph embedding using commute time

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

Volumn 4109 LNCS, Issue , 2006, Pages 441-449

  Qiu, Huaijun ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE DETECTION; GRAPH THEORY; IMAGE CODING; LAPLACE TRANSFORMS; MATRIX ALGEBRA; VECTORS;

DATA CLUSTERING; EDGE INSERTIONS; IMAGE SEQUENCES; VECTOR SPACE;

DATA STRUCTURES;

EID: 33749648805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11815921_48     Document Type: Conference Paper

References (19)

1. X. Bai, H. Yu, and E.R. Hancock. Graph matching using spectral embedding and alignment. In ICPR, pages 398-401, 2004.
2. M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in Neural Information Processing Systems, pages 585-591, 2001.
3. M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373-1396, 2003.
4. T. Caelli and S. Kosinov. An eigenspace projection clustering method for inexact graph matching. IEEE Trans. Pattern Anal. Mach. Intell., 26(4):515-519, 2004.
5. M. Carcassoni and E.R. Hancock. Spectral correspondence for point pattern matching. Pattern Recognition, 36(1): 193-204, 2003.
6. F.R.K. Chung and S.-T. Yau. Discrete green's functions. In J. Combin. Theory Ser., pages 191-214, 2000.
7. J. Costeira and T. Kanade. A multi-body factorization method for motion analysis. In ICCV, pages 1071-1076, 1995.
8. J. Costeira and T. Kanade. A multibody factorization method for independently moving objects. IJCV, 29(3): 159- 179, 1997.
9. D. Harel and Y Koren. Graph drawing by high-dimensional embedding. In GD '02: Revised Papers from the 10th International Symposium on Graph Drawing, pages 207-219, 2002.
10. X. He and P. Niyogi. Locality preserving projections. In NIPS, pages 585-591, 2003.
11. B. Luo, R.C. Wilson, and E.R. Hancock. Spectral embedding of graphs. 2002 Winter Workshop on Computer Vision, 2002.
12. J. B. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, pages 281-297, 1967.
13. H. Qiu and E.R. Hancock. Image segmentation using commute times. In BMVC, pages 929-938, 2005.
14. S. Roweis and L. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323-2326, 2000.
15. R.R.Coifman, S. Lafon, A.B. Lee, M. Maggioni, B. Nadler, F. Warner, and S.W. Zucker. Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps. National Academy of Sciences, 102(21):7426-7431, 2005.
16. B. Sch, A. Smola, and K. Muller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10:1299-1319, 1998.
17. L. Shapiro and J. Brady. Feature-based correspondence: an eigenvector approach. Image and Vision Computing, 10(2):283-288, June 1992.
18. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE PAMI, 22(8):888-905, 2000.
19. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000.