Spectral Analysis of 2D Signals (December 1, 2009)
Here, I will describe and explain the basics behind analyzing the spectrum of 2-D signals (including images). - Ryan Scheidt
Spectral analysis of two-dimensional (2D) signals is not much different from the one-dimensional (1D) FFT (Fast Fourier Transform - see [1]) that we are (more) accustomed to.
The only difference is that our signals are now represented in one more plane. We can think of this difference (1D vs. 2D) as the difference between, say, a one-dimensional longitudinal wave in a slinky (like this: [2]), versus a two-dimensional wave from a trampoline (e.g. drop a baseball in the center (or given any other excitation), and the wave will propagate in both x and y-directions ([3])).
For those familiar with the properties of the 1D Fourier Transform (FT), the 2-D Continuous-Space Fourier Transform (CSFT) (see [4] for a reference) is an intuitive extension of the 1D properties. The following Rhea link shows some of these properties: [5].
Now let's look at the spectral analysis of some elementary 2D signals.
We'll start with the 2-dimensional rect(*) signal. Here's the 2-dimensional rect(x,y) function and its CSFT:
(Note: click on any of the following images and then click on the "Full resolution" hyperlink to see the full image.)
Now let's make the "rectangle" a little bit bigger: 16X16. We'll watch what happens to the frequency of the 2-dimensional sinc function:
This is exactly what was expected. Remember, that when we double the width of a 1D rect(x) function, the corresponding sinc(f) has twice the height and twice the frequency. In two dimensions, the corresponding will thus be quadrupled in height (multiplied by two twice), with twice the frequency.
Here's what the two CSFT's look like projected as a one-dimensional image:
Now let's look at the 2D circ(*) function. Here's the 2-dimensional circ(x,y) function and its CSFT:
The name of this CSFT is Jinc(u,v) - (see [6]) Let's try making the "circle" a little bit larger with a radius of 8. We'll watch what happens to the frequency of the 2-dimensional jinc(u,v) function:
Note that both the frequency and magnitude of the jinc(u,v) also went up (more precisely: magnitude quadrupled and frequency doubled, just like the sinc(u,v) as done previously).
Here's what the two CSFT's look like projected as a one-dimensional image:
Now let's look at the 2D cos(*) function. Here's a 2-dimensional cos(x,y) function and its CSFT:
Now let's add a DC component and watch what happens to the CSFT components:
Note that the added DC term of 1 shows up in the CSFT as an impulse at the origin (u=0, v=0).
Now let's combine two 2D cosine waves:
Can you see all five components? There is a small component at the origin (due to the 0.2 DC term)!
Now let's look at images briefly.
The following image, commonly referred to as "Lena" (sometimes also "Lenna"), is a famous image utilized in standard image processing algorithms and testing. The background behind this image is quite interesting. Here are some links for the interested reader: [7], [8]
Let's look at what the 2D FFT of Lena looks like.
We will look at some simple 3X3 filters that are then convolved with the original image to create a filtered image. (For those who have forgotten or need a refresher, here is an excellent webpage showing how 2D convolution is done: [9])
The following pictures show the original image (Lena), the image of the filter, and the filtered image (done with conv2). Note that the FFT2 are plotted as log values, in order to enhance the "contrast" between values.
The colormaps to the right of each image show the corresponding values for each shade of gray (i.e. continuum from white to black). Each image is "normalized to 256 values" so that for each pixel, the lowest values (even if negative) are mapped to 0 (black) and the highest values are mapped to 255 (white).
Let's start with the filter = 1/16*[1 2 1; 2 4 2; 1 2 1], commonly referred to as an "average filter":
Can you tell that the filtered image is "smoothed"? Let's look at the images as 3-dimensional projections for easier visualization (via MATLAB's mesh command). First the original image:
Here's what the image and filtered image look like in two specific rows of the image:
Can you see how the filter removed the high frequency "noise"?
Let's look at a few other filters briefly:
Here's the filter = 1/9*[-1 -1 -1;-1 8 -1;-1 -1 -1], referred to as an "edge detector":
Here's what individual rows of the image and filtered image look like:
Notice that the filter only responds to sharp discontinuities (i.e. rapid changes) in the original image. Since 0 is mapped to gray, the filtered image is mostly gray, with the outlines visible.
Here is the filter = [-1 -1 -1; 2 2 2; -1 -1 -1], used as an "horizontal edge detector":
Again, here's what individual rows of the image and filtered image look like:
Here is the filter = [-1 2 -1; -1 2 -1; -1 2 -1], used as an "vertical edge detector":
Again, here's what individual rows of the image and filtered image look like:
Can you see the difference in the filtered image here versus the "horizontally filtered" image as before? View the images at full resolution and note which details are emphasized/de-emphasized in each case.
Lastly, let's look at what happens to the FFT2 of Lena as we add noise to the image (using MATLAB's randn).
Here's the original image and corresponding CSFT:
Now let's add a little bit of noise (100*randn(512,512)):
With ten times more noise:
And ten times more noise again!:
We see that the noisy image approaches an impulse at the origin (with "white noise" elsewhere), indicating that the image's periodic nature is degraded and soon approaches simply a DC image (represented by an impulse at the origin).
Wow! What a page! I think you should consider including it in your e-portfolio when you apply for jobs/graduate school. --Mboutin 12:29, 27 November 2009 (UTC)
Any chance you could present on Monday instead of Tuesday? --weim
Sorry, I cannot make Mondays due to a meeting at that time. -- rscheidt
