A fast dynamic Gaussian mean-shift algorithm based on adaptive bandwidth

MaRDI QIDQ3403299zbMATH OpenFDO

Authors Fangfang Zhou, Xiaoping Fan, Zhen Ye

Publication date 12 February 2010

zbMATH Keywords

kernel density estimationGaussian kernelmean shiftadaptive bandwidth

Mathematics Subject Classification ID

Density estimation (62G07) Randomized algorithms (68W20)

Recommendations

• An algorithm of adaptive kernel-bandwidth for mean-shift based on boundary force
• Mean shift-based clustering
• KDE paring and a faster mean shift algorithm
• Mean shift research and applications
• Improvement of adaptive move length of mean shift algorithm

Cited in

(5)

• Mean shift-based clustering
• Computer Vision - ECCV 2004
• An algorithm of adaptive kernel-bandwidth for mean-shift based on boundary force
• KDE paring and a faster mean shift algorithm
• Bayesian interpretation to generalize adaptive mean shift algorithm

This page was built for publication: A fast dynamic Gaussian mean-shift algorithm based on adaptive bandwidth

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