11-06-2013, 12:46 PM
SEMESTER EXAMINATIONS FOR IMAGE PROCESSING AND PATTERN RECOGNITION
IMAGE PROCESSING AND PATTERN.pdf (Size: 83.04 KB / Downloads: 23)
Answer any five questions
All questions carry equal marks
1. Consider the image segment shown
3 1 2 1 (q)
2 2 0 2
1 2 1 1
(p) 1 0 1 2
a) Let V = {1, 2} be the adjacency of pixels valued 1 and 2. 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.
b) 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.
2. a) Explain different components of an image processing system.
b) Explain sampling and quantization.
3. a) Explain Homomorphic filtering.
b) Show that the Fourier transform and its inverse are linear processes.
4. a) Discuss the limiting effect of repeatedly applying a 3x3 low-pass spatial filter to a digital
image. You may ignore border effects.
b) Propose a technique for updating the median as the center of the neighborhood is moved from pixel to pixel.
5. a) Find the normalized starting point of the chain code 11076765543322.
b) Find an expression for the signature of the following boundaries, and plot the signatures.
i) an equilateral triangle ii) a rectangle iii) an ellipse.
6. a) Explain K-means clustering method to group N data points into K-clusters.
b) Suppose that X is a discrete random variable with the following probability mass function: where 0 ≤ α ≤ 1 is a parameter. The following 10 independent observations were taken from such a distribution: (3, 0, 2, 1, 3, 2, 1, 0, 2, 1). What is the maximum likelihood estimate of α?
7. a) Explain Histogram equalization.
b) Explain Weiner filtering.
8. Explain the following in detail
a) Thinning and Thicking
b) Lossless prediction coding model
c) Sobel Edge detection.