This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Clustering and Embedding Using Commute Times
November 2007 (vol. 29 no. 11)
pp. 1873-1890
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation and multi-body motion tracking. Our starting point is the lazy random walk on the graph, which is determined by the heatkernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterize the random walk using the commute time (i.e. the expected time taken for a random walk to travel between two nodes and return) and show how this quantity may be computed from the Laplacian spectrum using the discrete Green’s function. Our motivation is that the commute time can be anticipated to be a more robust measure of the proximity of data than the raw proximity matrix. In this paper, we explore two applications of the commute time. The first is to develop a method for image segmentation using the eigenvector corresponding to the smallest eigenvalue of the commute time matrix. We show that our commute time segmentation method has the property of enhancing the intra-group coherence while weakening inter-group coherence and is superior to the normalized cut. The second application is to develop a robust multi-body motion tracking method using an embedding based on the commute time. Our embedding procedure preserves commute time, and is closely akin to kernel PCA, the Laplacian eigenmap and the diffusion map. We illustrate the results both on synthetic image sequences and real world video sequences, and compare our results with several alternative methods.

[1] P. Anandan and M. Irani, “Factorization with Uncertainty,” Int'l J. Computer Vision, vol. 49, no. 2-3, pp. 101-116, 2002.
[2] M. Belkin and P. Niyogi, “Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering,” Advances in Neural Information Processing Systems, pp. 585-591, 2001.
[3] M. Belkin and P. Niyogi, “Laplacian Eigenmaps for Dimensionality Reduction and Data Representation,” Neural Computation, vol. 15, no. 6, pp. 1373-1396, 2003.
[4] F.R.K. Chung, Spectral Graph Theory, Am. Math. Soc. ed., CBMS 92, 1997.
[5] F.R.K. Chung and S.T. Yau, “Discrete Green's Functions,” J.Combinatorial Theory Series, pp. 191-214, 2000.
[6] 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,” Proc. Nat'l Academy of Sciences, vol. 102, no. 21, pp. 7426-7431, 2005.
[7] J. Costeira and T. Kanade, “A Multi-Body Factorization Method for Motion Analysis,” Proc. Fifth Int'l Conf. Computer Vision, pp.1071-1076, 1995.
[8] J. Costeira and T. Kanade, “A Multibody Factorization Method for Independently Moving Objects,” Int'l J. Computer Vision, vol. 29, no. 3, pp. 159-179, 1997.
[9] Z. Fan, J. Zhou, and Y. Wu, “Inference of Multiple Subspaces from High-Dimensional Data and Application to Multibody Grouping,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 661-666, 2004.
[10] Z. Fan, J. Zhou, and Y. Wu, “Multibody Motion Segmentation Based on Simulated Annealing,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 776-781, 2004.
[11] I. Fischer and J. Poland, “Amplifying the Block Matrix Structure for Spectral Clustering,” technical report, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), 2005.
[12] F. Fouss, L. Yen, A. Pirotte, and M. Saerens, “An Experimental Investigation of Graph Kernels on Two Collaborative Recommendation Tasks,” Proc. Sixth IEEE Int'l Conf. Data Mining, 2006.
[13] C.W. Gear, “Multibody Grouping from Motion Images,” Int'l J. Computer Vision, vol. 29, no. 2, pp. 130-150, 1998.
[14] A. Gruber and Y. Weiss, “Multibody Factorization with Uncertainty and Missing Data Using the EM Algorithm,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 707-714, 2004.
[15] L.W. Hagen and A.B. Kahng, “New Spectral Methods for Ratio Cut Partitioning and Clustering,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 11, no. 9, pp. 1074-1085, 1992.
[16] X. He and P. Niyogi, “Locality Preserving Projections,” Proc. Neural Information Processing System Conf., pp. 585-591, 2003.
[17] H. Hotelling, “Analysis of Complex Statistical Variables in Principal Components,” J. Educational Psychology, vol. 24, pp.417-441, 498-520, 1933.
[18] N. Ichimura, “Motion Segmentation Based on Factorization Method and Discriminant Criterion,” Proc. Seventh IEEE Int'l Conf. Computer Vision, pp. 600-605, 1999.
[19] K. Kanatani, “Motion Segmentation by Subspace Separation and Model Selection,” Proc. Eighth IEEE Int'l Conf. Computer Vision, pp.301-306, 2001.
[20] R. Kondor and J. Lafferty, “Diffusion Kernels on Graphs and Other Discrete Structures,” Proc. 19th Int'l Conf. Machine Learning, 2002.
[21] J.B. Kruskal and M. Wish, Multidimensional Scaling. Sage Publications, 1978.
[22] S. Lafon and A.B. Lee, “Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameterization,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 9, pp. 1393-1403, Sept. 2006.
[23] J.B. MacQueen, “Some Methods for Classification and Analysis of Multivariate Observations,” Proc. Fifth Berkeley Symp. Math. Statistics and Probability, pp. 281-297, 1967.
[24] M. Meilă and J. Shi, “A Random Walks View of Spectral Segmentation,” Proc. Neural Information Processing Systems Conf., pp. 873-879, 2000.
[25] B. Nadler, S. Lafon, R.R. Coifman, and I.G. Kevrekidis, “Diffusion Maps, Spectral Clustering and Eigenfunctions of Fokker-Planck Operators,” Proc. Neural Information Processing Systems Conf., 2005.
[26] A. Ng, M. Jordan, and Y. Weiss, “On Spectral Clustering: Analysis and an Algorithm,” Proc. Neural Information Processing Systems Conf., 2001.
[27] J. Park, H. Zha, and R. Kasturi, “Spectral Clustering for Robust Motion Segmentation,” Proc. European Conf. Computer Vision, pp.390-401, 2004.
[28] M. Pavan and M. Pelillo, “Dominant Sets and Hierarchical Clustering,” Proc. Ninth IEEE Int'l Conf. Computer Vision, pp.362-369, 2003.
[29] M. Pavan and M. Pelillo, “A New Graph-Theoretic Approach to Clustering and Segmentation,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition , vol. I, pp. 145-152, 2003.
[30] P. Perona and W.T. Freeman, “A Factorization Approach to Grouping,” Proc. European Conf. Computer Vision, pp. 655-670, 1998.
[31] H. Qiu and E.R. Hancock, “Image Segmentation Using Commute Times,” Proc. British Machine Vision Conf., pp. 929-938, 2005.
[32] S. Roweis and L. Saul, “Nonlinear Dimensionality Reduction by Locally Linear Embedding,” Science, vol. 290, no. 5500, pp. 2323-2326, 2000.
[33] M. Saerens, F. Fouss, L. Yen, and P. Dupont, “The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering,” Proc. 15th European Conf. Machine Learning, vol. 3201, pp. 371-383, 2004.
[34] S. Sarkar and K.L. Boyer, “Quantitative Measures of Change Based on Feature Organization: Eigenvalues and Eigenvectors,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, p. 478, 1996.
[35] B. Scholkopf, A. Smola, and K. Muller, “Nonlinear Component Analysis as a Kernel Eigenvalue Problem,” Neural Computation, vol. 10, pp. 1299-1319, 1998.
[36] G. Scott and H. Longuet-Higgins, “Feature Grouping by Relicalisation of Eigenvectors of the Proximity Matrix,” Proc. British Machine Vision Conf., pp. 103-108, 1990.
[37] J. Shi and J. Malik, “Normalized Cuts and Image Segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, Aug. 2000.
[38] J. Shi and C. Tomasi, “Good Features to Track,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 593-600, 1994.
[39] Y. Sugaya and K. Kanatani, “Outlier Removal for Motion Tracking by Subspace Separation,” IEICE Trans. Information and Systems, vol. E86-D, no. 6, pp. 1095-1102, 2003.
[40] Y. Sugaya and K. Kanatani, “Multi-Stage Unsupervised Learning for Multi-Body Motion Segmentation,” IEICE Trans. Information and Systems, vol. E87-D, no. 7, pp. 1935-1942, 2004.
[41] J.B. Tenenbaum, V. de Silva, and J.C. Langford, “A Global Geometric Framework for Nonlinear Dimensionality Reduction,” Science, vol. 290, no. 5500, pp. 2319-2323, 2000.
[42] Y. Weiss, “Segmentation Using Eigenvectors: A Unifying View,” Proc. Seventh IEEE Int'l Conf. Computer Vision, pp. 975-982, 1999.
[43] Y. Wu, Z. Zhang, T.S. Huang, and J.Y. Lin, “Multibody Grouping via Orthogonal Subspace Decomposition,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 252-257, 2001.
[44] R. Zass and A. Shashua, “A Unifying Approach to Hard and Probabilistic Clustering,” Proc. 10th IEEE Int'l Conf. Computer Vision, 2005.
[45] L. Zelnik-Manor and M. Irani, “Degeneracies, Dependencies and Their Implications in Multi-Body and Multi-Sequence Factorizations,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 287-293, 2003.

Index Terms:
Commute time, clustering, embedding, Cspectral graph theory, image segmentation, motion tracking
Citation:
Huaijun Qiu, Edwin R. Hancock, "Clustering and Embedding Using Commute Times," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no. 11, pp. 1873-1890, Nov. 2007, doi:10.1109/TPAMI.2007.1103
Usage of this product signifies your acceptance of the Terms of Use.