On the Convergence of the Mean Shift Algorithm in the One-Dimensional Space
Computer Vision and Pattern Recognition
2014-07-14 v1
Abstract
The mean shift algorithm is a non-parametric and iterative technique that has been used for finding modes of an estimated probability density function. It has been successfully employed in many applications in specific areas of machine vision, pattern recognition, and image processing. Although the mean shift algorithm has been used in many applications, a rigorous proof of its convergence is still missing in the literature. In this paper we address the convergence of the mean shift algorithm in the one-dimensional space and prove that the sequence generated by the mean shift algorithm is a monotone and convergent sequence.
Cite
@article{arxiv.1407.2961,
title = {On the Convergence of the Mean Shift Algorithm in the One-Dimensional Space},
author = {Youness Aliyari Ghassabeh},
journal= {arXiv preprint arXiv:1407.2961},
year = {2014}
}
Comments
13 pages, 10 figures, Published in Pattern Recognition Letters