Fast nonparametric clustering with gaussian blurring mean-shift

ICML 2006 - Proceedings of the 23rd International Conference on Machine Learning

Volumn 2006, Issue , 2006, Pages 153-160

  Miguel, A ^a   Carreira Perpinan ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; DATA TRANSFER; IMAGE SEGMENTATION; ITERATIVE METHODS;

BLURRING STEPS; CLUSTERING STRUCTURE; GAUSSIAN BLURRING MEAN SHIFT (GBMS); SPECTRAL CLUSTERING;

DATABASE SYSTEMS;

EID: 33749364094     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Carreira-Perpiñán, M. Á. (2000). Mode-finding for mixtures of Gaussian distributions. IEEE Trans. PAMI, 22, 1318-1323.
2. Carreira-Perpiñán, M. A. (2005). Gaussian mean shift is an EM algorithm. Submitted.
3. Carreira-Perpiñán, M. Á. (2006). Acceleration strategies for Gaussian mean-shift image segmentation. CVPR'06, to appear.
4. Carreira-Perpiñán, M. Á., & Williams, C. K. I. (2003). On the number of modes of a Gaussian mixture. In L. Griffin and M. Lillholm (Eds.), Scale space methods in computer vision, LNCS vol. 2695, 625-640. Springer-Verlag.
5. Carreira-Perpiñán, M. Á., & Zemel, R. S. (2005). Proximity graphs for clustering and manifold learning. NIPS 2004 (pp. 225-232).
6. Cheng, Y. (1995). Mean shift, mode seeking, and clustering. IEEE Trans. PAMI, 17, 790-799.
7. Chung, F. R. K. (1997). Spectral graph theory. Providence, RI: American Mathematical Society.
8. Comaniciu, D., & Meer, P. (2002). Mean shift: A robust approach toward feature space analysis. IEEE Trans. PAMI, 24, 603-619.
9. Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1990). Introduction to algorithms. Cambridge, MA: MIT Press.
10. DeMenthon, D. (2002). Spatio-temporal segmentation of video by hierarchical mean shift analysis. Statistical Methods in Video Processing Workshop (SMVP 2002). Copenhagen, Denmark.
11. Elgammal, A., Duraiswami, R., & Davis, L. S. (2003). Efficient kernel density estimation using the fast Gauss transform with applications to color modeling and tracking. IEEE Trans. PAMI, 25, 1499-1504.
12. Fukunaga, K., & Hosteller, L. D. (1975). The estimation of the gradient of a density function, with application in pattern recognition. IEEE Trans. Inf. Theory, 21, 32-40.
13. Golub, G. H., & van Loan, C. F. (1996). Matrix computations. Baltimore: Johns Hopkins U. Press. Third edition.
14. Greengard, L., & Strain, J. (1991). The fast Gauss transform. SIAM J. Sci. Stat. Comput., 12, 79-94.
15. Horn, R. A., & Johnson, C. R. (1986). Matrix analysis. Cambridge, U.K.: Cambridge University Press.
16. Moore, A. W. (1999). Very fast EM-based mixture model clustering using multiresolution kd-trees. NIPS 1998 (pp. 543-549).
17. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Trans. PAMI, 22, 888-905.