Mean-shift analysis using quasi-newton methods

IEEE International Conference on Image Processing

Volumn 2, Issue , 2003, Pages 447-450

  Yang, Changjiang ^a   Duraiswami, Ramani ^a   DeMenthon, Daniel ^a   Davis, Larry ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MEAN-SHIFT ANALYSIS; QUASI-NEWTON METHODS;

ALGORITHMS; BANDWIDTH; COMPUTATIONAL METHODS; IMAGE SEGMENTATION; MATRIX ALGEBRA; PROBABILITY DENSITY FUNCTION;

FEATURE EXTRACTION;

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

References (17)

1. K. Fukunaga and L. D. Hostetler, "The estimation of the gradient of a density function, with applications in pattern recognition," IEEE Trans. Information Theory, vol. 21, pp. 32-40, 1975.
2. Y. Cheng, "Mean shift, mode seeking, and clustering," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 790-799, August 1995.
3. D. Comaniciu and P. Meer, "Mean shift analysis and applications," in Proc. Int'l Conf. Computer Vision, 1999, pp. 1197-1203.
4. D. Comaniciu and P. Meer, "Mean shift: A robust approach toward feature space analysis," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 603-619, May 2002.
5. D. DeMenthon, "Spatio-temporal segmentation of video by hierarchical mean shift analysis," in Statistical Methods in Video Processing Workshop, Copenhagen, Denmark, 2002.
6. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification, John Wiley & Sons, New York, 2000.
7. S. G. Nash and A. Sofer, Linear and Nonlinear Programming, McGraw-Hill, New York, 1996.
8. P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization, Academic Press, San Diego, 1981.
9. D.W. Scott, Multivariate Density Estimation: Theory, Practical, and Visualization, Wiley, New York, 1992.
10. M. P. Wand and M. C. Jones, Kernel Smoothing, Chapman & Hall, London, 1995.
11. J. Nocedal, "Theory of algorithms for unconstrained optimization," Acta Numerica, vol. 1, pp. 199-242, 1992.
12. J. Nocedal and S. Wright, Numerical Optimization, Springer Verlag, 1999.
13. M.J.D. Powell, "Some global convergence properties of a variable metric algorithm for minimization without exact line searches," in Nonlinear Programming, R.W. Cottle and C.E. Lemke, Eds., pp. 53-72. AMS, Providence, RI, 1976.
14. P. Gill and W. Murray, "Quasi-newton methods for unconstrained optimization," J. Inst. Maths. Applies., vol. 9, pp. 91-108, 1972.
15. D. Liu and J. Nocedal, "On the limited memory BFGS method for large scale optimization," Math. Programming, vol. 45, pp. 503-528, 1989.
16. A. Elgammal, R. Duraiswami, and L. Davis, "Efficient non-parametric adaptive color modeling using fast gauss transform," in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Kauai, Hawaii, 2001.
17. M. Bern and D. Eppstein, "Approximation algorithms for geometric problems," in Approximation Algorithms for NP-Hard Problems, D. Hochbaum, Ed. PWS Publishing Company, Boston, 1997.