The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2009 vol.31)
pp: 351-363
Bruce A. Draper , Colorado State University, Fort Collins
Jen-Mei Chang , Colorado State University, Fort Collins
J. Ross Beveridge , Colorado State University, Fort Collins
Holger Kley , Colorado State University, Fort Collins
Chris Peterson , Colorado State University, Fort Collins
ABSTRACT
The theory of illumination subspaces is well developed and has been tested extensively on the Yale Face Database B (YDB) and CMU-PIE (PIE) data sets. This paper shows that if face recognition under varying illumination is cast as a problem of matching sets of images to sets of images, then the minimal principal angle between subspaces is sufficient to perfectly separate matching pairs of image sets from nonmatching pairs of image sets sampled from YDB and PIE. This is true even for subspaces estimated from as few as six images and when one of the subspaces is estimated from as few as three images if the second subspace is estimated from a larger set (10 or more). This suggests that variation under illumination may be thought of as useful discriminating information rather than unwanted noise.
INDEX TERMS
Face recognition, illumination subspaces, principal angle, set--to--set classification.
CITATION
Bruce A. Draper, Jen-Mei Chang, J. Ross Beveridge, Holger Kley, Chris Peterson, "Principal Angles Separate Subject Illumination Spaces in YDB and CMU-PIE", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.31, no. 2, pp. 351-363, February 2009, doi:10.1109/TPAMI.2008.200
REFERENCES
[1] P. Belhumeur and D. Kriegman, “What Is the Set of Images of an Object under All Possible Illumination Conditions,” Int'l J. Computer Vision, vol. 28, no. 3, pp. 245-260, July 1998.
[2] K.-C. Lee, J. Ho, and D. Kriegman, “Acquiring Linear Subspaces for Face Recognition under Variable Lighting,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 5, pp. 684-698, May 2005.
[3] A. Georghiades, D. Kriegman, and P. Belhumeur, “Illumination Cones for Recognition under Variable Lighting: Faces,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 52-58, 1998.
[4] R. Basri and D. Jacobs, “Lambertian Reflectance and Linear Subspaces,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 2, pp. 218-233, Feb. 2003.
[5] A. Georghiades, P. Belhumeur, and D. Kriegman, “From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 6, pp. 643-660, June 2001.
[6] T. Sim, S. Baker, and M. Bsat, “The CMU Pose, Illumination, and Expression Database,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 12, pp. 1615-1618, Dec. 2003.
[7] T. Riklin-Raviv and A. Shashua, “The Quotient Image: Class Based Re-Rendering and Recognition with Varying Illuminations,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 2, pp. 129-139, Feb. 2001.
[8] R. Gross, I. Matthews, and S. Baker, “Appearance-Based Face Recognition and Light-Fields,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 4, pp. 449-465, Apr. 2004.
[9] J.-M. Chang, J. Beveridge, B. Draper, M. Kirby, H. Kley, and C. Peterson, “Illumination Face Spaces are Idiosyncratic,” Proc. Int'l Conf. Image Processing and Computer Vision, vol. 2, pp. 390-396, June 2006.
[10] Y. Weiss, “Deriving Intrinsic Images from Image Sequences,” Proc. Eighth Int'l Conf. Computer Vision, vol. 2, pp. 68-75, July 2001.
[11] G. Finlayson, M. Drew, and C. Lu, “Intrinsic Images by Entropy Minimization,” Proc. Eighth European Conf. Computer Vision, pp. 582-595, May 2004.
[12] J. Ho, M.-H. Yang, J. Lim, K.-C. Lee, and D. Kriegman, “Clustering Appearances of Objects under Varying Illumination Conditions,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 11-18, June 2003.
[13] X. Lui, A. Srivastava, and K. Gallivan, “Optimal Linear Representations of Images for Object Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, pp. 662-666, 2004.
[14] O. Yamaguchi, K. Fukui, and K. Maeda, “Face Recognition Using Temporal Image Sequence,” Proc. Third Int'l Conf. Automatic Face and Gesture Recognition, pp. 318-323, 1998.
[15] K. Fukui and O. Yamaguchi, “Face Recognition Using Multi-Viewpoint Patterns for Robot Vision,” Proc. 11th Int'l Symp. Robotics Research, pp. 192-201, 2003.
[16] M. Nishiyama, O. Yamaguchi, and K. Fukui, “Face Recognition with the Multiple Constrained Mutual Subspace Method,” Proc. Fifth Int'l Conf. Audio- and Video-Based Biometric Person Authentication, pp. 71-80, 2005.
[17] Q.-S. Sun, Z.-D. Liu, P.-A. Heng, and D.-S. Xia, “A Theorem on the Generalized Canonical Projective Vectors,” Pattern Recognition, vol. 38, no. 3, pp. 449-452, Mar. 2005.
[18] Q.-S. Sun, P.-A. Heng, Z. Jin, and D.-S. Xia, “Face Recognition Based on Generalized Canonical Correlation Analysis,” Proc. Int'l Conf. Intelligent Computing, pp. 958-967, 2005.
[19] T.-K. Kim, J. Kittler, and R. Cipolla, “Discriminative Learning and Recognition of Image Set Classes Using Canonical Correlations,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 6, pp. 1005-1018, June 2007.
[20] L. Wolf and A. Shashua, “Learning over Sets Using Kernel Principal Angles,” J. Machine Learning Research, vol. 4, no. 10, pp. 913-931, 2003.
[21] T.-J. Chin, K. Schindler, and D. Suter, “Incremental Kernel SVD for Face Recognition with Image Sets,” Proc. Seventh Int'l Conf. Automatic Face and Gesture Recognition, pp. 461-466, Apr. 2006.
[22] T.-K. Kim, O. Arandjelović, and R. Cipolla, “Boosted Manifold Principal Angles for Image Set-Based Recognition,” Pattern Recognition, vol. 40, pp.2475-2484, 2007.
[23] Y. Freund and R.E. Schapire, “A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting,” Proc. Second European Conf. Computational Learning Theory, pp. 23-37, 1995.
[24] M. Nishiyama, M. Yuasa, T. Shibata, T. Wakasugi, T. Kawahara, and O. Yamaguchi, “Recognizing Faces of Moving People by Hierarchical Image-Set Matching,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp.1-8, 2007.
[25] G. Golub and C.V. Loan, Matrix Computations, third ed. Johns Hopkins Univ. Press, 1996.
[26] G. Stewart and J.-G. Sun, Matrix Perturbation Theory. Academic Press, 1990.
[27] A. Björck and G. Golub, “Numerical Methods for Computing Angles between Linear Subspaces,” Math. Computation, vol. 27, no. 123, pp. 579-594, 1973.
[28] A. Edelman, T. Arias, and S. Smith, “The Geometry of Algorithms with Orthogonality Constraints,” SIAM J. Matrix Analysis and Applications, vol. 20, no. 2, pp. 303-353, 1999.
[29] J.-M. Chang, “Classification on the Grassmannians: Theory and Applications,” PhD dissertation, Dept. of Math., Colorado State Univ., Apr. 2008.
[30] M. Kirby and L. Sirovich, “Application of the Karhunen-Loève Procedure for the Characterization of Human Faces,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 1, pp. 103-108, Jan. 1990.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool