Fast eigenspace decomposition of correlated images
Related Experiment Video
Updated: Jul 7, 2026

Confocal Microscopy Reveals Cell Surface Receptor Aggregation Through Image Correlation Spectroscopy
Published on: August 2, 2018
C Y Chang1, A A Maciejewski, V Balakrishnan
1Semicond.. Technol. and Instrum. Inc., Plano, TX 75074, USA.
Abstract:
We present a computationally efficient algorithm for the eigenspace decomposition of correlated images. Our approach is motivated by the fact that for a planar rotation of a two-dimensional (2-D) image, analytical expressions can be given for the eigendecomposition, based on the theory of circulant matrices. These analytical expressions turn out to be good first approximations of the eigendecomposition, even for three-dimensional (3-D) objects rotated about a single axis. In addition, the theory of circulant matrices yields good approximations to the eigendecomposition for images that result when objects are translated and scaled. We use these observations to automatically determine the dimension of the subspace required to represent an image with a guaranteed user-specified accuracy, as well as to quickly compute a basis for the subspace. Examples show that the algorithm performs very well on a number of test cases ranging from images of 3-D objects rotated about a single axis to arbitrary video sequences.
Related Concept Videos
Vector Algebra: Method of Components
In many applications, the magnitudes and directions of...
Divergence Theorem in 3D Space
Deconvolution
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...
Extraction: Partition and Distribution Coefficients
For extracting a solute from an aqueous phase into an organic...
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Dot Product of Two Vectors
