KDE paring and a faster mean shift algorithm
From MaRDI portal
Recommendations
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
- Fast 3D mean shift filter for CT images
- A fast kernel density estimator based image thresholding algorithm for small target images
- Image and video segmentation by anisotropic kernel mean shift
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)