Mode seeking with an adaptive distance measure

LNCS v. 7585 has title: Computer Vision – ECCV 2012. Workshops and Demonstrations (Pt. 3)The mean shift algorithm is a widely used non-parametric clustering algorithm. It has been extended to cluster a mixture of linear subspaces for solving problems in computer vision such as multi-body motion segmentation, etc. Existing methods only work with a set of subspaces, which are computed from samples of observations. However, noises from observations can distort these subspace estimates and influence clustering accuracy. We propose to use both subspaces and observations to improve performance. Furthermore, while these mean shift methods use fixed metrics for computing distances, we prefer an adaptive distance measure. The insight is, we can use temporary modes in a mode seeking process to improve this measure and obtain better performance. In this paper, an adaptive mode seeking algorithm is proposed for clustering linear subspaces. By experiments, the proposed algorithm compares favorably to the state-of-the-art algorithm in terms of clustering accuracy. © 2012 Springer-Verlag