On the convergence and consistency of the blurring mean-shift process
From MaRDI portal
Publication:2255170
DOI10.1007/s10463-013-0443-8zbMath1331.68267arXiv1305.1040OpenAlexW1996219915MaRDI QIDQ2255170
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)
Related Items (7)
Design of blurring mean-shift algorithms for data classification ⋮ On the strengths of the self-updating process clustering algorithm ⋮ A modified self-updating clustering algorithm for application to dengue gene expression data ⋮ On the weak convergence and central limit theorem of blurring and nonblurring processes with application to robust location estimation ⋮ Randomized self-updating process for clustering large-scale data ⋮ An intuitive clustering algorithm for spherical data with application to extrasolar planets ⋮ An automatic clustering algorithm for probability density functions
Cites Work
- Unnamed Item
- A note on the convergence of the mean shift
- Robust parameter estimation with a small bias against heavy contamination
- Dynamics of a mean-shift-like algorithm and its applications on clustering
- \(\gamma\)-SUP: a clustering algorithm for cryo-electron microscopy images of asymmetric particles
- Mean shift-based clustering
- The estimation of the gradient of a density function, with applications in pattern recognition
This page was built for publication: On the convergence and consistency of the blurring mean-shift process