KDE paring and a faster mean shift algorithm

DOI10.1137/090765158MaRDI QIDQ3052956zbMATH OpenOpenAlexFDO

Authors Pavel Kisilev, Daniel Z. Freedman

Publication date 3 November 2010

Published in SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/090765158

zbMATH Keywords

kernel density estimatemean shiftsamplingsegmentation

Mathematics Subject Classification ID

Density estimation (62G07) Image analysis in multivariate analysis (62H35) Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)

Recommendations

• Computer Vision - ECCV 2004
• Mean shift research and applications
• A fast dynamic Gaussian mean-shift algorithm based on adaptive bandwidth
• Mean shift-based clustering
• Clustering methods based on kernel density estimators: mean shift algorithms

Cited in

(7)

• FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation
• A fast kernel density estimation theorem and the scaling up graph based relaxed clustering method
• A fast dynamic Gaussian mean-shift algorithm based on adaptive bandwidth
• A BRANCH AND BOUND ALGORITHM FOR FINDING THE MODES IN KERNEL DENSITY ESTIMATES
• scientific article; zbMATH DE number 2044061 (Why is no real title available?)
• A fast kernel density estimator based image thresholding algorithm for small target images
• Computer Vision - ECCV 2004

This page was built for publication: KDE paring and a faster mean shift algorithm

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