Professional Documents
Culture Documents
Processing
by
Dr. S. D. Ruikar
Associate Professor,
Department of Electronics Engineering
Walchand College of Engineering,
Sangli
Module 1: Fundamental of
Image Processing and
Transforms
Syllabus
Basic steps of Image processing system
sampling and quantization of an Image
Basic relationship between pixels, Need
for Image Transforms, 2 D Discrete
Fourier Transform, Discrete Cosine
Transform (DCT), Walsh transforms,
Hadamard Transform Haar transform,
SVD and K L transform
Introduction to Image Processing
Nature of Image Processing
Images are everywhere! Sources of Images are
paintings, photographs in magazines, Journals, Image
galleries, digital Libraries, newspapers, advertisement
boards, television and Internet.
Brightness adaptation
Simultaneous contrast
Simultaneous contrast
Mach bands
1. Image header
2. Image data
Structure of TIFF File Format
The tagged image file format (TIFF) is a
standard format that is considered for the
purpose of illustration. The TIFF image
format is as follows:
Periodicty
Convolution
Scaling
Conjugate
2 D DFT Properties
Walsh Transform
Walsh Transform
Walsh Transform
Walsh Transform
Walsh Transform
where
n 1 bi ( x ) bn1i ( u )
1
g ( x, u ) (1)
N i 0
bk ( z ) : The kth bit in the binary representation of z
e.g.,
If N 8, 8 23 , n 3
Let z 6 1102 b0 ( z ) 0 , b1 ( z ) 1 , b2 ( z ) 1
3-173
Example:
n 1 b ( x ) bn1i ( u )
1 N 1 i
W (u ) f ( x) (1)
N x 0 i 0
1 3 1
1 bi ( x ) b1i (0)
3-174
Example : N = 8
3-175
Discrete cosine Transform
Discrete cosine Transform
Discrete cosine Transform
Discrete cosine Transform
1
Discrete cosine Transform
1
Discrete cosine Transform
2
Discrete cosine Transform
Properties of DCT
Hadamard Transform
2D Hadamard Transform
2D Hadamard Transform
2D Hadamard Transform
N=2
N=4
Haar Transform
The Haar transform is based on a class of
orthogonal matrices whose elements are
either 1, -1, or 0 multiplied by powers of
2
Applications
Singular Value Decomposition
We already know that the eigenvectors of a matrix A form a convenient
basis for working with A.
u AT Au k 2k (k j )
T
j
Singular Value Decomposition
Since ATA is positive semidefinite, its {k0}.
Au k 0 v k , k r 1,..., n
1n 1m
uk ; vk
Singular Value Decomposition
Now we can write:
| | | | | | | |
Au Au Au r 1 Au n A u1 u r u r 1 u n AU
1 r
| | | | | | | |
1 0 0 0
| | | | | | | |
0 r 0
1 v1 r v r 0 v r 1 0 v n v1 v r v n
0
v r 1 V
0 0 0 0
| | | | | | | |
0 0 0 0
AUU VU T T
mn mm mn nn T
A V U
SVD: Example
1 1
Let us find SVD for the matrix A
2 2
1
3 3 0 2
3 3 u1 0 u1 1
2
SVD: Example
Now, we obtain the U and :
1
1 1 0
A u1 1 v1 2 0 2 2 0 v1 , 1 2 2 ;
1 2 2 1 1
2 2
2
1
1 1 2 2 1 1
Au 2 2 v 2 2 0 v2 , 2 2 ;
2 2 1 0 0
2
A=VUT: 1 1
1 1 0 1 2 2 0 2 2
2 2 1 0 1
0 2 1
2 2
Singular Value Decomposition
For an m n matrix A of rank r there exists a factorization
(Singular Value Decomposition = SVD) as follows:
A U V T
mn nn V is nn
noise noise
= noise
objects
EXAMPLE SVD
EXAMPLE SVD
SVD example
1 1
Let A 0 1
1 0
Thus m=3, n=2. Its SVD is
0 2/ 6 1/ 3 1 0
1 / 2 1/ 2
1 / 2 1/ 6 1 / 3 0 3
1 / 2 1/ 2 1/ 2
1/ 6 1 / 3 0 0
Ce e
C E x m
x
x m T
x
Let A be a matrix whose rows are formed from the eigenvectors of the
covariance matrix C of the population.
y Ax mx
E y 0
C AC AT
y x
1 0 0
0 0
Cy 2
0 0 n
Inverse Karhunen-Loeve Transform
n K n
ems x x j j j
2
j1 j1 j K
1
By using AK insteadof A for theKLtransformwe can achieve
compresssion of theavailable data.
Drawbacks of the KL Transform
Applications
(non-universal) compression
pattern recognition: e.g., eigen faces
analyze the principal (dominating) components
Thank You