Face detection by optimal atomic decomposition

Atomic decompositions are lower-cost alternatives to the principal component analysis (PCA) in tasks where sparse signal representation is required. In pattern classifications tasks, e.g. face detection, a careful selection of atoms is needed in order to ensure an optimal and fast-operating decomposition to be used in the feature extraction stage. In this contribution, adaptive boosting is used as criterion for selecting optimal atoms as features in frontal face detection system. The goal is to speed up the learning process by a proper combination of a dictionary of atoms and a weak learner. Dictionaries of anisotropic wavelet packets are used where the total number of atoms is still feasible for large-size images. In the adaptive boosting algorithm a Bayesian classifier is used as a weak learner instead of a simple threshold, thus ensuring a higher accuracy for slightly increased computational cost during the detection stage. The experimental results obtained for four different dictionaries are quite promising based on the good localization properties of the anisotropic wavelet packet functions.

[1]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[2]  Nicholas N. Bennett Fast Algorithm for Best Anisotropic Walsh Bases and Relatives , 2000 .

[3]  Tomaso A. Poggio,et al.  Example-Based Learning for View-Based Human Face Detection , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Paul A. Viola,et al.  Robust Real-Time Face Detection , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[5]  Narendra Ahuja,et al.  Detecting Faces in Images: A Survey , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[7]  Federico Girosi,et al.  Training support vector machines: an application to face detection , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[8]  Truong Q. Nguyen,et al.  Two subspace methods to discriminate faces and clutters , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[9]  Alex Pentland,et al.  Probabilistic Visual Learning for Object Representation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Bhaskar D. Rao,et al.  Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..

[11]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.

[12]  Ferdinando Silvestro Samaria,et al.  Face recognition using Hidden Markov Models , 1995 .

[13]  S. Mallat A wavelet tour of signal processing , 1998 .

[14]  Takeo Kanade,et al.  Neural Network-Based Face Detection , 1998, IEEE Trans. Pattern Anal. Mach. Intell..