Face Detection: Efficient and Rank Deficient

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 an entire image, this decreases the computational complexity of a scan by a significant amount. We present experimental results on a standard face detection database.

In  Advances in Neural Information Processing Systems 17

Publisher  MIT Press

Details

TypeInproceedings
URLhttp://www.is.tuebingen.mpg.de/fileadmin/user_upload/files/publications/pdf2776.pdf
Pages673-680
ISBN0-262-19534-8
OrganizationMax-Planck-Gesellschaft
AddressCambridge, MA, USA
> Publications > Face Detection: Efficient and Rank Deficient