Kala, S and Nalesh, S and Jose, BR and Mathew, J (2017) Image reconstruction using novel two-dimensional Fourier transform. [Book Chapter]
Full text not available from this repository.Abstract
Reconstruction of a signal from its subset is used in various contexts in the field of signal processing. Image reconstruction is one such example which finds widespread application in face recognition, medical imaging, computer vision etc. Image reconstruction is computationally complex, and efficient implementations need to exploit the parallelism inherent in this operation. Discrete Fourier Transform (DFT) is a widely used technique for image reconstruction. Fast Fourier Transform (FFT) algorithms are used to compute DFTs efficiently. In this paper we propose a novel two dimensional (2D) Fast Fourier Transform technique for efficient reconstruction of a 2D image. The algorithm first applies 1D FFT based on radix- 4n along the rows of the image followed by same FFT operation along columns, to obtain a 2D FFT. Radix- 4n technique used here provides significant savings in memory required in the intermediate stages and considerable improvement in latency. The proposed FFT algorithm can be easily extended to three dimensional and higher dimensional FFTs. Simulated results for image reconstruction based on this technique are presented in the paper. 64 point FFT based on radix- 43 has been implemented using 130nm CMOS technology and operates at a maximum clock frequency of 350 MHz.
| Item Type: | Book Chapter |
|---|---|
| Publication: | Studies in Computational Intelligence |
| Series.: | Studies in Computational Intelligence |
| Publisher: | Springer Verlag |
| Additional Information: | The copyright for this article belongs to Springer, Cham. |
| Department/Centre: | Division of Interdisciplinary Sciences > Computational and Data Sciences |
| Date Deposited: | 03 Aug 2022 08:59 |
| Last Modified: | 03 Aug 2022 08:59 |
| URI: | https://eprints.iisc.ac.in/id/eprint/75242 |
Actions (login required)
 |
View Item |
