Welcome to JJEM: A Multi-Disciplinary Journal of JNNCE, Shimoga
Reena Hooda, Himanshu , Vikas Poply
This manuscript aims to find out the error in the operations of Fourier Transform (FT) and Fast Fourier Transform (FFT) in digital image processing. We apply FT to transform the time-domain signal to the frequency domain signal. FT is a basic technique in the field of Mathematical and Engineering works. We use Fourier analysis in digital image processing. The Fourier analysis represents a lot of things such as filters, transformation, representation, encoding, data processing, and valid more fields. The FFT development in recent times is very important for the case of image processing. FFT is very exquisite and ubiquitous work in Enfield of digital image processing. In this paper, we study FT and FFT to demonstrate how it solves relative technology problems in the field of security of images. Also, we analyzed the error when changing the fraction order inside FFT, what changes in the mean square error, and on which fraction order our mean square error is obtained the least.
Digital Image; Mean Square Error; Fourier Transform; Fast Fourier Transform