Eigendecomposition of images correlated on S1, S2, and SO(3) using spectral theory

  • Authors:

  • Randy C. Hoover;Anthony A. Maciejewski;Rodney G. Roberts

  • Affiliations:

  • Department of Mathematics and Computer Science, South Dakota School of Mines and Technology, Rapid City, SD;Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO;Department of Electrical and Computer Engineering, Florida A & M, Florida State University, Tallahassee, FL

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Eigendecomposition represents one computationally efficient approach for dealing with object detection and pose estimation, as well as other vision-based problems, and has been applied to sets of correlated images for this purpose. The major drawback in using eigendecomposition is the off line computational expense incurred by computing the desired subspace. This off line expense increases drastically as the number of correlated images becomes large (which is the case when doing fully general 3-D pose estimation). Previous work has shown that for data correlated on S1, Fourier analysis can help reduce the computational burden of this off line expense. This paper presents a method for extending this technique to data correlated on S2 as well as SO(3) by sampling the sphere appropriately. An algorithm is then developed for reducing the off line computational burden associated with computing the eigenspace by exploiting the spectral information of this spherical data set using spherical harmonics and Wigner-D functions. Experimental results are presented to compare the proposed algorithm to the true eigendecomposition, as well as assess the computational savings.