On the convergence and consistency of the blurring mean-shift process

DOI10.1007/S10463-013-0443-8MaRDI QIDQ2255170zbMATH OpenOpenAlexFDO

Authors Ting-Li Chen

Publication date 6 February 2015

Published in Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1305.1040

zbMATH Keywords

\(\gamma\)-divergenceclusteringconsistencyconvergencemean-shiftsuper robustness

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Machine vision and scene understanding (68T45) Computing methodologies for image processing (68U10)

Abstract: The mean-shift algorithm is a popular algorithm in computer vision and image processing. It can also be cast as a minimum gamma-divergence estimation. In this paper we focus on the "blurring" mean shift algorithm, which is one version of the mean-shift process that successively blurs the dataset. The analysis of the blurring mean-shift is relatively more complicated compared to the nonblurring version, yet the algorithm convergence and the estimation consistency have not been well studied in the literature. In this paper we prove both the convergence and the consistency of the blurring mean-shift. We also perform simulation studies to compare the efficiency of the blurring and the nonblurring versions of the mean-shift algorithms. Our results show that the blurring mean-shift has more efficiency.

Recommendations

• Design of blurring mean-shift algorithms for data classification
• A note on the convergence of the mean shift
• Discussion of the convergence for mean shift algorithm
• Convergence analysis of mean Shift algorithm
• scientific article; zbMATH DE number 2165696

Cites work

• \(\gamma\)-SUP: a clustering algorithm for cryo-electron microscopy images of asymmetric particles
• A note on the convergence of the mean shift
• Dynamics of a mean-shift-like algorithm and its applications on clustering
• scientific article; zbMATH DE number 795297 (Why is no real title available?)
• Mean shift-based clustering
• Robust parameter estimation with a small bias against heavy contamination
• The estimation of the gradient of a density function, with applications in pattern recognition

Cited in

(12)

• Convergence and stability analysis of mean-shift algorithm on large data sets
• Blurring: an approach to conflation
• scientific article; zbMATH DE number 6670731 (Why is no real title available?)
• Design of blurring mean-shift algorithms for data classification
• Discussion of the convergence for mean shift algorithm
• A modified self-updating clustering algorithm for application to dengue gene expression data
• An intuitive clustering algorithm for spherical data with application to extrasolar planets
• An automatic clustering algorithm for probability density functions
• On the strengths of the self-updating process clustering algorithm
• Randomized self-updating process for clustering large-scale data
• A note on the convergence of the mean shift
• On the weak convergence and central limit theorem of blurring and nonblurring processes with application to robust location estimation

This page was built for publication: On the convergence and consistency of the blurring mean-shift process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2255170)