Digital Image Processing Tutorial Questions Answers
Digital Image Processing Tutorial Questions Answers
On
2. Storage
3. Processing
4. Display
17. List the categories of digital storage
1. Short term storage for use during processing.
2. Online storage for relatively fast recall.
3. Archival storage for infrequent access.
18. What are the types of light receptors?
The two types of light receptors are
Cones and
Rods
are
So
it
gives
picture
of
the
the
image.
Image translation
2.
Scaling
3.
Image rotation
34. What is image translation and scaling?
Image translation means reposition the image from one co-ordinate
location to another along straight line path. Scaling is used to alter the
size of the object or image (ie) a co-ordinate system is scaled by a
factor.
35. Define the term Luminance
I+ I
whose
overall
intensity
is
represented
by
monochrome
fewer
than
The problem domain in this example consists of pieces of mail and the
objective is to read the address on each piece. Thus the desired output
in this case is a stream of alphanumeric characters.
image acquisitions
storage
processing
communication
display
1)Image acquisition :
Two devices are required to acquire a digital image ,they are
1)physical device:
Produces an electric signal proportional to the amount of light
energy sensed.
2)a digitizer:
Device for converting the electric output into a digital form.
2.storage:
An 8 bit image of size 1024*1024 requires one million bits of
storage.three types of storage:
1.short term storage:
It is used during processing. it is provide by computer memory. it
consisits of frame buffer which can store one or more images and can
be accessed quickly at the video rates.
2.online storage:
It is used for fast recall. It normally uses the magnetic disk,Winchester
disk with100s 0f megabits are commonly used .
3.archival storage:
They are passive storage devices and it is used for infrequent
access.magnetic tapes and optical disc are the media. High density
magnetic tapes can store 1 megabit in about 13 feet of tape .
3)Processing:
image
functions can be
remote
communication
from
one
point
to
another
in
of
extraneous
model,each
color
appears
in
its
primary
spectral
corner black is at the origin and white is the at the corner farthest from
the origin this model the gray scale extends from black to white.
Images represented in the RGB color model consist of three
component images,one for each primary colors.The no of bits used to
represented each pixel in which each red,green and blue images is an
8 bit image.Each RGB color pixel of values is said to be 24 bits .The
total no of colors in a 24 bit RGB images is 92803=16777,216.
The acquiring a color image is basically the process is shown in fig,. A
color image can be acquired by using three filters,sensitive to
red,green and blue.When we view a color scene with a monochrome
camera equipped with one of these filters the result is a monochrome
image whose intensity is proportional to the response of that filter.
Repeating this process with each filter produces three monochrome
images that are the RGB component images of the color scene.the
subset of color is called the set of safe RGB colors or the set of all
system safe colors. In inter net applications they are called safe Web
colors or safe browser colors.There are 256 colors are obtained from
different combination but we are using only 216 colors .
10.Descibe the HSI color image model
The HSI Color Model
The RGB,CMY and other color models are not well suited for
describing
colors
in
terms
that
are
practical
for
human
if B<=G
if B>G
G = I (1 - S)
B = I [1 + S cos H/cos(60o - H)]
R = 1 - (G + B)
11. Describe the basic relationship between the pixels
2-D Mathematical preliminaries
Neighbours of a pixel
Distance measures
Neighbours of a pixel
And are denoted by ND(p). These points together with the 4neighbours are called the 8-neighbours of p, denoted by N8(p).
4-adjacency. Two pixels p and q with values from V are 4adjacent if q is in the set N4(p).
8-adjacency. Two pixels p and q with values from V are 8adjacent if q is in the set N8(p).
Distance measures
For pixels p,q and z with coordinates (x,y), (s,t) and (v,w)
respectively, D is a distance function or metric if
De(p,q) = [(x-s)2+(y-t)2]
D4(p,q) = |x-s|+|y-t|
2-MARKS QUESTIONS
1.What is the 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.
2. What is Image Transform?
An image can be expanded in terms of a discrete set of basis
arrays called basis images. These basis images can be generated by
j(u)
Where
|F(u)| = R2(u)+I2(u)
(u) = tan-1(I(u)/R(u))
Spectral density is defined by
p(u) = |F(u)|2
p(u) = R2(u)+I2(u)
8. Give the relation for 1-D discrete Fourier transform pair
The discrete Fourier transform is defined by
n-1
F(u) = 1/N
f(x) e
j2ux/N
x=0
f(x) =
F(u) e
j2ux/N
x=0
These equations are known as discrete Fourier transform pair.
9. Specify the properties of 2D Fourier transform.
The properties are
Separability
Translation
Rotation
Average value
Laplacian
sampling
j2ux/N
x=0
Where
n-1
j2vy/N
y=0
symmetric if
g1 is
functionally equal to g2
g(x, y, u, v) = g1(x, u). g1(y,v)
21. Define fast Walsh transform.
The Walsh transform is defined by
n-1
x-1
bi(x).bn-1-i (u)
i=0
where x=0,1,2,
N-1
V=0
0
0
0
23. Write slant transform matrix -aN
SN.
aN
bN
bN
0
I(N/2-1)
1
0
-bN
I(N/2-1)
0
0
aN
0
-1
bN
S
N/2
aN
I(N/2-1)
-I(N/21)
S
N/2
SN = 1/2
.
.
Xn
16-MARKS QUESTIONS
1.Explain
ID Case
F(u)=1/N
1------------------(1)
N-1f(x)exp[-j2ux/N]
x=0
for
u=0,1,2,.N-
N-1F(u)[j2ux/N],
f(x)=
u=0
for
x=0,1,2,.N-
1--------------------------(2)
Equations (1) and (2) called Discrete Fourier transform pair
The values u=0,1,2,N-1 in the discrete Fourier transform
corresponds to the samples of the continuous transform at values 0,
u, 2u.(N-1)u. In other words F(u) corresponds F(uu). The terms
u and x related by the expression u=1/Nx
2D Case
F(u,v)=1/MN
M-1y=0N-1f(x,y)exp[-j2ux/M+vy/N]
x=0
N-1y=0N-1f(x,y)exp[-j2(ux +vy)/N]
x=0
for u, v=0,1,2,.N-1
f(x, y)=x=0N-1y=0N-1F(u,v)exp[j2(ux+vy)/N]
for x, y=0,1,2,.N-1
2.Explain the Properties of 2D discrete Fourier Transform
1. Separability
F(u, v)=1/N
x=0
.N-1
f(x, y)=x=0N-1y=0N-1F(u,v)exp[j2(ux+vy)/N] for x, y=0,1,2,.N1
F(u,v)=1/N x=0N-1F(x,v)exp[-j2ux/N]
where F(x,v)=N[1/Ny=0N-1f(x,y)exp[-j2vy/N
2. Translation
The translation properties of the Fourier Transorm pair are
f(x,y)exp[-j2(u0x +v0y)/N]
pair.
And f(x-x0,y-y0)
F(u,v)exp[-j2(ux0 +vy0)/N]
Periodicity:
The Discrete Fourier Transform and its inverse are periodic with
Conjugate symmetry:
If f(x,y) is real, the Fourier transform also exhibits conjugate
symmetry,
F(u,v)=F*(-u,-v) or F(u,v) =F(-u,-v) where F*(u,v) is the
complex conjugate of F(u,v)
4. Rotation
Polar Coordinates x=rcos, y=rsin, u=wsin, v=wsin then f(x,y)
and F(u,v) become f(r,) and F(w,) respectively. Rotating f(x,y) by an
angle 0
F(w,+ 0)
Distributivity:
The Discrete Fourier Transform and its inverse are distributive
over addition but not over multiplication.
F[f1(x,y)+f2(x,y)]=F[f1(x,y)]+F[f2(x,y)]
F[f1(x,y).f2(x,y)]F[f1(x,y)].F[f2(x,y)]
Scaling
For the two scalars a and b,
Af(x,y)
1/abF(u/a,v/b)
6. Laplacian
The Laplacian of a two variable function f(x,y) is defined as
2f(x,y)=2f/x2+2f/y2
7. Convolution and Correlation
Convolution
The convolution of two functions f(x) and g(x) denoted by
f(x)*g(x) and is defined by the integral, f(x)*g(x)= -f()g(x-)d
where is a dummy variable.
F(u)G(u)
Correlation
The correlation of two functions f(x) and g(x) denoted by
f(x)g(x)
and
is
defined
by
the
integral,
f(x)g(x)= -
, AxM-1
ge(x)=
{g(x), 0xB-1,
{0
M-1f*(m)g(x+m)
{f(x), 0xA-1,
{0
3.Discuss
M=0
, BxN-1
ID Hadamard transform
H(u)=1/N
=
N 1
x 0
f(x) (-1)
n 1
i 0
b (x) b (u)
i
i
n 1
x 0
f (x) g (x , u )
n 1
i 0
f(x ) =
N 1
N 1
H(u)
n 1
i0
bi(x) bi(u)
u 0
f(x ) =
u 0
H(u) h(x,u)
x=0,1.N-1
h(x,u) = (-1)
n 1
bi(x) bi(u)
i 0
2D Hadamard Transform
H(u,v) = 1/N
=
n 1
x 0
x 0
= 1/N
f(x,y)=
y 0
f(x , y) (-1)
n 1
i0
f(x , y) g(x,y,u,v)
y 0
n 1
u 0
n 1
b (x) b (u) + b (y) b (v)
i
i
i
i
i 0
n 1
u 0
N 1
N 1
Similarly ,f(x,y)=
n 1
N 1
H(u.v) (-1)
v 0
n 1
i 0
N 1
v 0
Where h( x , y , u , v) =
H (u.v) h(x, y , u , v)
1/N (-1)
n 1
i 0
[ b (x) b (u)
i
i
+ b (y) b (v)
i
i
] which is the
N 1
x 0
f(x) (-1)
n 1
i 0
b (x) p (u)
i
i
n 1
x 0
f (x) g (x , u )
n 1
i 0
bi(x) pi(u)
f(x)=
N 1
N 1
H(u) (-1)
n 1
i0
bi(x) pi(u)
u 0
f(x)=
H(u) h(x,u)
u 0
n 1
i0
bi(x) pi(u)
2D ordered HT Pair
H(u,v) = 1/N
n 1
x 0
N 1
y 0
f(x , y) (-1)
n 1
i0
[bi(x) pi(u) +
bi(y) pi(v)]
=
n 1
x 0
N 1
y 0
f(x , y) g(x,y,u,v)
n 1
i 0
pi(v)]
n 1
u 0
N 1
H(u.v) (-1)
v 0
n 1
i0
pi(v)]
f(x,y)= =
n 1
u 0
N 1
v 0
H (u.v) h(x, y , u , v)
n 1
i0
( 2 j 1)i
2 / N cos
2N
i=1,2.....N-1,j=0,1,....N-1
6)
0)
3)
7)
1)
4)
2)
5)
Fig .Basic set of the discrete cosine transform. The numbers correspond
to the row of the transform matrix.
Also, the basis matrices show increased variation as we go from
the top-left matrix, corresponding to the
00
(N-1)(N-1) coefficient.
we
discard
the
high
frequency
coefficients
during
the
E[ xnxn 1]
E[ xn 2] ,
The compaction ability of the DCT is very close to that of the KLT. As
many sources can be modelled as Markov sources with high values for
, this superior compaction ability has made the DCT the most popular
transform. It is a part of many international standards, including
JPEG,MPEG and CCITT H.261.
2-MARKS QUESTIONS
1.
2.
3.
4.
Mask is the small 2-D array in which the values of mask coefficient determines the nature of process.
-1
-1
A+4
-1
-1
-1
-1
-1 -1
A+8
-1
-1
-1
-1
Electronic
printing
and
medical
imaging
application
2. Autonomous target detection in smart weapons.
9. Name the different types of derivative filters
1. Perwitt operators
2. Roberts cross gradient operators
3. Sobel operators
10. What is meant by Image Restoration?
to
industrial
Additivity
Homogenity
(x,y)
H
f(x,y)
g(x,y)
g(x,y) = f(,)h(x,,y,)d d
Guassian noise
Rayleigh noise
Erlang noise
Exponential noise
Uniform noise
Impulse noise