nips nips2004 nips2004-68 nips2004-68-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Wolf Kienzle, Matthias O. Franz, Bernhard Schölkopf, Gökhan H. Bakir
Abstract: This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an existing algorithm where the set of support vectors is replaced by a smaller, so-called reduced set of synthesized input space points. In contrast to the existing method that finds the reduced set via unconstrained optimization, we impose a structural constraint on the synthetic points such that the resulting approximations can be evaluated via separable filters. For applications that require scanning large images, this decreases the computational complexity by a significant amount. Experimental results show that in face detection, rank deficient approximations are 4 to 6 times faster than unconstrained reduced set systems. 1
[1] E. Osuna and F. Girosi. Reducing the run-time complexity in support vector machines. In B. Sch¨ lkopf, C. J. C. Burges, and A. J. Smola, editors, Advances in Kernel Methods — Support o Vector Learning, pages 271–284, Cambridge, MA, 1999. MIT Press.
[2] C. J. C. Burges. Simplified support vector decision rules. In International Conference on Machine Learning, pages 71–77, 1996. ¨
[3] C. J. C. Burges and B. Scholkopf. Improving the accuracy and speed of support vector machines. In M. C. Mozer, M. I. Jordan, and T. Petsche, editors, Advances in Neural Information Processing Systems, volume 9, page 375. MIT Press, 1997.
[4] E. Osuna, R. Freund, and F. Girosi. Training support vector machines: an application to face detection. In Proceedings IEEE Conference on Computer Vision and Pattern Recognition, 1997.
[5] S. Romdhani, P. Torr, B.Sch¨ lkopf, and A. Blake. Computationally efficient face detection. In o Proceedings of the International Conference on Computer Vision, pages 695–700, 2001.
[6] P. Viola and M. Jones. Rapid object detection using a boosted cascade of simple features. In Proceedings IEEE Conference on Computer Vision and Pattern Recognition, 2001.
[7] G. Blanchard and D. Geman. Hierarchical testing designs for pattern recognition. Technical Report 2003-07, Universit Paris-Sud, 2003.
[8] B. Heisele, T. Poggio, and M. Pontil. Face detection in still gray images. AI Memo 1687, MIT, May 2000. CBCL Memo 187.
[9] S. Ben-Yacoub, B. Fasel, and J. Luettin. Fast face detection using MLP and FFT. In Proceedings International Conference on Audio and Video-based Biometric Person Authentication, 1999.
[10] H. A. Rowley, S. Baluja, and T. Kanade. Neural network-based face detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(1):23–38, January 1998.
[11] A. Edelman, T. Arias, and S. Smith. The geometry of algorithms with orthogonality constraints. SIAM Journal on Matrix Analysis and Applications, 20:303–353, 1998.
[12] RDRSLIB – a matlab library for rank deficient reduced sets in object detection, http://www.kyb.mpg.de/bs/people/kienzle/rdrs/rdrs.htm.