Digital Image Processing Question Answer Bank PDF

07/04/2015
Digital Image Processing Question Answer Bank
http://www.scribd.com/doc/45572795/Digital-Image-Processing-Question-Answer-Bank#scribd
1/69
07/04/2015
2/69
07/04/2015
3/69
07/04/2015
4/69
07/04/2015
5/69
07/04/2015
6/69
07/04/2015
7/69
07/04/2015
8/69
07/04/2015
9/69
07/04/2015
10/69
07/04/2015
11/69
07/04/2015
12/69
07/04/2015
13/69
07/04/2015
14/69
07/04/2015
15/69
07/04/2015
16/69
07/04/2015
17/69
07/04/2015
18/69
07/04/2015
19/69
07/04/2015
20/69
07/04/2015
21/69
07/04/2015
22/69
07/04/2015
23/69
07/04/2015
24/69
07/04/2015
25/69
07/04/2015
26/69
07/04/2015
27/69
07/04/2015
28/69
07/04/2015
29/69
07/04/2015
30/69
07/04/2015
31/69
07/04/2015
32/69
07/04/2015
33/69
07/04/2015
34/69
07/04/2015
35/69
07/04/2015
36/69
07/04/2015
37/69
07/04/2015
38/69
07/04/2015
39/69
07/04/2015
40/69
07/04/2015
41/69
07/04/2015
42/69
07/04/2015
43/69
07/04/2015
44/69
07/04/2015
45/69
07/04/2015
46/69
07/04/2015
47/69
07/04/2015
48/69
07/04/2015
49/69
07/04/2015
50/69
07/04/2015
51/69
07/04/2015
52/69
07/04/2015
53/69
07/04/2015
54/69
07/04/2015
55/69
07/04/2015
56/69
07/04/2015
57/69
07/04/2015
58/69
07/04/2015
59/69
07/04/2015
60/69
07/04/2015
61/69
07/04/2015
62/69
07/04/2015
Use:
One application for which vector quantizer has been extremely popular is image
compression.
Disadvantage of vector quantization:
Vectorvideo
quantization
operate
at rates
low rates.
applications
such as
high-quality
coding, applications
which requires
higher
this isFor
definitely
a problem.
To solve these problems, there are several approaches which entails some
structure in the quantization process
Tree structures vector quantizers:
This structure organizes codebook in such a way that it is easy to pick which part
contains the desired output vector
Structured vector quantizers:
Tree-structured vector quantizer solves the complexity problem, but acerbates the
storage problem
We now take entirely different tacks and develop vector quantize that do not have
these storage problems; however we pay for this relief in other ways
5. Explain Arithmetic coding with an example
Algorithm Implementation
Sequence being encoded as:

ln=ln-1+(un-1-ln-1)fx(xn-1)
un= ln-1+(un-1-ln-1)fx(xn)
n becomes larger values gets closer and closer together. The intervals becomes narrower,
there are 3 possibilities
1. the interval is entirely confined to the lower half of the unit interval [0,0.5)
2. the interval is in
3.
entirely
the midpoint
confinedoftothe
theunit
upper
interval
half of the unit interval [0.5,1)
We want to have the sub interval (tag) in the full [0,1) interval
E1:[0,0.5) 1E(x)=2x
E1:[0.5,1) 1E(x)=2(x-0.5)
This process of generating the bits if the tag without waiting to see the entire sequence is
called incremental encoding
Tag generation with scaling
Eg : A={a1,a2,a3} P(a1)=0.8
Encode the sequence 1321
P(a2)=0.02 P(a3)=0.18 Fx(1)=0.8 Fx(2)=0.82 Fx(3)=1
Solution:
first
element is 1
Initialize0=1
u 0l=0
l1=0+(1-0)0=0
u1=0+(1-0)0.8=0.8
The interval [0,0.8) is either in the upper or the lower half of unit interval so proceed
63/69
07/04/2015
Second element 3
l2=0+(0.8-0)0.82=0.656
u2=0+(0.8-0)0.1=0.8
interval [0.656,0.8) is in the upper limit. Send the binary code 1 and scale
lu2=2=2(0.8-0.5)=0.6
2(0.656-0.5)=0.312
Third element 2
l 0.312+(0.6-0.312)0.8=0.5424
u3=0.312+(0.6-0.312)0.82=0.54816
3=
l3=2(0.5424-0.5)=0.0848
u3=2(0.54816-0.5)=0.09632
interval [0.0848,0.09632) is in the lower limit. Send the binary code 0 and scale
l3=2*0.0848=0.1696
u3=2*0.09632=0.19264
l3=2*0.1696=0.3392
u3=2*0.19264=0.38528
l3=2*0.3392=0.6784
u3=2*0.38528=0.77056
l3=2(0.6784-0.5)=0.3568
u3=2(0.77056-0.5)=0.54112
The interval [0.3598,0.54112) is either in the upper or the lower half of unit interval so
proceed
Fourth element 1
lu4=4=0.3568+(0.54112-0.3568)0.8=0.504256
0.3568+(0.54112-0.3568)0=0.3568
Stop the encoding.
Binary sequence generated is 110001. Transmit 1 followed by many 0 required by the
word length
6. Explain about JPEG compression scheme in detail.
64/69
07/04/2015
JPEG is a transform coding approach using DCT. Consider 8*8 block of the
image as shown in table
Table : an 8*8 block of an image
124 125 122 120 122 119 117 118
121
125 121
124 120
123 119
122 119
121 120
121 120
120 118
120
124 124 125 125 126 125 124 124
127 127 128 129 130 128 127 125
143 142 143 142 140 139 139 139
150 148 152 152 152 152 150 151
156 159 158 155 158 158 157 156
The Transform
The transform used in the Jpeg scheme is the DCT .The input image is first level
shifted by 2p-1 ie) subtract 2p-1 from each pixel value. Then the image is divided into
blockes of size 8*8 , which are transformed using an 8*8 forward DCT .The table show
the DCT coefficient.
Table: The DCT coefficient
39.88 6.56 -2.24 1.22 -0.37 -1.08 0.79 1.13
-102.43 4.56 2.26 1.12 0.35 -0.63 -1.05 -0.48
37.77 1.31 1.77 0.25 -1.50 -2.21 -0.10 0.23
-5.67 2.24 -1.32 -0.81 1.41 0.22 -0.13 0.17
-3.37 -0.74 -1.75 0.77 -0.62 -2.65 -1.30 0.76
5.98 -0.13 -0.45 -0.77 1.99 -0.26 1.46 0.00
3.97 5.52 2.39 -0.55 -0.051-0.84 -0.52 -0.13
-3.43 0.51 -1.07 0.87 0.96 0.09 0.33 0.01
Quantization
The JPEG algorithm uses uniform midthread quantization to quantize the various
coefficient. The quantizer step sizes are organized in a table called the quantization table
as shown in table
Table: Sample Quantization table
16 11 10 16 24 40 51 61
12 12 14 19 26 58 60 55
14 13 16 24 40 57 69 56
14 17 22 29 51 87 80 62
18 22 37 56 68 109103 77
24 35 55 64 81 104 113 92
49 64 78 87 103 121 120 101
72 92 95 98 12 100 103 99
The lable corresponding to the quantized value of the transform coefficient ij is obtained
as
Lij=ij/Qij+0.5
65/69
07/04/2015
Where Qij is the (i,j)th element of the quantization table. The reconstructed value is
obtained by multiplying the lable with corresponding entry in the quantization table
Table: The quantizer lable
2 1 0 0 0 0 0 0
-9 0 0 0 0 0 0 0
3 0 0 0 0 0 0 0
0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
Coding
In this approach the lable for the DC and AC coefficient are coded differently
using Huffman codes. The DC coefficient values partitioned into categories. The
categories are then Huffman coded. The AC coefficient is generated in slightly different
manner. There are two special codes: End-of-block(EOF) and ZRL
Table: Coding of the differences of the DC labels
1
2
3
1
-7
-1
-3
-2
. -4
1
2
3
7
Table: sample table for obtaining the Huffman code for a given label value and run length
Z/C
Codeword
0/0
1010
0/1
00
Z/c
1/1
Codeword
1100
..
Z/C
Codeword
F/0
11111111001
F/1 111111111111110101
To encode the AC coefficient First using Zigzag scan. We obtain

-9 3 0 0 0 0 0 0
The first value belong to category 1. transmit the code corresponding to 0/1 follow by a
single bit 1 to indicate that the value being transmitted is 1 and not -1 .Simillarly other
AC coefficient code are transmited.
To obtain the reconstruction of the original block Dequantization is performed and taking
inverse transform of the coefficient we get the reconstructed block
7. Describe the concepts of run length coding
The model that gives rise to run-length coding is the capon model[40], a two-state
markov model with state
s sb
w and
The transition probabilities p(w/b) and p(b/w), and the of
probability
being in
each state p(s
w) and p(s
b), completely specify this model .
66/69
07/04/2015
For facsimile images, p(w/w) and p(w/b) are generally significantly higher than
p(b/w) and p(b/b)
The markov model is represented by the state diagram
The entropy using a probability model and the iid assumption was significantly
more than the entropy using the markov model
Let us try to interpret what the model says about the structure of the data .
The highly skewed nature of the probabilities p(b/w) and p(w/w),and to a lesser
extent p( w/b) and p(b/b), says that once a pixel takes on a particular color, it is
highly likely that the following pixels will also be of the same color
So, rather than code the color of each pixel separately , we can simply code
the length of the runs of each color .
For example, if we had 190 white pixels followed by 30 black pixels ,
followed by another 210 white pixels , instead of coding the 430 pixels
individually, we would code the sequence 190, 30, 210, along with an
indication of the color of the first string of pixels .
Coding the lengths of runs instead of coding individual values is called runlength coding
CCITT GROUP 3 AND 4-RECOMMENDATIONS T.4 AND T.6
The one dimensional coding scheme is a run-length coding scheme in which

each line is represented as a series of alternating white runs and black runs.
The first run is always a white run. If the first pixel is a black pixel, then we
assume that we have a white run of length zero.
Runs of different lengths occur with different probabilities, therefore they are
coded using a variable length code..
The number of possible lengths of runs is extremely large and it is not simply
feasible to build a codebook that large.
Therefore
of generating
a Huffman code for each run length r1, the the
run length instead
is expressed
in the form
R1=64*m+t for t=0.1.63 and m=1,2..27
When we have to represent a run length r1, instead of finding a code for r1,we
use the corresponding codes for m and t.
The codes for t are called the terminating codes and the codes for m are called
make up codes.
67/69
07/04/2015
Except for the optional codes, there are separate codes for black and white run
lengths.
This coding scheme is generally referred to as a modified Huffman scheme
In the two dimensional scheme ,instead of reporting the run lengths ,which in
terms our Markov model is the length of time we remain in one state ,we
report the transition times when we move from one state to another state.
68/69
07/04/2015
69/69

Digital Image Processing Question Answer Bank PDF

Uploaded by

Copyright:

Available Formats

Digital Image Processing Question Answer Bank PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Digital Image Processing Question Answer Bank PDF

Uploaded by

Copyright:

Available Formats

07/04/2015

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank

Digital Image Processing Question Answer Bank