Digital Image Processing

Types of image transforms

 CONTENTS

1. Types of Image Transforms.

2. Some practical applications of Image Transforms
3. Basis for a Transform.
4. Introduction to Fourier Transforms.
5. Discrete Fourier Transforms.
6. Numerical
Basic steps for filtering in the frequency domain
 Basic steps for filtering in the frequency domain

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

Note: Fourier transform methods are useful in converting a spatial description of an

image into another description of the information in terms of image frequency
components.
 Some practical applications OF Image TRANSFORMS

• They convert spatial information into frequency domain information.

• Useful of getting information about sampling.

• Help to design faster algorithms.

• Spatial frequency transforms helps in assessing image quality.

 Basis for a transform
• Let f(x) be the vector of the size N, with input samples f=[f(0),f(1)…F(N-1)]^T
Where T is the transformation applied to this input sequence to yield the resultant
vector of the form g(x).
• If so g(x) is also a vector of the size N-1.
• This transformation vector can be represented as:

• 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.

• a unitary transformation is a transformation that preserves the inner product:

the inner product of two vectors before the transformation is equal to their
inner product after the transformation.

• Important feature of Fourier transform is that irrespective of the type of the

signal, it is possible to describe the signal as the sum of a collection of sine
and/or cosine waves of different frequencies and multiplied by the weighted
functions.
 Introduction to Fourier transform

• 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