Scribd
Upload
22 views2 pages

DIP Assignment

This document outlines an assignment for the Digital Image Processing course, detailing tasks such as performing linear convolutions on given matrices, applying histogram equalization to an image, and finding DFT and IDFT matrices. It also includes formulating Shannon-Fano and Huffman codes for discrete memoryless sources with specified probabilities, along with calculations for entropy, average message lengths, code efficiency, and redundancy. Students are instructed to complete the assignment in their own handwriting.

Uploaded by

ji0400623
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views2 pages

DIP Assignment

This document outlines an assignment for the Digital Image Processing course, detailing tasks such as performing linear convolutions on given matrices, applying histogram equalization to an image, and finding DFT and IDFT matrices. It also includes formulating Shannon-Fano and Huffman codes for discrete memoryless sources with specified probabilities, along with calculations for entropy, average message lengths, code efficiency, and redundancy. Students are instructed to complete the assignment in their own handwriting.

Uploaded by

ji0400623
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment

PROGRAM: Faculty of Engineering & Applied Sciences BRANCH: BTech-CSE/ECE (VII-Sem)

COURSE: Digital Image Processing COURSE CODE: OEC-601

Note: Write in your own handwriting)


1. The input matrix 𝑥[𝑚, 𝑛] and ℎ[𝑚, 𝑛]. Perform the linear convolution between these
two matrices
1 2 3
𝑥[𝑚, 𝑛] = 4 5 6
7 8 9
1 1
ℎ[𝑚, 𝑛] = 1 1
1 1
2. The input matrix 𝑥[𝑚, 𝑛] and ℎ[𝑚, 𝑛]. Perform the linear convolution between these
two matrices.
1 2
𝑥[𝑚, 𝑛] =
3 4
5 6
ℎ[𝑚, 𝑛 =
7 8

3. A 4 X 4 , 4 bits/pixel original image is given by


10 12 8 9
10 12 12 14
𝑓(𝑚, 𝑛) =
12 13 10 9
14 12 10 12

(a) Apply histogram equalization to the image by rounding the resulting image pixels
to integers.
(b) Sketch the histogram of the original image and the histogram-equalized images.

4. Find the 2 × 2 DFT matrix.


5. Find the 4 × 4 DFT matrix.
6. Apply DFT to the following sequence of the numbers: 𝑥 = {1,2,8,9}.
7. Find IDFT for the following sequence {20, −7 + 𝑗7, −2, −7 − 𝑗7}
8. A discreate memoryless source emits 8-message with probability 1/2, 1/8, 1/8,
1/16, 1/16, 1/16, 1/32, 1/32. Formulate Shannon-Fano code & then find out-(i)
Entropy or Avg. Information per message (ii) Avg. length of each message (iii)
Code efficiency and (iv) Code redundancy.
9. Formulate Shannon-Fano code for a source emitting a 3-message with probability
0.5, 0.4 and 0.1. Also find code efficiency & code redundancy.

10. A discreate memory less source emitting 6-message with probability 0.3, 0.25, 0.15,
0.12, 0.10, 0.08. Formulate Huffman optimum code & then find out:
(i). Avg. Information per code
(ii). Avg. length of code
(iii). Code efficiency
(iv). Code redundancy

You might also like