Breckenridge, CO USA
Jan. 9, 2012 to Jan. 11, 2012
G. Aggarwal , Dept. of Comput. Sci. & Eng., Univ. of Notre Dame, Notre Dame, IN, USA
Several sources of variation in facial appearance that affect face matching performance have long been investigated. The recently introduced GBU challenge problem  indicates that there can be significant variation in performance across different partitions of the data, even when the impact of most known factors is eliminated or significantly reduced by the data collection and experimentation protocol. The GBU challenge problem consists of three partitions which are called the Good (easy to match), the Bad (average matching difficulty) and the Ugly (difficult to match). In this paper, we investigate various image and facial characteristics that can account for the observed significant difference in performance across these partitions. Given a match pair, we aim to predict the partition it belongs to. Partial Least Squares (PLS)-based regression is used to perform the prediction task. Our analysis indicates that the match pairs from the three partitions differ from each other in terms of simple but often ignored factors like image sharpness, hue, saturation and extent of facial expressions.
Face, Measurement, Vectors, Partitioning algorithms, Face recognition, Algorithm design and analysis, Image edge detection
G. Aggarwal, "Predicting good, bad and ugly match Pairs", WACV, 2012, Applications of Computer Vision, IEEE Workshop on, Applications of Computer Vision, IEEE Workshop on 2012, pp. 153-160, doi:10.1109/WACV.2012.6163007