Face detection with information-based maximum discrimination
- 22 November 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Antonio J. Colmenarez and Thomas S. Huang In this paper we present a visual learning technique that maximizes the discrimination between positive and negative examples in a training set. We demonstrate our technique in the context of face detection with complex background without color or motion information, which has proven to be a challenging problem. We use a family of discrete Markov processes to model the face and background patterns and estimate the probability models using the data statistics. Then, we convert the learning process into an optimization, selecting the Markov process that optimizes the information-based discrimination between the two classes. The detection process is carried out by computing the likelihood ratio using the probability model obtained from the learning procedure. We show that because of the discrete nature of these models, the detection process is, by almost two orders of magnitude, less computationally expensive than neural network approaches. However, no improvement in terms of correct-answer/false-alarm tradeoff is achieved.Keywords
This publication has 8 references indexed in Scilit:
- Maximum likelihood face detectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Neural network-based face detectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- Example Based Learning for View-Based Human Face Detection.Published by Defense Technical Information Center (DTIC) ,1994
- Human face detection in a complex backgroundPattern Recognition, 1994
- MULTI-MODULAR NEURAL NETWORK ARCHITECTURES: APPLICATIONS IN OPTICAL CHARACTER AND HUMAN FACE RECOGNITIONInternational Journal of Pattern Recognition and Artificial Intelligence, 1993
- Neural Network Classifiers Estimate Bayesian a posteriori ProbabilitiesNeural Computation, 1991
- Entropy and Information TheoryPublished by Springer Science and Business Media LLC ,1990
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman ProblemProceedings of the American Mathematical Society, 1956