Stochastic gradient kernel density mode-seeking

2009 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009

Volumn , Issue , 2009, Pages 1926-1931

  Yuan, Xiao Tong ^a   Li, Stan Z ^a  

^a State Key Laboratory of Multimodal Artificial Intelligence Systems   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; IMAGE SEGMENTATION; ITERATIVE METHODS;

APPROXIMATION PERFORMANCE; CLUSTERING ACCURACY; FIXED POINT ITERATION; KERNEL DENSITY; MEAN SHIFT ALGORITHM; MODE SEEKING; RUNNING TIME; STOCHASTIC GRADIENT;

STOCHASTIC SYSTEMS;

EID: 70450196517     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPRW.2009.5206790     Document Type: Conference Paper

References (17)

1. P. Bartlett, E. Hazan, and A. Rakhlin. Adaptive online gradient descent. In Annual Conference on Neural Information Processing Systems, 2007.
2. L. Bottou. Online algorithms and stochastic approximations. In D. Saad, editor, Online Learning and Neural Networks. Cambridge University Press, Cambridge, UK, 1998.
3. L. Bottou. Stochastic learning. In O. Bousquet and U. von Luxburg, editors, Advanced Lectures on Machine Learning, Lecture Notes in Artificial Intelligence, LNAI 3176, pages 146-168. Springer Verlag, Berlin, 2004.
4. L. Bottou and Y. L. Cun. On-line learning for very large data sets: Research articles. Applied Stochastic Models in Business and Industry, 21(2):137 - 151, March 2005.
5. M. Carreira-Perpinan. Fast nonparametric clustering with gaussian blurring mean-shift. In International Conference on Machine Learning, 2006.
6. M. Carreira-Perpinan. Gaussian mean-shift is an em algorithm. IEEE Transactions on Pattern Analysis and Macnine Intelligence, 29(5):767-776, 2007.
7. Y. Cheng. Mean shift, mode seeking, and clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(7):790-799, 1995.
8. D. Comaniciu and P. Meer. Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(5):603-619, May 2002.
9. D. Comaniciu, V. Ramesh, and P. Meer. Real-time tracking of non-rigid objets using mean shift. In Computer Vision and Pattern Recongition, IEEE International Conference on, volume 2, pages 142-149. IEEE, 2000.
10. M. Fashing and C. Tomasi. Mean shift is a bound optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27:471-474, Mar. 2005.
11. N. Murata and S. ichi Amari. Statistical analysis of learning dynamics. Signal Processing, 74(1):3-28, March 1999.
12. J. Nocedal and S. Wright. Numerical Optimization. Springer-Verlag, 1999.
13. E. Parzen. On estimation of a probability density function and mode. Annals of Mathematical Statistics, 33(3):1065- 1076, Mar. 1962.
14. C. Yang, R. Duraiswami, N. A. Gumerov, and L. Davis. Improved fast gauss transform and efficient kernel density estimation. In IEEE International Conference on Computer Vision, volume 1, pages 664-671. IEEE, 2003.
15. X. Yuan and S. Z. Li. Half quadratic analysis for mean shift: with extension to a sequential data mode-seeking method. In IEEE International Conference on Computer Vision, 2007.
16. X.-T. Yuan, B.-G. Hu, and R. He. Agglomerative mean-shift clustering via query set compression. In SIAM International Conference on Data Mining (SDM), 2009.
17. M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In International Conference on Machine Learning, pages 928-936, 2003.