2011
DOI: 10.1109/tip.2011.2147323
|View full text |Cite
|
Sign up to set email alerts
|

Computing Steerable Principal Components of a Large Set of Images and Their Rotations

Abstract: We present here an efficient algorithm to compute the Principal Component Analysis (PCA) of a large image set consisting of images and, for each image, the set of its uniform rotations in the plane. We do this by pointing out the block circulant structure of the covariance matrix and utilizing that structure to compute its eigenvectors. We also demonstrate the advantages of this algorithm over similar ones with numerical experiments. Although it is useful in many settings, we illustrate the specific applicatio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 17 publications
(18 citation statements)
references
References 22 publications
0
18
0
Order By: Relevance
“…There are quite a few papers that deal with the problem of fast and accurate rotational alignment of images; see, e.g., [22, 14, 6]. In the experiments reported here we rotationally align the images using a method that we recently developed that uses a steerable basis of eigenimages [21, 32]. Using this method, we computed the (40,0002) rotational alignments in about 30 minutes using all eight cores (here the computation ran in parallel).…”
Section: Numerical Experimentsmentioning
confidence: 99%
“…There are quite a few papers that deal with the problem of fast and accurate rotational alignment of images; see, e.g., [22, 14, 6]. In the experiments reported here we rotationally align the images using a method that we recently developed that uses a steerable basis of eigenimages [21, 32]. Using this method, we computed the (40,0002) rotational alignments in about 30 minutes using all eight cores (here the computation ran in parallel).…”
Section: Numerical Experimentsmentioning
confidence: 99%
“…From (11) and (23), the computational complexity of the last step is essentially O(L 3 ), which thus governs the computational complexity of the entire procedure described in this section. We end this discussion with the observation that the complexity of evaluating (27) can be further reduced by exploiting the rapid decay of the functions R c N,n (r) with the radius r (see Figure 1b for an illustration), due to which a substantial number of the terms involving R c N,n (r ℓ ω ) can be discarded for certain sets of the radii r ℓ ω and indices {(N, n)}. To exemplify this point, for T = 1, L = 150 and c = πL, we have that about 30% of the values R c N,n (r ℓ ω ) are below 10 −12 , and therefore can be safely discarded from (27).…”
Section: Fast Pswfs Coefficients Approximationmentioning
confidence: 99%
“…The idea of approximating a single template in a steerable basis has been studied independently by Perona [1,2] and Hel-Or & Teo [8], using continuous-domain formalisms; others have favored purely discrete formulations [3,9]. Note that [9] covers the case of multiple templates, but only in combination with a discrete set of rotations.…”
Section: Existing Work and Contributions Of This Papermentioning
confidence: 99%
“…Note that [9] covers the case of multiple templates, but only in combination with a discrete set of rotations. Here we consider a completely isotropic formulation in the continuous domain.…”
Section: Existing Work and Contributions Of This Papermentioning
confidence: 99%
See 1 more Smart Citation