Scribd
Upload
5 views12 pages

Unit 2

Uploaded by

kishore2696
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views12 pages

Unit 2

Uploaded by

kishore2696
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

UNIT II

IMAGE TRANSFORMS

 Need for transform


 2D Orthogonal and Unitary transform and its properties
 1D & 2D DFT – Properties – separability,translation, periodicity, conjugate
symmetry, rotation, scaling,convolution and correlation
 Separable transforms
 Walsh
 Hadamard
 Haar
 Discrete Sine
 DCT
 Slant
 SVD
 KL transforms .
Need for transform

The need for transform is most of the signals or images are time domain signal (ie)
signals can be measured with a function of time. This representation is not always best.
For most image processing applications anyone of the mathematical transformation are
applied to the signal or images to obtain further information from that signal.

2D Orthogonal and Unitary transform and its properties

As a one dimensional signal can be represented by an orthonormal set of basis vectors,


an image can also be expanded in terms of a discrete set of basis arrays called basis
images through a two dimensional (image) transform. For an N X N image f(x,y) the
forward and inverse transforms are given below

Fundamental properties of unitary transforms


The property of energy preservation

In the unitary transformation

it is easily proven that

Thus, a unitary transformation preserves the signal energy. This property is called
energy preservation property. This means that every unitary transformation is simply a
rotation of the vector f in the N - dimensional vector space.

The property of energy compaction

Most unitary transforms pack a large fraction of the energy of the image into relatively
few of the transform coefficients. This means that relatively few of the transform
coefficients have significant values and these are the coefficients that are close to the
origin (small index coefficients).

1D & 2D DFT

Any function that periodically reports itself can be expressed as a sum of sines and
cosines of different frequencies each multiplied by a different coefficient, this sum is
called Fourier series. Even the functions which are non periodic but whose area under
the curve if finite can also be represented in such form; this is now called Fourier
transform. A function represented in either of these forms and can be completely
reconstructed via an inverse process with no loss of information.
THE DISCRETE COSINE TRANSFORM (DCT)

This is a transform that is similar to the Fourier transform in the sense that the new independent
variable represents again frequency. The DCT is defined below.

with a(u) a parameter that is defined below.

The inverse DCT (IDCT) is defined below.

Two dimensional signals (images)

Properties of the DCT transform


 The cosine transform is real and orthogonal.
 The cosine transform is not a real part of the unitary DFT.
 The cosine transform of a sequence is related to the DFT of its antisymmetric
extension
 The cosine transform is a fast transform
 The basis vectors of the cosine transform are the eigen vectors of the symmetric
tridiagonal of Toeplitz matrix
 The cosine transform is close to the KL transform of first order Markov
sequences. The cosine transform has very good to excellent energy compaction
property of images,
The DCT is a real transform. This property makes it attractive in comparison to the
Fourier transform.
The DCT has excellent energy compaction properties. For that reason it is widely used
in image compression standards (as for example JPEG standards).
There are fast algorithms to compute the DCT, similar to the FFT for computing the
DFT.

Sine Transform

Properties of the Discrete Sine Transform

 The sine transform is real, symmetric and orthogonal.


 The sine transform is not the imaginary part of the unitary DFT.
 The sine transform of a sequence is related to the DFT of its antisymmetric
extension
 The sine transform is a fast transform
 The basis vectors of the sine transform are the eigen vectors of the symmetric
tridiagonal of Toeplitz matrix
 The sine transform is close to the KL transform of first order Markov sequences.
The sine transform has very good to excellent energy compaction property of
images,
Hadamard Transform

In a similar form as the Walsh transform, the 2-D Hadamard transform is defined as
follows.

Properties of the Hadamard Transform

 The Hadamard transform is real, symmetric and orthogonal.


 The Hadamard transform is a fast transform
 The Hadamard transform has very good to excellent energy compaction property
of images,

Properties are almost similar to that of Walsh transform.

The Hadamard transform differs from the Walsh transform only in the order of basis
functions. The order of basis functions of the Hadamard transform does not allow the
fast computation of it by using a straightforward modification of the FFT. An extended
version of the Hadamard transform is the Ordered Hadamard Transform for which a
fast algorithm called Fast Hadamard Transform (FHT) can be applied.

Walsh Transform

The Walsh transform is defined as follows for two dimensional signals.

The inverse Walsh transform is defined as follows for two dimensional signals.
Properties of the Walsh Transform

 The Walsh transform is real, symmetric and orthogonal.


 The Walsh transform is a fast transform
 The Walsh transform has very good to excellent energy compaction property of
images,

transform consists of a series expansion of basis functions whose values are
only or and they have the form of square waves. These functions can be
implemented more efficiently in a digital environment than the exponential basis
functions of the Fourier transform.

multiplicative factor of for 1-D signals.
 entical for 2-D signals. This is
because the array formed by the kernels is a symmetric matrix having orthogonal
rows and columns, so its inverse array is the same as the array itself.

 ions. We
can think of frequency as the number of zero crossings or the number of
transitions in a basis vector and we call this number sequency. The Walsh
transform exhibits the property of energy compaction as all the transforms that
we are currently studying

called Fast Walsh Transform (FWT). This is a straightforward modification of
the FFT.

Karhunen-Loeve Transform or KLT

The Karhunen-Loeve Transform or KLT was originally introduced as a series


expansion for continuous random processes by Karhunen and Loeve. For discrete
signals Hotelling first studied what was called a method of principal components, which
is the discrete equivalent of the KL series expansion. Consequently, the KL transform is
also called the Hotelling transform or the method of principal components.
Let ei and i, i n , be this set of eigenvectors and corresponding eigenvalues of Cx , arranged in

Properties of the Karhunen-Loeve transform


Despite its favourable theoretical properties, the KLT is not used in practice for the
following reasons.
 Its basis functions depend on the covariance matrix of the image, and hence they
have to recomputed and transmitted for every image.
 Perfect decorrelation is not possible, since images can rarely be modelled as
realisations of ergodic fields.
 There are no fast computational algorithms for its implementation.

Harr Transform

The harr function hk(x) are defined on a continuous interval, x ϵ [0,1], and
for k= 0 to N-1, where N=2n, The integer k can be uniquely decomposed as

K= 2p+q-1
Where 0≤p≤n-1
q=0,1 for p=0 and 1≤q≤2p.
For example, N=4 we have

The harr function can be defined as

For N=8.The harr transform is given by

Properties of Harr transform

 The Harr transform is real and orthogonal.


 The Harr transform is a fast transform
 The basis vectors of the Harr transform are sequency ordered
 The Harr transform is close to the KL transform of first order Markov sequences.
The Harr transform has poor energy compaction property for images

Slant transform

The NxN slant transform matrices are defined by the recursion


The 4x4 slant transformation matrix is obtained as

Properties of slant transform

 The slant transform is real and orthogonal.


 The slant transform is a fast transform
 The basis vectors of the slant transform are not sequency ordered for n≥3.
 The slant transform is close to the KL transform of first order Markov sequences.
The slant transform is very good to excellent energy compaction property for
images
Questions for Practice:-

TWO MARKS:

1. What is meant by image transform?


2. What is the Need for transform?
3. Write note on unitary transform
4. List out the properties of Unitary transform
5. List out the applications of DCT
6. Mention the properties of Slant Transform
7. Write the transform pair of DST
8. What is hadamard transform? Mention it’s applications
9. Write down 2D DFT
10. Write notes on SVD.
12 MARKS:
1. Explain the various properties of 2D DFT.
2. Explain about DST and DCT.
3. Briefly explain Hadamard and Slant Transform
4. Explain (a) Walsh (b) Harr transform

You might also like