On some convergence properties of the subspace constrained mean shift
From MaRDI portal
Publication:898066
DOI10.1016/j.patcog.2013.04.014zbMath1326.68216OpenAlexW2075852426MaRDI QIDQ898066
Youness Aliyari Ghassabeh, Tamás Linder, Glen K. Takahara
Publication date: 8 December 2015
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2013.04.014
convergenceunsupervised learningdimensionality reductionprincipal curvesprincipal surfacessubspace constrained mean shift
Related Items (max. 100)
Entropies from Markov models as complexity measures of embedded attractors ⋮ Analyzing animal escape data with circular nonparametric multimodal regression ⋮ The mean shift algorithm and its relation to kernel regression ⋮ A sufficient condition for the convergence of the mean shift algorithm with Gaussian kernel ⋮ Unnamed Item ⋮ Modified subspace constrained mean shift algorithm ⋮ Smoothing three-dimensional manifold data, with application to tectonic fault detection ⋮ Unnamed Item ⋮ Asymptotic stability of equilibrium points of mean shift algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the convergence of the mean shift
- On the convergence properties of the EM algorithm
- Ridges in image and data analysis
- The estimation of the gradient of a density function, with applications in pattern recognition
- Principal curves with bounded turn
- Principal Curves
- Nonlinear Dimensionality Reduction
- Computer Vision - ECCV 2004
- Another look at principal curves and surfaces
This page was built for publication: On some convergence properties of the subspace constrained mean shift