Unit-V

1. What is segmentation?
2. What are the three types of discontinuity in digital image?

3. Write the applications of segmentation.

4. How the discontinuity is detected in an image using segmentation?

5. How the derivatives are obtained in edge detection during formulation?

6. Define Gradient Operator?
7. Describe shortly the edge linking and boundary detection
8. Define region growing?
9. What is global, Local and dynamic or adaptive threshold?
10. Write the basic formulation for region-oriented segmentation
11. Define relative data redundancy.
12. Define image compression.
13 What are the applications of data compression?
14. What are the redundancy observed in image compression?
15 How image redundancies can be eliminated?
16 How psycho-visual redundancy is different from other redundancies?
17 List out the type of compression technique.
18 Define losses and lossy compression
19 Define compression ratio.

20 A source emits 4 symbols [a,b,c,d] with the probability 0.4, 0.2, 0.1 and 0.3 respectively. Construct
arithmetic coding to encode and decode the word ‘DAD’.

21 Obtain the Huffman code for word COMMITTEE.

22 What is the fidelity criteria?

23 Explain about bit plane coding.

24 What is run length coding?

25 Give an example for Run length Encoding.

26 What is Arithmetic Coding.

27 Why edge detection is most common approach for detecting discontinuities?

28 How the derivatives are obtained in edge detection during formulation?

29 What is edge?

30 What is block code?

PART-B (Long Answer Questions)

 Unit-I
1. Describe the elements of visual perception.
2. Describe the components of an image processing system.
3. Write short notes on sampling and quantization.
4. Describe the functional elements of digital image processing system with a diagram.
5. Explain the basic relationships between pixels?
6. State and prove following 2D-DFT properties
(i) Periodicity (ii) Separability (iii) Rotation.
7. Consider the function values f(0)=2, f(1)=3, f(2)=4, f(3)=4, when sampled at argument values x0=0.5,
x1=0.75, x2=1.0, x3=1.25 respectively. Compute the corresponding DFT coefficients.
8. Consider the two image subsets S1 and S2 shown below. For V={1}, determine how many:
12) 4-connected ii. 8-connected, and iii. M-connected components are there in S1 and S2? Are S1
and S2 adjacent?
S1 S2
0 0 0 0 0 0 0 1 1 0
1 0 0 1 0 0 1 0 0 1
1 0 0 1 0 1 1 0 0 0
0 0 1 1 1 0 0 0 0 0
0 0 1 1 1 0 0 1 1 1
9. Develop an algorithm for converting a one-pixel-thick 8-path to a 4-path.
10. Describe in detail the convolution and correlation properties of 2D DFT.
11. State and prove following 2D-DFT properties
(i) Average (ii) Conjugate (iii) Rotation.

12. Explain the following with an examples;

(a) 4-connectivity (b) 8-connectivity (c) m-connectivity.
13. Consider the image segment shown.
12) Let V={0, 1} and compute the lengths of the shortest 4-, 8-, and m-path between
p and q. If a particular path does not exist between these two points, explain why.

3 1 2 1(q)
2202
1211
(p)1 0 1 2

14. Consider the image segment shown.

12) Let V={1, 2} and compute the lengths of the shortest 4-, 8-, and m-path between
p and q. If a particular path does not exist between these two points, explain why.

3 1 2 1(q)
2202
1211
(p)1 0 1 2

15. (a) Give the condition (s) under which the D4 distance between two points p and q is equal to the
 shortest 4-path between these points.

(b) Is this path unique?

16. Discuss Brightness Adaption and discrimination with a neat diagram.

17. Explain about image sensing and acquisition.

18. Describe Adjacency and its types with an example.

19. Describe connectivity and its types with an example.

20. Briefly discuss Distance measures.

21. Determine the kernel coefficients of 2D Walsh transform for N = 4.

22. Briefly Explain 2D Discrete Fourier transform.

23. Discuss in detail about various adjacencies with an examples.

24. Discuss 1D and 2D Hadamard transform.

25. State and prove the following properties of 2-D Fourier transform.

(i) Translation (ii) Distributivity (iii) Scaling

26. Explain in detail 2D Discrete Cosine transform.

27. Give the expression for 1D and 2D kernels of Walsh transform, also give the transform expression.

28. Define Fourier spectrum, phase angle and Power spectrum of 1D and 2D DFT.

29. Discuss at least four applications that use digital image processing.

30. Discuss representation of digital images.