Robust Multi-body Motion Tracking Using Commute Time Clustering

Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the effect of noise on the shape interaction matrix, which looses its block-diagonal structure and as a result the assignment of elements to objects becomes difficult. The aim in this paper is to overcome this problem using graph-spectral embedding and the k-means algorithm. To this end we develop a representation based on the commute time between nodes on a graph. The commute time (i.e. the expected time taken for a random walk to travel between two nodes and return) can be computed from the Laplacian spectrum using the discrete Green's function, and is an important property of the random walk on a graph. The commute time is a more robust measure of the proximity of data than the raw proximity matrix. Our embedding procedure preserves commute time, and is closely akin to kernel PCA, the Laplacian eigenmap and...

• Type: Conference
• Year: 2006
• Where: ECCV
• Authors: Huaijun Qiu, Edwin R. Hancock
• Keywords: Commute Time, Computer Vision, ECCV 2006, Preserves Commute Time, Random Walk, Raw Proximity Matrix, Real-world Multi-body Motion