Share Email Print
cover

Proceedings Paper

Fast approximate factor analysis
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 1 February 1992
PDF: 10 pages
Proc. SPIE 1610, Curves and Surfaces in Computer Vision and Graphics II, (1 February 1992); doi: 10.1117/12.135163
Show Author Affiliations
Mladen Victor Wickerhauser, Washington Univ. (United States)


Published in SPIE Proceedings Vol. 1610:
Curves and Surfaces in Computer Vision and Graphics II
Martine J. Silbermann; Hemant D. Tagare, Editor(s)

© SPIE. Terms of Use
Back to Top