Manifold Blurring Mean Shift Algorithms

We propose a new family of algorithms for denoising data assumed to lie on a low-dimensional manifold. The algorithms are based on the blurring mean-shift update, which moves each data point towards its neighbors, but constrain the motion to be orthogonal to the manifold. The resulting algorithms are nonparametric, simple to implement and very effective at removing noise while preserving the curvature of the manifold and limiting shrinkage. They deal well with extreme outliers and with variations of density along the manifold. We apply them as preprocessing for dimensionality reduction; and for nearest-neighbor classification of MNIST digits, with consistent improvements up to 36% over the original data.

• Type: Conference
• Year: 2010
• Where: CVPR
• Authors: Weiran Wang, Miguel Carreira-perpinan
• Keywords: Algorithms, Computer Vision, CVPR 2010, Data Point, Low-dimensional Manifold