Fast eigenspace decomposition of correlated images.

C Y Chang1, A A Maciejewski, V Balakrishnan

  • 1Semicond.. Technol. and Instrum. Inc., Plano, TX 75074, USA.

Summary

This study introduces an efficient algorithm for image eigenspace decomposition using circulant matrix theory. The method accurately approximates eigendecompositions for rotated, translated, and scaled images, enabling efficient subspace computation.

Related Concept Videos

Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
Divergence Theorem in 3D Space01:20

Divergence Theorem in 3D Space

In vector calculus, flux measures the total flow of a vector field through a surface. For a closed surface in three-dimensional space, this means measuring how much of the field passes outward through every point on the boundary. Directly calculating this flux can be difficult when the surface has a complicated or irregular shape. The Divergence Theorem provides a powerful alternative by relating surface flux to behavior inside the enclosed region.The Divergence Theorem states that the outward...
Deconvolution01:20

Deconvolution

Deconvolution, also known as inverse filtering, is the process of extracting the impulse response from known input and output signals. This technique is vital in scenarios where the system's characteristics are unknown, and they must be inferred from the observable signals.
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 Coefficients01:14

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Dot Product of Two Vectors01:27

Dot Product of Two Vectors

The dot product, or scalar product, is a fundamental operation in vector algebra that combines two vectors to yield a scalar quantity. It is particularly valuable in physical applications, such as calculating work, and in mathematical contexts, such as determining vector projections and direction cosines.For vectors a = ⟨a₁, a₂, a₃⟩ and b = ⟨b₁, b₂, b₃⟩, the dot product is defined as:\begin{equation*}\mathbf{a} \cdot \mathbf{b} = a_1b_1 + a_2b_2 + a_3b_3\end{equation*}This operation is...