Commute times for graph spectral clustering

Authors:
Huaijun Qiu;Edwin R. Hancock
Affiliations:
Department of Computer Science, University of York, York, UK;Department of Computer Science, University of York, York, UK
Venue:
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Year:
2005

Citing 7
Cited 0

The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Discrete Green's functions

Journal of Combinatorial Theory Series A
Diffusion Kernels on Graphs and Other Discrete Input Spaces

ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Quantitative Measures of Change based on Feature Organization: Eigenvalues and Eigenvectors

CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
Graph matching using Random Walks

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
A new graph-theoretic approach to clustering and segmentation

CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper exploits the properties of the commute time to develop a graph-spectral method for image segmentation. Our starting point is the lazy random walk on the graph, which is determined by the heat-kernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise the random walk using the commute time between nodes, and show how this quantity may be computed from the Laplacian spectrum using the discrete Green's function. We explore the application of the commute time for image segmentation using the eigenvector corresponding to the smallest eigenvalue of the commute time matrix.