An Optimal Frequency Domain Filter for Edge

Detection in Digital Pictures

The authors aim to optimize spatial frequency domain filters by

maximizing the energy within a resolution of certain width around the
neighbourhood of the edge.They do so with the help of Fast Fourier
Transforms.It is applied to a spheroidal wave function.
Edges have been defined as large and sudden changes in brightness in
the image.Local gradient operators suffer in performance when the
edges are blurred or are noisy.The problem of edge detection is seen as
a one dimensional problem for simplification.Unit step function is used
for input edge function.
The problem is mathematically defined as:

Where I is the interval and omega is the filter bandwidth.H(w) denotes

the Fourier transforms of the input and output images and there is a
requirement such that H(0)=0 when the input is a slowly varying function.

The solution to this problem is derived from the properties of spheroidal

wave functions.The prolate spheroidal wave functions are a set of band-
limited functions which possesses the property of being orthogonal over
a given a finite and infinite interval. An asymptotic version of the filter
given by Slepian is shown to be a good approximation of the result of the
spheroidal wave function . It is easier to implement this on a digital basis
as the former would require excessive amounts of processing and
storage.It has shown using examples that the output of the prolate filter
output is better than ones like Laplacian and V-filter . As the value of the
parameter c increases, the edges are shown to get thicker and more
clearer in noisy images.
2.Performance analysis of frequency domain based
feature extraction techniques for facial expression
recognition

Facial Expression Recognition is necessary for designing any human-machine

interface. The main issue of Facial Expression Recognition is to decide what features
are required to represent a Facial Expression. The researcher’s propose the hybrid
technique for facial expression recognition. They proposed a combined method of
feature extraction using Discrete Cosine Transform, Gabor Filter, Wavelet Transform
and Gaussian distribution technique to improve the recognition rate.

Discrete Cosine Transform- A discrete cosine transform (DCT) is defined and an

algorithm to compute it using the fast Fourier transform is developed. It is shown that
the discrete cosine transform can be used in the area of digital processing for the
purposes of pattern recognition and Wiener filtering. Its performance is compared
with that of a class of orthogonal transforms and is found to compare closely to that
of the Karhunen-Loève transform, which is known to be optimal. The performances of
the Karhunen-Loève and discrete cosine transforms are also found to compare closely
with respect to the rate-distortion criterion. Gabor Filter- A gabor filter set with a
given direction gives a strong response for locations of the target images that have
structures in this given direction. If your target image is made of a periodic grating in a
diagonal direction, a gabor filter set will give you a strong response only if its direction
matches the one of the grating. A Gabor filter is some parametrization of the idea of
edges. This combines two somewhat contradictory ideas: an abrupt transition AND
some fuzzy idea of where it is localized. It is mathematically a clever idea as it
translates well in the Fourier domain: the Fourier transform of a Gabor is a Gaussian
in Fourier space, and a Gaussian blob is the most neutral guess of something blurry
you can make (think of throwing darts and looking at the patterns of hits).

As a consequence, when you use a Gabor, there is no 'right' formula: it all depends on
what you want to detect/filter. In visual neuroscience, a popular choice is to chose a
Gabor that corresponds in Fourier space to a blob on the logarithm of frequencies (as
from the Weber law, we are sensitive to relative differences of frequencies).

Wavelet Transform -WT became a tool widely used for signal analysis.This technique
has been demonstrated to be fast in computation with localization and quick decay
properties in contrast to existing popular methods, especially, the fast Fourier
transform FFT. The WT has been applied for signal processing in spectral studies
owing to its efficiency, large number of basis functions available, and high speed in
data treatment. One of the main features of WT is that it may decompose a signal
directly according to the frequency and represent it in the frequency domain
distribution state in the time domain. In the transformation, both time and frequency
information of the signal are retained. Another important thing, the time domain can
be replaced by other domains such as energies of channel numbers. With proper
identification of the scales with frequency, higher frequency signals can be separated
from the lower one, in the sense that it has zoom-in and zoom-out capability at any
frequency.