Face Detection --- Efficient and Rank Deficient

This paper proposes a method for computing fast approximations to support vectordecision 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 inputspace 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 largeimages, 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 setsystems.