Wavelet Frame Accelerated Reduced Support Vector Machines

In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achieved by an over-complete wavelet transform that finds the optimal approximation of the support vectors. The presented derivation shows that the wavelet theory provides an upper bound on the distance between the decision function of the support vector machine and our classifier. The obtained classifier is fast, since a Haar wavelet approximation of the support vectors is used, enabling efficient integral image-based kernel evaluations. This provides a set of cascaded classifiers of increasing complexity for an early rejection of vectors easy to discriminate. This excellent runtime performance is achieved by using a hierarchical evaluation over the number of incorporated and additional over the approximation accuracy of the reduced set vectors. Here, this algorithm is applied to the problem of face detection, but...

• Type: Journal
• Year: 2008
• Where: TIP
• Authors: Matthias Rätsch, Gerd Teschke, Sami Romdhani, Thomas Vetter
• Keywords: Support Vector, Support Vector Machine, TIP 2008, Vector Machine Classifier