Manifold Blurring Mean Shift Algorithms for Manifold Denoising

author: Miguel Á. Carreira-Perpiñán, Department of Electrical Engineering and Computer Science, University of California Merced
published: July 19, 2010,   recorded: June 2010,   views: 5709


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


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.

See Also:

Download slides icon Download slides: cvpr2010_carreira_perpinan_mbms_01.v1.pdf (9.1 MB)

Download article icon Download article: cvpr2010_carreira_perpinan_mbms_01.pdf (8.7 MB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: