Name
Abstract | ||
|---|---|---|
We present a method allowing a significant speed-up of the eigen-detection method (detection based on principle component analysis). We derive a formula for an upper bound on the class-conditional probability (or equivalently a lower bound on the Mahalanobis distance) on which detection is based. Often, the lower bound of Mahalanobis distance (MD) reaches a preset threshold after computation of only a few eigen-projections. In this case the computation of MD can be immediately terminated. Regardless of the precise value of MD, the detection hypothesis (object from class Ω is detected) can be rejected. While provably obtaining results identical to the standard technique, we achieved a two- to three-fold speed-up in face detection experiments on images from the CMU database |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/ICPR.1998.711257 | Pattern Recognition, 1998. Proceedings. Fourteenth International Conference |
Keywords | DocType | Volume |
eigenvalues and eigenfunctions,face recognition,object recognition,principal component analysis,probability,Mahalanobis distance,eigen-detection,eigenspace projections,face detection,object-detection,principle component analysis,probability,upper bound | Conference | 1 |
ISSN | ISBN | Citations |
1051-4651 | 0-8186-8512-3 | 1 |
PageRank | References | Authors |
0.35 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Reiter | 1 | 1 | 0.35 |
| Jiri Matas | 2 | 335 | 35.85 |