Candid Covariance-Free Incremental Principal Component Analysis

Appearance-based image analysis techniques require fast computation of principal components of high-dimensional image vectors. We introduce a fast incremental principal component analysis (IPCA) algorithm, called candid covariance-free IPCA (CCIPCA), used to compute the principal components of a sequence of samples incrementally without estimating the covariance matrix (so covariance-free). The new method is motivated by the concept of statistical efficiency (the estimate has the smallest variance given the observed data). To do this, it keeps the scale of observations and computes the mean of observations incrementally, which is an efficient estimate for some well known distributions (e.g., Gaussian), although the highest possible efficiency is not guaranteed in our case because of unknown sample distribution. The method is for real-time applications and, thus, it does not allow iterations. It converges very fast for high-dimensional image vectors. Some links between IPCA and the development of the cerebral cortex are also discussed.

[1]  W. H. Williams,et al.  Probability Theory and Mathematical Statistics , 1964 .

[2]  Norman L. Owsley,et al.  Adaptive data orthogonalization , 1978, ICASSP.

[3]  Erkki Oja,et al.  Subspace methods of pattern recognition , 1983 .

[4]  Gene H. Golub,et al.  Matrix computations , 1983 .

[5]  E. Oja,et al.  On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix , 1985 .

[6]  M. Simaan,et al.  IN ThE PRESENCE OF WHITE NOISE , 1985 .

[7]  M. Alexander,et al.  Principles of Neural Science , 1981 .

[8]  L Sirovich,et al.  Low-dimensional procedure for the characterization of human faces. , 1987, Journal of the Optical Society of America. A, Optics and image science.

[9]  Terence D. Sanger,et al.  Optimal unsupervised learning in a single-layer linear feedforward neural network , 1989, Neural Networks.

[10]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[11]  M. Turk,et al.  Eigenfaces for Recognition , 1991, Journal of Cognitive Neuroscience.

[12]  Thomas S. Huang,et al.  Motion and Structure from Image Sequences , 1992 .

[13]  Hyeonjoon Moon,et al.  The FERET evaluation methodology for face-recognition algorithms , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  James S. Harris,et al.  Probability theory and mathematical statistics , 1998 .

[15]  Juyang Weng,et al.  State-based SHOSLIF for indoor visual navigation , 2000, IEEE Trans. Neural Networks Learn. Syst..

[16]  Erwin Kreyszig,et al.  Advanced Engineering Mathematics, Maple Computer Guide , 2000 .

[17]  Juyang Weng,et al.  Developmental Humanoids: Humanoids that Develop Skills Automatically , 2000 .

[18]  Yuntao Cui,et al.  Appearance-Based Hand Sign Recognition from Intensity Image Sequences , 2000, Comput. Vis. Image Underst..

[19]  J. Weng,et al.  Convergence Analysis of Complementary Candid Incremental Principal Component Analysis ∗ , 2001 .

[20]  William H. Press,et al.  Numerical recipes in C , 2002 .

[21]  J. Rubner,et al.  Development of feature detectors by self-organization , 2004, Biological Cybernetics.

[22]  Hiroshi Murase,et al.  Visual learning and recognition of 3-d objects from appearance , 2005, International Journal of Computer Vision.