
































Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
An in-depth exploration of various image transforms, including the fast fourier transform (fft) and discrete cosine transform (dct), and their applications in digital image processing. The concepts of spatial frequency, convolution theorem, filtering in the frequency domain, and noise removal. It also introduces the discrete cosine transform and its use in compression and recognition.
Typology: Slides
1 / 40
This page cannot be seen from the preview
Don't miss anything!

































Image Transforms
Jean Baptiste Joseph Fourier
Fourier face in Fourier Transform Domain Docsity.com
Image is function of x and y
Now we need two cosinusoids for each point, one for x and one for y
Lines in the figure correspond to real value 1
Now we have waves in two directions and they have frequencies and amplitudes Docsity.com
Fourier Transform of a spot
Original image Fourier Transform
… will be covered in a separate
lecture on spectral
approaches…..
< < image
..and its spectrum
Image and its spectrum
Image and its spectrum
Let g ( u,v ) be the kernel Let h ( u,v ) be the image G ( k , l ) = DFT [ g ( u,v )] H ( k , l ) = DFT [ h ( u,v )]
Then
DFT −^1 [^ G H ⋅ ] = g h ∗
where means multiplication and means convolution.
⋅ ∗
Convolution Theorem
Instead of doing convolution in spatial domain we can do multiplication In frequency domain
Convolution in spatial domain
Multiplication in spectral domain
Image
Spectrum (^) Noise and its spectrum
Noise filtering