4.7 Article

Bayesian face recognition

Journal

PATTERN RECOGNITION
Volume 33, Issue 11, Pages 1771-1782

Publisher

ELSEVIER SCI LTD
DOI: 10.1016/S0031-3203(99)00179-X

Keywords

Face Recognition; density estimation; Bayesian analysis; MAP/ML classification; principal component analysis; eigenfaces

Ask authors/readers for more resources

We propose a new technique for direct visual matching of images for the purposes of face recognition and image retrieval, using a probabilistic measure of similarity, based primarily on a Bayesian (MAP) analysis of image differences. The performance advantage of this probabilistic matching technique over standard Euclidean nearest-neighbor eigenface matching was demonstrated using results from DARPA's 1996 FERET face recognition competition, in which this Bayesian matching alogrithm was found to be the top performer. In addition, we derive a simple method of replacing costly computation of nonlinear (on-line) Bayesian similarity measures by inexpensive linear (off-line) subspace projections and simple Euclidean norms, thus resulting in a significant computational speed-up for implementation with very large databases. (C) 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available