Efficient image reconstruction using partial 2D Fourier transform

In this paper we present an efficient way of doing image reconstruction using the 2D Discrete Fourier transform (DFT). We exploit the fact that in the frequency domain, information is concentrated in certain regions. Consequently, it is sufficient to compute partial 2D Fourier transform where only m × m elements of an N × N image are nonzero. Compared with the traditional row-column (RC) decomposition algorithm, the proposed algorithm enables us to reconstruct images with significantly smaller computation complexity at the expense of mild degradation in quality. We also describe the implementation of the new reconstruction algorithm on a Xilinx Virtex-II Pro-100 FPGA. For 512 × 512 natural and aerial images, this implementation results in 68% reduction in the number of memory accesses and 76% reduction in the total computation time compared to the RC method. .

• Type: Conference
• Year: 2008
• Where: SIPS
• Authors: Lanping Deng, Chi-Li Yu, Chaitali Chakrabarti, Jungsub Kim, Vijay Narayanan
• Keywords: Discrete Fourier Transform, Fourier Transform, Signal Processing, SIPS 2008, Smaller Computation Complexity