Fast approximate factor analysis

Mladen Victor Wickerhauser

doi:10.1117/12.135163

1 February 1992 Fast approximate factor analysis

Mladen Victor Wickerhauser

Proceedings Volume 1610, Curves and Surfaces in Computer Vision and Graphics II; (1992) https://doi.org/10.1117/12.135163
Event: Robotics '91, 1991, Boston, MA, United States

Abstract

The principal orthogonal factor analysis or Karhunen-Loeve algorithm may be sped up by a low-complexity preprocessing step. A fast transform is selected from a large library of wavelet-like orthonormal bases, so as to maximize transform coding gain for an ensemble of vectors. Only the top few coefficients in the new basis, in order of variance across the ensemble, are then decorrelated by diagonalizing the autocovariance matrix. The method has computational complexity O(d2 log d + d'3) and O(d log d + d'2) respectively for training and classifying a d-dimensional system, where d' << d. One application is described, the reduction of an ensemble of 16,384 pixel face images to a 10 parameter space using a desktop computer, retaining 90% of the variance of the ensemble.

Citation Download Citation

Mladen Victor Wickerhauser "Fast approximate factor analysis", Proc. SPIE 1610, Curves and Surfaces in Computer Vision and Graphics II, (1 February 1992); https://doi.org/10.1117/12.135163

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available