Scribd
Upload
81 views1 page

DIP 17EC72 18EC733assigment1

The document contains 17 questions related to digital image processing. 1) The first question asks to explain the components of a general purpose digital image processing system and compute shortest path lengths between two pixels in a given image segment using 4, 8, and m adjacency. 2) The second questions asks to explain what a histogram is, histogram equalization, and how the histograms of dark, bright, low contrast, and high contrast images would look. 3) The last question asks to explain the fundamental steps involved in image processing.

Uploaded by

Nagaraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
81 views1 page

DIP 17EC72 18EC733assigment1

The document contains 17 questions related to digital image processing. 1) The first question asks to explain the components of a general purpose digital image processing system and compute shortest path lengths between two pixels in a given image segment using 4, 8, and m adjacency. 2) The second questions asks to explain what a histogram is, histogram equalization, and how the histograms of dark, bright, low contrast, and high contrast images would look. 3) The last question asks to explain the fundamental steps involved in image processing.

Uploaded by

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

Karnatak Law Society’s

Vishwanathrao Deshpande Institute of Technology Haliyal-581329


Department of Electronics & Communication Engg.
Assignment - I
Sem/Div: 7 A, B and Parallel
th

Subject: Digital Image Processing


Subject code: 18EC733/17EC72/15EC72

S No. Questions

1) Explain the components of a general purpose digital image processing system.


Consider the image segment mentioned below. Let V= {2, 3, 4}, Compute the lengths of
shortest 4, 8 and m path between ‘p’ and ‘q’. If path does not exist, explain why.
34120
2) 0 1 0 4 2(q)
22314
(p) 3 0 4 2 1
12034
What is histogram? Explain histogram equalisation. How the histogram of following image
3) look like? i) Dark image ii) bright image iii) low contrast image iv) high contrast
image.
4) Explain bit plane slicing and intensity level slicing
What is digital image? With the help of a block diagram explain the fundamental steps in
5)
Digital Image Processing.
6) Explain the brightness adaptation with the help of the related graph
7) Discuss the role of sampling and quantization.
8) Explain Log transformation and power law transformation
9) Explain Elements of Visual Perception with diagram.
10) Explain Image Sensing and Acquisition with diagram.
Define 4-adjacency, 8-adjacency, and m-adjacency.
11)
Explain linear and nonlinear operations of operations on an image.
12) Define histogram and explain equalization with example
For the given 4x4 having gray scale between 0 to 7 perform histogram equalization and
draw histogram of image before and after equalization.
2332
13)
4243
3235
2424
14) Explain Image negative, Log transformation, Power law transformation
An image segment is shown below. Let, V be the set of gray level values used to define
connectivity in the image. Compute D4, D8 and Dm distances between pixels ‘p’ and ‘q’ for
(i) V = {2,3} (ii) V = {2,6}
2 (p) 3 2 6 1
15)
62362
53235
24352
4 5 2 3 6 (q)
Explain Bit plane slicing and Piecewise-Linear Transformations with Intensity level slicing
16)
and contrast stretching.
17) Explain fundamental steps involved in image processing

You might also like