|
Is there any instance where Fourier transforms of color images have been used in conjunction with other object recognition method? Any instance of usage of Fourier transforms in color images? I think there is great potential in the usage of Fourier transforms of color images. |
|||||||
|
|
Okay I found some ideas about using Fourier Transforms in Object Recognition. What I am unable to understand is however, its downsides. Why was the method discarded. For those who are interested in reading about how Fourier Transforms were applied in Object Recognition , look for Fourier Mellin Transforms. The Fourier-Mellin transform is a useful mathematical tool for image recognition because its resulting spectrum is invariant in rotation, translation and scale. The Fourier Transform itself (FT) is translation invariant and its conversion to log-polar coordinates converts the scale and rotation differences to vertical and horizontal offsets that can be measured. A second FFT, called the Mellin transform (MT) gives a transform-space image that is invariant to translation, rotation and scale. The steps: The Fourier Transform The Discrete Fourier Transform (DFT) is given by the following expression:
This is often computed using the Fast Fourier Transform algorithm to speed up the time needed for the calculation. Cartesian to Log-Polar conversion The FFT is projected onto the log-polar plane by the coordinate transform shown below.
For the conversion from Cartesian coordinates to Log-Polar coordinates the following equation is true:
The origin (mo, no) should be at the center of the image matrix to ensure the maximum number of pixels is included. If the image consists of a square N x N matrix then the coordinates of the origin are:
The maximum sampling radius for the conversion can now be calculated as:
If an inscribed circle is chosen as the conversion boundary, some pixels that lie outside the circle will be ignored. If a circumscribed circle is chosen, all pixels will be taken in account, but some invalid pixels will also be included (pixels falling inside the circle but outside of the image matrix). Since the pixels in Cartesian coordinates cannot be mapped one-to-one onto pixels in the Log-Polar coordinate space, an average of the surrounding pixels needs to be calculated. The standard methods to do this includes nearest neighbor, bilinear and bicubic resampling. The relationship between the polar coordinates ($\rho$, $\theta$) used to sample the input image and the polar coordinates of the log-polar image (r , $\theta$) can be described by: $$(\rho,\theta) = (e^r, \theta) $$ To map the input image pixels imagein(xi,yi) onto the output image pixels imageout(rm, $\theta$m), the co-ordinates xi, yi are computed using:
where $$(\rho,\theta) = (e^r, \theta) $$ The next step is to get a transform-space image that is a rotation and scale invariant representation of the original image. This is done using the Mellin transform which can be expressed as:
Converting to polar coordinates, we have:
Now using $$(\rho,\theta) = (e^r, \theta) $$ we get:
The Fourier Mellin transform has been used for Image Recognition in R. Moller, H. Salguero, E. Salguero: “Image recognition using the Fourier-Mellin Transform”, LIPSE-SEPI-ESIME-IPN, Mexico |
|||||||||||||
|
