Documente Academic
Documente Profesional
Documente Cultură
ECE
VII Semester
UNIT I
DIGITAL IMAGE FUNDAMENTALS
1.1. Define Image.
An Image may be defined as a two dimensional function f(x,y) where x & y are
(plane) coordinates, and the amplitude of f at any pair of coordinates ( x,y) is
spatial
called
gray
levelintensity
of the or
image at that point. When x,y and the amplitude values of
f are
all finite,
discrete
quantities we call the image as Digital I mage.
1.2. Define Image Sampling.
Digitization of spatial coordinates (x,y) is called I mage Sampling. To be
computer
processing,
an image function f(x,y) must be digitized both spatially and
suitable
for
in magnitude.
1.3. Define Quantization.
Digitizing the amplitude values is called Quantization. Quality of digital
image is to a large degree by the number of samples and discrete gray levels
determined
usedquantization.
in sampling
and
1.4. What is Dynamic Range?
The range of values spanned by the gray scale is called dynamic range of an
image.
Image
will have high contrast, if the dynamic range is high, and image will have
dull
outwashed
gray look if the dynamic range is low.
1.5. Define Mach band effect.
The spatial interaction of Luminance from an object and its surr ound cr
eates a
phenomenon
called the mach band effect.
1.6. Define Brightness.
Brightness of an object is the perceived luminance of the surround. Two objects
with
different surroundings would have identical luminance but differ ent br ightness.
VII
VII
1.16. Write the expression to find the number of bits to st ore a digit
al image?
The number of bits required to store a digital image is
b=M X N X k
When M=N, this equation becomes
b=N^2k
1.17. What is meant by pixel?
A digital image is composed of a finite number of elements, each
of
which has
a of value. These elements are referred to as
particular
location
pixels or
image or
elements
or
picture
elements
pels elements.
1.18. Define digital image.
A digital image is an image f( x,y) , that has been discretized both
and
br ightness.
in spatial
coordinates
1.19. List the steps involved in digital image processing.
The steps involved in digital image processing are,
i.Image Acquisition.
ii.Preprocessing.
iii.Segmentation.
iv.Representation and descr iption.
v.Recognition and interpretation.
1.20. What is recognit ion and interpretation?
Recognition is a process that assigns a label to an object based on
the information
provided
by its descriptors. Interpr etation means assigning to a
recognized object.
1.21. Specify t he elements of DIP system.
The elements of DIP system are,
i.Image acquisition.
ii.Storage.
iii.Processing.
iv.Communication.
v.Display.
1.22. List the categories of digit al storage.
The categories of digital storage are,
i.Short term storage for use during processing.
ii.Online storage for r elatively fast recall.
iii. Archical storage for frequent access.
1.23.two
The
Prepared
Write
types
ii.Rods.
by
i.Cones.
the
A.Devasena.,
oftwo
lighttypes
receptors
Associate
of light
are,receptors.
Professor., Dept/ECE Page 3
VII
VII
VII
W
N ^(K+N/2) = - W
N ^K
1.40. Give the Properties of one-dimensional DFT.
The properties of one-dimensional DFT are,
i. The DFT and unitar y DFT matr ices are symmetric.
ii. The extensions of the DFT and unitar y DFT of a sequence and their
inver
se transforms
ar e periodic
with period N.
iii. The DFT or unitary DFT of a real sequence is conjugate symmetric
about N/2.
1.41. Give the Properties of two-dimensional DFT.
The properties of two-dimensional DFT are,
i.Symmetric
ii.Periodic extensions
iii.Sampled Fourier transform
iv.Conjugate symmetr y.
1.42. Write the properties of cosine transform:
The properties of cosine transfor m are as follows,
i.Real & orthogonal.
ii.Fast transform.
iii.Has excellent ener gy compaction for highly cor related data
1.43. Write the properties of Hadamard transform
The properties of hadamard transform are as follows,
i.Hadamard transform contains any one value.
ii.No multiplications are required in the transfor m calculations.
2
iii.The no: of additions or subtractions required can be reduced from
to about
N Nlog
N2
iv.Very good energy compaction for highly correlated images.
1.44. Define Haar transform.
The Haar functions are defined on a continuous interval Xe [0,1]
1,whereand
N=2^n..The
integer
for K=0,1,
N- k can be uniquely decomposed as
K=2^P+Q-1.
1.45. Write the properties of Haar transform.
The properties of Haar transfor m are,
i.Haar transform is real and orthogonal.
ii.Haar transform is a ver y fast transfor m
iii.Haar transform has very poor energy compaction for images
iv.The basic vector s of Haar matr ix sequensly ordered.
1.46.Write
Prepared
The
iii.Slant
iv.The
ii.Slant
i.Slant
properties
bythe
basic
A.Devasena.,
transform
Properties
vectors
of Slant
is
has
of
areal
Associate
transform
of
ver
fast
Slant
Slant
and
ytransform
good
matrix
orthogonal.
transform.
Professor.,
are,
energy
are not
compaction
Dept/ECE
sequenselyfor
Page
ordered.
images
6
VII
VII
UNIT II
IMAGE ENHANCEMENT
2.1. What is Image Enhancement?
Image enhancement is to process an image so that the output is more
suitable
for specific
application.
2.2. Name the cat egories of Image Enhancement and explain?
The categories of Image Enhancement are,
i.Spatial domain
ii.Frequency domain
Spat ial domain: It refers to the image plane and it is based on direct
manipulation of pixels of an image.
Frequency domain
techniques are based on modifying the Fourier transform of an image.
2.3. What do you mean by Point processing?
Image enhancement at any Point in an image depends only on the gr ay
levelisatoften referred to as Point processing.
that point
2.4.What is gray level slicing?
Highlighting a specific range of gray levels in an image is referred to as
gray
slicing.
It islevel
used in satellite imagery and x-ray images
2.5. What do you mean by Mask or Kernels.
A Mask is a small two-dimensional array, in which the value of the
mask
coefficient
determines the nature of the process, such as image
sharpening.
2.6. What is Image Negative?
The negative of an image with gray levels in the range [0, L-1] is
obtained
using the
negativebytransformation, which is given by the expr ession.
s = L-1- r ,Where s is output pixel, r is input pixel
2.7. Define Histogram.
The histogr am of a digital image with gray levels in the range [0, L-1]
function ish a(rdiscrete
the level
number
and ofnk pixels in the image
k ) = nk, where rk is the k th isgray
having gray level r k .
Contrast
It is a stretching
techniquereduces
used toanobtain
image linear
of higher
histogram
contrast .than
It isthealso
or
2.8.What
isisA.Devasena.,
histogram
equalization
2.9.
Prepared
linear
levels
What
iginal,
ization.
by
known
below
contrast
byCondition
m
as
darkening
and
histogram
stretching?
brightening
Associate
for
theuniforthe
Professor.,
m levels
histogram
above
Dept/ECE
is P
ms (ins)the
=Page
1image.
8
VII
VII
UNIT III
IMAGE RESTORATION
3.1. Define Restoration.
Restoration is a process of reconstructing or recover ing an image
thatbyhas
beena prior i knowledge of the degradation
degraded
using
phenomenon.
restoration
techniques
are Thus
oriented
towards modeling the degradation and applying
the inverse
process
order
to recover
thein
or iginal image.
3.2. How a degradation process id modeled?
A system oper ator H, which together with an additive white noise ter
m n(x,y)
operates
on
an input
image af(x,y)
to produce
a degraded image g(x,y).
3.3. What is homogeneity property and what is the significance of
Homogeneity property states that
this property?
H [k1 f1 (x,y)] = k1 H[f1 (x,y)]
Where H=operator
K1 =constant
f(x,y)=input image.
It says that the response to a constant multiple of any input is equal to
themultiplied
response by
to that
input
the same constant.
3.4.What is meant by image restoration?
Restoration attempts to reconstruct or recover an image that has been
degraded
by using aof the degrading phenomenon.
clear knowledge
3.5. Define circulant matrix.
A square matrix, in which each row is a circular shift of the preceding
row isrow
a circular
of the last row, is called circulant matrix.
and theshift
first
3.6. What is the concept behind algebraic approach to restoration?
Algebraic approach is the concept of seeking an estimate of f,
denoted
f^, thatcriterion of per for mance where f is the image.
minimizes
a predefined
3.7. Why the image is subjected to wiener filtering?
This
method
off^that
filtering
consider
asof
random
process
is to find
them
is
Spatial
minimized.
an estimate
transformation
So
of the
image
is defined
uncor
is subjected
rupted
as images
the image
rear
to and
wiener
rangement
f noise
such
filter
that
ing
the
pixels
tomean
on an
and
objective
3.8. minimize
3.9.
Prepared
square
Define
by
image
error
spatial
Gray-level
A.Devasena.,
thethe
between
plane.
error.
transformation.
interpolation.
Associate Professor., Dept/ECE Page 10
VII
VII
VII
UNIT IV
DATA COMPRESSION
4.1. What is Data Compression?
Data compression requires the identification and extraction of
source data
redundancy.
I n seeks to reduce the number of bits
other words,
compression
used mation.
to store or transmit
infor
4.2. What are two main types of Data compression?
The two main types of data compression ar e lossless compression
lossy
compr and
ession.
4.3.What is Lossless compression?
Lossless
can recover
compression
the exact original data after compr ession. It is used
mainly for compressing database records, spreadsheets or word
processing of
files,
where exact
replication
the original
is essential.
VII
VII
VII
VII
UNIT V
IMAGE SEGMENTATION
5.1. What is segmentation?
The first step in image analysis is to segment the image.
image into
its constituent
parts or objects.
Segmentation
subdivides
an
5.2. Write the applications of segmentation .
The applications of segmentation are,
i. Detection of isolated points.
ii. Detection of lines and edges in an image.
5.3. What are the three types of discontinuity in digital image?
Three types of discontinuity in digital image are points, lines and
edges.
5.4. How the discontinuity is detect ed in an image using
The steps used to detect the discontinuity in an image using
segmentation?
segmentation are
i.Compute the sum of the products of the coefficient with the gray
encompassed
levelsregion
contained
inthe by the mask.
+..+
w
z3
ii. The response of the mask at any point in the image is R = w
1 z1 + w+
2 z
23
w9 z9
iii. Where zi = gray level of pixels associated with mass coefficient w i.
iv.The response of the mask is defined with respect to its center
location.
5.5. Why edge detection is most common approach for detecting
The isolated points and thin lines are not frequent occurrences in
discontinuities?
most so
practical
applications,
edge detection is mostly preferred in detection of
discontinuities.
5.6. How the derivatives are obtained in edge detection during
The fir st derivative at any point in an image is obtained by using the
formulation?
of Similar
the
gradientmagnitude
at that point.
ly the second der ivatives are obtained by
using the laplacian.
5.7. detection.
Writeneighborhood
about
linking
edge
points.
small
The
Allapproach
points
(that
3x3
forare
orlinking
similar
5x5) about
edge
are linked,
every
pointspoint
forming
is to
(x,y)in
analyse
a boundary
an image
the of
Prepared
that has
pixels
common
by
that
characteristics
under
A.Devasena.,
properties.
share
gone
some
edge
Associate
of pixels Professor.,
in a
Dept/ECE Page 17
VII
VII
i.Preprocessing.
ii.Definition of a set of criteria that markers must satisfy.
VII
ii.Perimeter.
iii.Mean and median gray levels
iv.Minimum and maximum of gray levels.
v.Number of pixels with values above and below mean.
5.26. Define text ure.
Texture is one of the regional descriptors. It provides measure measures
as
coarseness and regularity.
of smoothness,
properties such
5.27. Define compact ness.
2
Compactness of a region is defined as (perimeter)
/ area. It is a dimensionless
quantity and
is insensitive to uniform scale changes.
5.28. List the approaches t o describe texture of a region.
The approaches to describe the texture of a region are,
i.Statistical approach.
ii.Structural approach.
iii.Spectural approach.
5.29. What is global, local and dynamic or adaptive threshold?
When threshold T depends only on f( x,y) then the thr eshold is called
both
onIff(x,y)
and p(x,y) then it is called local. I f T depends on the
global.
T depends
spatial
coordinates
x and
y,
the
threshold
is called
dynamic
or adaptive where f(x,y) is the original
image.
5.30. What is thinning or skeletonizing algorithm?
An important approach to represent the structur al shape of a plane
region This
is to reduce
it tomay
a be accomplished by obtaining the
graph.
reduction
central
role inalgor
a broad
r ange
skeletonizing
ithm. It
plays of
a problems in image processing,
ranging from
inspection
of prautomated
inted circuit boards to counting of asbestos fibers in air
filter.