Mean Shift Is a Bound Optimization

Authors:
Mark Fashing;Carlo Tomasi
Affiliations:
-;IEEE
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2005

Citing 6
Cited 20

A view of the EM algorithm that justifies incremental, sparse, and other variants

Learning in graphical models
Mean Shift: A Robust Approach Toward Feature Space Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean Shift, Mode Seeking, and Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean Shift Analysis and Applications

ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Using Temporal Coherence to Build Models of Animals

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2

A note on the convergence of the mean shift

Pattern Recognition
Gaussian Mean-Shift Is an EM Algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean shift-based clustering

Pattern Recognition
Mean shift: An information theoretic perspective

Pattern Recognition Letters
Object tracking using SIFT features and mean shift

Computer Vision and Image Understanding
Synthetic data generation technique in Signer-independent sign language recognition

Pattern Recognition Letters
Nonlinear Mean Shift over Riemannian Manifolds

International Journal of Computer Vision
Adaptive pyramid mean shift for global real-time visual tracking

Image and Vision Computing
Estimation of naso frontal angle for detection of Down syndrome in second trimester fetal images

Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Finite Sample Bias of Robust Estimators in Segmentation of Closely Spaced Structures: A Comparative Study

Journal of Mathematical Imaging and Vision
A Lagrangian Half-Quadratic approach to robust estimation and its applications to road scene analysis

Pattern Recognition Letters
An experimental study of color-based segmentation algorithms based on the mean-shift concept

ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Parallel mean shift for interactive volume segmentation

MLMI'10 Proceedings of the First international conference on Machine learning in medical imaging
Supervised chromosome clustering and image classification

Future Generation Computer Systems
Deformable Model Fitting by Regularized Landmark Mean-Shift

International Journal of Computer Vision
Multibandwidth kernel-based object tracking

Advances in Artificial Intelligence - Special issue on machine learning paradigms for modeling spatial and temporal information in multimedia data mining
Accelerated convergence using dynamic mean shift

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Dynamics of a mean-shift-like algorithm and its applications on clustering

Information Processing Letters
MIL-SKDE: Multiple-instance learning with supervised kernel density estimation

Signal Processing
On the convergence of the mean shift algorithm in the one-dimensional space

Pattern Recognition Letters

Quantified Score

Hi-index	0.14

Visualization

Abstract

We build on the current understanding of mean shift as an optimization procedure. We demonstrate that, in the case of piecewise constant kernels, mean shift is equivalent to Newton's method. Further, we prove that, for all kernels, the mean shift procedure is a quadratic bound maximization.