Image Compression and Decompression based on FFT algorithm

Image compression is a type of data compression technique, used to shrink costs for digital images storage or transmission. Fast Fourier Transform (FFT) is an algorithm, which is broadly used for image compression. It calculates a sequence’s discrete Fourier transform (DFT) or inverse (IDFT). A signal’s representation in the temporal or spatial domain can be changed to the frequency domain by Fourier analysis, and vice versa. First, by removing high frequency components, one may achieve frequency domain picture compression. The compressed picture can then be recovered by applying the inverse FFT. The literature on rapid Fourier transform image compression is reviewed in this work. The fundamentals of Fourier and rapid Fourier transforms, as well as picture compression, are covered in this article. It also goes over a number of FFT-based image compression methods, such as JPEG, JPEG2000, and SPIHT. The benefits and drawbacks of utilizing FFT for picture compression are covered in the paper’s conclusion.