Lect11 - Image Transforms
Lect11 - Image Transforms
e
Processing
Lecture 11
IMAGE TRANSFORMS
Spectrum
Frequency domain
TRANSFORM
Signal
Time domain
0 Mathematical convenience
0 Convolution in time <==> Multiplication in frequency
domain (complex) domain (simple)
0 Compact form for data storage
Spatial Frequencies in Image
Processing
0 ‘Spatial frequency’ is used to describe the rate of change of
pixel intensity of an image in space. It can be visualized
using the line profile of the image in any row or column.
Introduction
0 What does the Image Transform do?
It represents the given image as a series summation of a set
of Unitary Matrices.
Categories of image transforms: orthogonal (sinusoidal) and
non-sinusoidal.
0 What is a Unitary Matrix?
A Matrix ‘A’ is a unitary matrix if:
A-1 = A*T where A* is conjugate of A
If a Unitary Matrix is real it is known as ORTHOGONAL
Matrix.
Unitary Matrix --------> Basis Functions
Different Image Transforms
IMAGE TRANSFORMS
G(k,l)=T(m,n,k,l) f(x,y)
0 Kronekar product:
Interpretation
0 Any N X 1 sequence can be viewed as vector from origin to
any point in N- dimensional space. And a Unitary transform
can be viewed as a coordinate transformation, rotating the
vector in N-space without changing its length.
0 Thus, a vector of N transform coefficients is generated each
of which is the inner product of the input vector and the
basis vector.
0 Forward transformation = analysis => signal vector is
broken into elemental components (basis vectors). The
transform coefficients specify how much of each component
is found to be present in the mixture.
0 Inverse transformation = synthesis, i.e. reassembling the
original vector from its components.
Questions
0QUESTION
1
Show that A is orthogonal, where
SOLUTION: t1 =; t2 =; t3 =; t4 =
Synthesis: t1H1 + t2H2 + t3H3 + t4H4