A sufficient condition for the convergence of the mean shift algorithm with Gaussian kernel
From MaRDI portal
Publication:2256740
DOI10.1016/j.jmva.2014.11.009zbMath1308.62118OpenAlexW2068057588WikidataQ30054550 ScholiaQ30054550MaRDI QIDQ2256740
Publication date: 20 February 2015
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmva.2014.11.009
convergencekernel functionconvex hullmean shift algorithmGaussian KDEisolated stationary pointsmode estimate sequence
Related Items (10)
Modal clustering of matrix-variate data ⋮ Analyzing animal escape data with circular nonparametric multimodal regression ⋮ On the weak convergence and central limit theorem of blurring and nonblurring processes with application to robust location estimation ⋮ Robust Clustering Method in the Presence of Scattered Observations ⋮ The mean shift algorithm and its relation to kernel regression ⋮ Mixture model modal clustering ⋮ Modified subspace constrained mean shift algorithm ⋮ Unnamed Item ⋮ A class of nonparametric mode estimators ⋮ Space partitioning and regression maxima seeking via a mean-shift-inspired algorithm
Uses Software
Cites Work
- A note on the convergence of the mean shift
- On some convergence properties of the subspace constrained mean shift
- On the convergence properties of the EM algorithm
- The topography of multivariate normal mixtures
- Morse Theory. (AM-51)
- The estimation of the gradient of a density function, with applications in pattern recognition
- Computer Vision - ECCV 2004
- On Estimation of a Probability Density Function and Mode
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A sufficient condition for the convergence of the mean shift algorithm with Gaussian kernel
