The document discusses image processing in the frequency domain. It explains that an image can be transformed from the spatial domain to the frequency domain using techniques like the Discrete Fourier Transform (DFT). In the frequency domain, an image is represented by its sinusoidal frequency components rather than by the brightness of pixels. Operations like filtering are easier to perform in the frequency domain compared to the spatial domain. The DFT decomposes an image into its frequency spectrum, with low frequencies in the center and high frequencies towards the edges.
The document discusses image processing in the frequency domain. It explains that an image can be transformed from the spatial domain to the frequency domain using techniques like the Discrete Fourier Transform (DFT). In the frequency domain, an image is represented by its sinusoidal frequency components rather than by the brightness of pixels. Operations like filtering are easier to perform in the frequency domain compared to the spatial domain. The DFT decomposes an image into its frequency spectrum, with low frequencies in the center and high frequencies towards the edges.
The document discusses image processing in the frequency domain. It explains that an image can be transformed from the spatial domain to the frequency domain using techniques like the Discrete Fourier Transform (DFT). In the frequency domain, an image is represented by its sinusoidal frequency components rather than by the brightness of pixels. Operations like filtering are easier to perform in the frequency domain compared to the spatial domain. The DFT decomposes an image into its frequency spectrum, with low frequencies in the center and high frequencies towards the edges.
Image Transformations • Transformation can be applied to an image to convert it from one domain to another. • Viewing an image in different domains enables the identification of features that may not be easily detected in the spatial domain. • Common image transforms include: • Hough Transform, used to find lines in an image • Discrete Cosine Transform, used in image and video compression • Discrete Fourier Transform, used in filtering and frequency analysis • Wavelet Transform, used to perform discrete wavelet analysis. Frequency Domain • In frequency domain, we deal with the rate at which the pixel values are changing in spatial domain. • Fourier theory states that any signal, can be expressed as a sum of a series of sinusoids. • In case of images, they are sinusoidal variations in brightness across the image. Main Idea Main Idea • Fourier Series: periodic signals are represented by summing up sines and cosines and multiplied with a certain weight. Basics :EXTRA Example Basics: Convolution vs Correlation (EXTRA) • Correlation is measurement of the similarity between two signals/sequences. • Convolution is measurement of effect of one signal on the other signal. • The mathematical calculation of Correlation is same as convolution in time domain, except that the signal is not reversed, before the multiplication process. • If the filter is symmetric then the output of both the expression would be same. Basics: Convolution vs Correlation (EXTRA) Basics: Convolution vs Correlation (EXTRA) Basics: Convolution vs Correlation (EXTRA) Spatial vs Frequency domain Spatial vs Frequency domain • Spatial Domain: Spatial vs Frequency domain • Frequency Domain Frequency domain • In the frequency or Fourier domain, the value and location are represented by sinusoidal relationships that depend upon the frequency of a pixel occurring within an image. Frequency Components •t Frequency Domain • The Fourier Transform is used if we want to access the geometric characteristics of a spatial domain image. • Image in the Fourier domain is decomposed into its sinusoidal components. • It is easy to examine or process certain frequencies of the image, thus influencing the geometric structure in the spatial domain Frequency Domain • A signal can be converted from spatial domain to frequency domain using mathematical operators. Frequency Domain Frequency Domain (EXTRA) Frequency Domain • The reason for doing the filtering in the frequency domain is generally because it is computationally faster to perform 2D Fourier transforms and a filter multiply than to perform a convolution in the image (spatial) domain. • This is particularly so as the filter size increases. Fourier Transform (EXTRA) 2D Fourier Transform (EXTRA) Inverse Fourier Transform (EXTRA) Properties (EXTRA) 2D Sinusoidal (EXTRA) Discrete Fourier Transform Fast Fourier Transform (EXTRA) Fast Fourier Transform (EXTRA) Main Properties • The value of the DFT in the origin is the mean value of the function f(x,y)
• If f is real its DFT is conjugate symmetric
• The Fourier spectrum is symmetric
2D Fourier Transform 2D Fourier Transform Spatial vs Frequency Resolution 2D DFT using ID DFT 2D DFT using ID DFT Periodicity of 1D DFT (EXTRA) Periodicity of 1D DFT (EXTRA) Periodicity of 1D DFT (EXTRA) Periodicity of 2D DFT Conventional 2D DFT Filtering in Frequency Domain • In most implementations the Fourier image is shifted in such a way that the DC-value (i.e. the image mean) F(0,0) is displayed in the center of the image. • The further away from the center an image point is, the higher is its corresponding frequency. Image in Frequency Domain • Spatial to Frequency: Image in Frequency Domain • Example: Image in Frequency Domain • How it works Image in Frequency Domain • Spatial to Frequency Image in Frequency Domain • Example: Image in Frequency Domain • Example Image in Frequency Domainv • Relation of spatial domain image and DFT Image in Frequency Domain • Image Example: