Multibody Grouping from Motion Images
International Journal of Computer Vision
Nonlinear component analysis as a kernel eigenvalue problem
Neural Computation
A Multibody Factorization Method for Independently Moving Objects
International Journal of Computer Vision
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Journal of Combinatorial Theory Series A
Factorization with Uncertainty
International Journal of Computer Vision
A Factorization Approach to Grouping
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
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)
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
A multi-body factorization method for motion analysis
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Segmentation Using Eigenvectors: A Unifying View
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Dominant Sets and Hierarchical Clustering
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
A Unifying Approach to Hard and Probabilistic Clustering
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Inference of multiple subspaces from high-dimensional data and application to multibody grouping
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
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
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study
Data & Knowledge Engineering
Graph-Based Representations in Pattern Recognition and Computational Intelligence
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Randomized shortest-path problems: Two related models
Neural Computation
Mining cancer genes with running-sum statistics
Proceedings of the third international workshop on Data and text mining in bioinformatics
An incremental nested partition method for data clustering
Pattern Recognition
ACM Transactions on Graphics (TOG)
International Journal of Computer Vision
Disambiguating identity web references using Web 2.0 data and semantics
Web Semantics: Science, Services and Agents on the World Wide Web
ACM SIGGRAPH 2010 Courses
High-dimensional spectral feature selection for 3D object recognition based on reeb graphs
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Commute-time convolution kernels for graph clustering
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Learning shape segmentation using constrained spectral clustering and probabilistic label transfer
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
k-nearest neighbors in uncertain graphs
Proceedings of the VLDB Endowment
Information-geometric graph indexing from bags of partial node coverages
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Graph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks
Quantum Information & Computation
From points to nodes: inverse graph embedding through a lagrangian formulation
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
Commute time guided transformation for feature extraction
Computer Vision and Image Understanding
Pattern analysis with graphs: Parallel work at Bern and York
Pattern Recognition Letters
Discrete minimum distortion correspondence problems for non-rigid shape matching
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Data clustering by scaled adjacency matrix
KSEM'11 Proceedings of the 5th international conference on Knowledge Science, Engineering and Management
Invariants of distance k-graphs for graph embedding
Pattern Recognition Letters
Proceedings of the 21st ACM international conference on Information and knowledge management
3D shape classification using commute time
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Human action recognition in video by fusion of structural and spatio-temporal features
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Information-theoretic selection of high-dimensional spectral features for structural recognition
Computer Vision and Image Understanding
An indication of unification for different clustering approaches
Pattern Recognition
Graph matching and clustering using kernel attributes
Neurocomputing
Graph Kernels from the Jensen-Shannon Divergence
Journal of Mathematical Imaging and Vision
Information-Theoretic dissimilarities for graphs
SIMBAD'13 Proceedings of the Second international conference on Similarity-Based Pattern Recognition
Entropy and heterogeneity measures for directed graphs
SIMBAD'13 Proceedings of the Second international conference on Similarity-Based Pattern Recognition
3D-model retrieval using bag-of-features based on closed curves
3DOR '13 Proceedings of the Sixth Eurographics Workshop on 3D Object Retrieval
Hi-index | 0.14 |
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.