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

zbMATH Open1199.68552MaRDI QIDQ3403299FDOQ3403299

Authors: Fangfang Zhou, Xiaoping Fan, Zhen Ye 

Publication date: 12 February 2010

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

zbMATH Keywords

kernel density estimationGaussian kernelmean shiftadaptive bandwidth

Mathematics Subject Classification ID

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

Cited In (4)

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

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)