Spectral Analysis of 2D Signals (December 1, 2009)
Here, I will describe and explain the basics behind analyzing the spectrum of 2-D signals - principally images! - Ryan Scheidt
Spectral analysis of two-dimensional (2D) signals is not much different than the familiar one-dimensional (1D) FFT (Fast Fourier Transform - [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) is an intuitive extension of the 1D properties. The following rhea link shows some of these properties: [4]
Let's look at the 2D spectrum analysis of some elementary signals.
Let's start with the 2-dimensional rect signal. Here's the 2-dimensional rect(x,y) function and its CSFT [Note: many of the 2D CSFT plots are in log10 scale, so as to better show "contrast" in values]:
(Note: click on any of the following image thumbnails and click on "Full resolution" hyperlink to see full image.)
Now let's make the "rectangle" a little bit bigger: 32X32. 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 (hard to see here because of log scale) and twice the frequency (easily visible above).
Now let's look at the circ(x,y) function. Here's the 2-dimensional circ(x,y) function and its CSFT:
Now let's make the "circle" a little bit larger with a radius of 8. We'll watch what happens to the frequency of the 2-dimensional jinc function:
Note that both the frequency and magnitude of the jinc(u,v) also went up (more precisely: doubled, just like the sinc(u,v) as done previously).
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: [5], [6]
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. [Here is an excellent webpage showing how 2D convolution works: [7]]
The following pictures show the original image (Lena), the image of the filter, and the filtered image (done with conv2). MATLAB m-files available upon request.
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:
