Abstract
Cryo-electron microscopy nowadays often requires the analysis of hundreds of thousands of 2-D images as large as a few hundred pixels in each direction. Here, we introduce an algorithm that efficiently and accurately performs principal component analysis (PCA) for a large set of 2-D images, and, for each image, the set of its uniform rotations in the plane and their reflections. For a dataset consisting of n images of size L \times L pixels, the computational complexity of our algorithm is O(nL3 + L4), while existing algorithms take O(nL4). The new algorithm computes the expansion coefficients of the images in a Fourier-Bessel basis efficiently using the nonuniform fast Fourier transform. We compare the accuracy and efficiency of the new algorithm with traditional PCA and existing algorithms for steerable PCA.
| Original language | English (US) |
|---|---|
| Article number | 7384472 |
| Pages (from-to) | 1-12 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Computational Imaging |
| Volume | 2 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 2016 |
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Signal Processing
- Computer Science Applications
Keywords
- Steerable PCA
- denoising
- group invariance
- non-uniform FFT
Fingerprint
Dive into the research topics of 'Fast Steerable Principal Component Analysis'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver