Fast mean shift with accurate and stable convergence

Journal of Machine Learning Research

Volumn 2, Issue , 2007, Pages 604-611

  Wang, Ping ^a   Lee, Dongryeol ^a   Gray, Alexander ^a   Rehg, James M ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA POINTS; DUAL-TREE; FAST ALGORITHMS; FAST MEAN SHIFT; LOCAL MEAN; MEAN SHIFT; NON-PARAMETRIC; RELATIVE ERRORS; STABLE CONVERGENCE; SYNTHETIC DATA;

SOFTWARE ENGINEERING;

ARTIFICIAL INTELLIGENCE;

EID: 78651528447     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (18)

1. Appel, A. W. (1985). An efficient program for many-body simulations. SIAM J. Sci. Stat. Comput., 6, 85-103.
2. Barnes, J., & Hut, P. (1986). A hierarchical o(n log n) force-calculation algorithm. Nature 324, 446-449.
3. Callahan, P., & Kosaraju, S. (1995). A decomposition of multidimensional point sets with applications to k-nearestneighbors and n-body potential fields. J. of the ACM, 62, 67-90.
4. Chavez, E., Navarro, G., Baeza-Yates, R., & Marroqun, J. L. (2001). Proximity searching in metric spaces. ACM Computing Surveys, 33, 273-321.
5. Cheng, Y. (1995). Mean shift, mode seeking, and clustering. IEEE Trans. Pattern Anal. Mach. Intel., 17, 790-799.
6. Collins, R. (2003). Mean-shift blob tracking through scale space. Conf. on Computer Vision and Pattern Rec. (pp. 234-240).
7. Comaniciu, D., & Meer, P. (2002). Mean shift: A robust approach toward feature space analysis. IEEE Trans. Pattern Anal. Mach. Intel., 24, 603-619.
8. Comaniciu, D., Ramesh, V., & Meer, P. (2000). Real-time tracking of non-rigid objects using mean shift. Conf. on Computer Vision and Pattern Rec. (pp. 142 149).
9. Fashing, M., & Tomasi, C. (2005). Mean shift is a bound optimization. IEEE Trans. Pattern Anal. Mach. Intel., 27, 471-474.
10. Freidman, J. H., Bentley, J. L., & Finkel, R. A. (1977). An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw., 3, 209-226.
11. Fukunaga, K., & Hostetler, L. D. (1975). The estimation of the gradient of a density function, with applications in pattern recognition. IEEE Trans. on Information Theory, 21, 32-40.
12. Georgescu, B., Shimshoni, I., & Meer, P. (2003). Mean shift based clustering in high dimensions: A texture classification example. Intl. Conf. on Computer Vision (pp. 456-463).
13. Gionis, A., Indyk, P., & Motwani, R. (1999). Similarity search in high dimensions via hashing. VLDB (pp. 518-529).
14. Gray, A., & Moore, A. (2001). N-body problems in statistical learning. NIPS (pp. 521-527).
15. Greengard, L., & Rokhlin, V. (1987). A fast algorithm for particle simulations. J. of Comp. Physics, 73, 325-348.
16. Lee, D., & Gray, A. (2006). Faster gaussian summation: Theory and empirical experiments. UAI.
17. Scott, D. W. (1992). Multivariate density estimation: Theory, practice, and visualization. Wiley.
18. Yang, C., Duraiswami, R., Gumerov, N. A., & Davis, L. (2003). Improved fast gauss transform and efficient kernel density estimation. Intl. Conf. on Computer Vision (pp. 464-471).