Image Processing
Image Processing
IMAGE IN FREQUENCY
SPATIAL COMPONENTS IN
DOMAIN FREQUENCY DOMAIN
TYPES OF Image TRANSFORMS
• Essentially there are two categories of transforms available
1. Orthogonal: uses basic functions that are sinusoidal in nature
Fourier Transforms
Discrete Cosine Transforms
2. Non-sinusoidal: uses basic functions that are non-sinusoidal in nature
Haar Transforms
Walsh Transforms
Hadamard Transforms
• Here g(u) is the transformation of f(x) and matrix T(u,x) is called the forward
transformation kernel .
• Similarly the inverse transformation can be applied to obtain the original
vector. The inverse transformation is of the form:
Basis for a transform
• As image are 2D signals, 2D transforms are required.
• For an N X N image f(x,y), the forward and inverse transforms are as follows:
• Here T(u,v,x,y) and I (x,y.u,v) are called forward and inverse transformation
kernels respectively.
• In any image transforms the main task is to find suitable kernels. Once it is
designed the transformation can be carried out on the image.
Introduction to Fourier transform
• Fourier transform is a unitary transform and is based on the concept of basis
vectors and basis images.
• Where j = √ -1
• Fourier transform treats all the image data as complex number
Introduction to Fourier transform
• Similarly for given F(u), inverse transformation can be applied to get f(x)
• Mathematically inverse Fourier transform can be expressed as:
Introduction to Fourier transform