We present a method to estimate recognition performance for large galleries of individuals using data from a significantly smaller gallery. This is achieved by mathematically modelling a cumulative match characteristic (CMC) curve. The similarity scores of the smaller gallery are used to estimate the parameters of the model. After the parameters are estimated, the rank 1 point of the modelled CMC curve is used as our measure of recognition performance. The rank 1 point (i.e.; nearest-neighbor) represents the probability of correctly identifying an individual from a gallery of a particular size; however, as gallery size increases, the rank 1 performance decays. Our model, without making any assumptions about the gallery distribution, replicates this effect, and allows us to estimate recognition performance as gallery size increases without needing to physically add more individuals to the gallery. This model is evaluated on face recognition techniques using a set of faces from the FERET database.
[1]
H Moon,et al.
Computational and Performance Aspects of PCA-Based Face-Recognition Algorithms
,
2001,
Perception.
[2]
P J. Phillips,et al.
Face Recognition Vendor Test 2000: Evaluation Report
,
2001
.
[3]
P. Phillips,et al.
1 FACE RECOGNITION VENDOR TEST 2002 : EVALUATION REPORT
,
2003
.
[4]
John Daugman,et al.
The importance of being random: statistical principles of iris recognition
,
2003,
Pattern Recognit..
[5]
Aaron F. Bobick,et al.
Predicting Large Population Data Cumulative Match Characteristic Performance from Small Population Data
,
2003,
AVBPA.
[6]
James L. Wayman,et al.
Error rate equations for the general biometric system
,
1999,
IEEE Robotics Autom. Mag..
[7]
W. J. DeCoursey,et al.
Introduction: Probability and Statistics
,
2003
.