Mean shift-based clustering
From MaRDI portal
Publication:2643890
DOI10.1016/j.patcog.2007.02.006zbMath1118.68645OpenAlexW1981049948MaRDI QIDQ2643890
Publication date: 27 August 2007
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2007.02.006
noiseparameter estimationbandwidth selectionmean shiftkernel functionsrobust clusteringmountain methodgeneralized Epanechnikov kernel
Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)
Related Items
A ROBUST FUZZY CLASSIFICATION MAXIMUM LIKELIHOOD CLUSTERING FRAMEWORK, A mean-shift algorithm for large-scale planar maximal covering location problems, Gaussian-kernel \(c\)-means clustering algorithms, A class boundary preserving algorithm for data condensation, Growing regression tree forests by classification for continuous object pose estimation, Polynomial-chaos-based conditional statistics for probabilistic learning with heterogeneous data applied to atomic collisions of helium on graphite substrate, A robust EM clustering algorithm for Gaussian mixture models, Self-updating clustering algorithm for estimating the parameters in mixtures of von Mises distributions, Sample-weighted clustering methods, Clustering construction on a multimodal probability model, On the convergence and consistency of the blurring mean-shift process
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alternative c-means clustering algorithms
- Unsupervised texture segmentation with one-step mean shift and boundary Markov random fields
- The estimation of the gradient of a density function, with applications in pattern recognition
- A deterministic annealing approach to clustering
- Robust Statistics
- Cluster Validity with Fuzzy Sets