Efficient Calculation of Primary Images from a Set of Images

Authors:
Hiroyasu Murakami;B. V. K. Vijaya Kumar
Affiliations:
Research and Development Section, Yanagicho Works, Toshiba Corporation, Kawasaki, Japan.;Department of Electrical Engineering, Carnegie-Mellon University, Pittsburgh, PA 15213.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1982

Citing 0
Cited 4

Weighted and robust learning of subspace representations

Pattern Recognition
Incremental and robust learning of subspace representations

Image and Vision Computing
Perturbation scheme for online learning of features: Incremental principal component analysis

Pattern Recognition
Two-tier based intrusion detection system

FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II

Quantified Score

Hi-index	0.14

Visualization

Abstract

A set of images is modeled as a stochastic process and Karhunen-Loeve expansion is applied to extract the feature images. Although the size of the correlation matrix for such a stochastic process is very large, we show the way to calculate the eigenvectors when the rank of the correlation matrix is not large. We also propose an iterative algorithm to calculate the eigenvectors which save computation time andc omputer storage requirements. This iterative algorithm gains its efficiency from the fact that only a significant set of eigenvectors are retained at any stage of iteration. Simulation results are also presented to verify these methods.