@conference {57,
	title = {How far can you get with a modern face recognition test set using only simple features?},
	booktitle = {IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPR Workshops)},
	year = {2009},
	month = {06/2009},
	publisher = {IEEE},
	organization = {IEEE},
	address = {Miami, FL},
	abstract = {<p>In recent years, large databases of natural images have become increasingly popular in the evaluation of face and object recognition algorithms. However, Pinto et al. previously illustrated an inherent danger in using such sets, showing that an extremely basic recognition system, built on a trivial feature set, was able to take advantage of low-level regularities in popular object and face recognition sets, performing on par with many state-of-the-art systems. Recently, several groups have raised the performance \&ldquo;bar\&rdquo; for these sets, using more advanced classification tools. However, it is difficult to know whether these improvements are due to progress towards solving the core computational problem, or are due to further improvements in the exploitation of low-level regularities. Here, we show that even modest optimization of the simple model introduced by Pinto et al. using modern multiple kernel learning (MKL) techniques once again yields \&ldquo;state-of-the-art\&rdquo; performance levels on a standard face recognition set (\&ldquo;labeled faces in the wild\&rdquo;). However, at the same time, even with the inclusion of MKL techniques, systems based on these simple features still fail on a synthetic face recognition test that includes more \&ldquo;realistic\&rdquo; view variation by design. These results underscore the importance of building test sets focussed on capturing the central computational challenges of real-world face recognition.</p>
},
	isbn = {978-1-4244-3992-8},
	doi = {10.1109/CVPR.2009.5206605},
	url = {https://ieeexplore.ieee.org/document/5206605},
	author = {Pinto, Nicolas and DiCarlo, James J. and Cox, David D.}
}
