Jawaharlal Nehru Technological University Kakinada 2009-1st Sem B.Tech Information Technology IV Regular s, IMAGE PROCESSING - Question Paper
Code No: M1203
Set No. 1
Code No:
IV B.Tech I Semester Regular Examinations, November 2009
IMAGE PROCESSING
(Information Technology)
Time: 3 hours Max Marks: 80
Answers any Five Questions
All Questions carry equal marks
*****
1. Explain about fundamental steps in Image Processing with neat diagram?
2. (a) Explain why the discrete histogram equalization technique will not, in
general, yield a flat histogram.
(b) Which filters are used for blessing & for noise reduction? Explain?
3. (a) Explain about degradation model?
(b) Explain about Weiner filters?
4. (a) Explain about the procedure for converting from HIS to RGB.
(b) What is meant by intensity slicing? Explain?
5. (a) Draw the general compression system model & Explain?
(b) Explain about Coding Redundancy?
6. An alternative definition of dialation is
A + B = { c z2 / c= a + b, for some a A & b B }
(a) Show that this definition & the original definition of dialation equation
are equivalent.
(b) Show also that this definition is equivalent to yet another definition of
dialation
A + B = U (A)b
(c) Compare between dialation and erosion.
7. (a) Differentiate between Global Processing & local processing?
(b) Explain about Optimal Thresholding?
8. Discuss about the following?
(a) Minimum distance classifier.
(b) Matching by correlation.
(c) Back Propagation
1 of 1
Code No: M1203
Set No. 2
Code No:
IV B.Tech I Semester Regular Examinations, November 2009
IMAGE PROCESSING
(Information Technology)
Time: 3 hours Max Marks: 80
Answers any Five Questions
All Questions carry equal marks
*****
1. Explain about the components of Image Processing system?
2. (a) Explain about Sharpening Filters.
(b) Explain about Histogram equalization.
3. (a) Explain about degradation model?
(b) How geometric Transformations are useful for image restoration?
Explain?
4. Explain about the two major areas for colour image processing? Among these two
areas which is used for most of the applications? Why?
5. What are different principal error-free compression strategies currently un use?
Explain with example?
6. An alternative definition of erosion is
A
B = { c z2 / c + b A, for every b B }
(a) Show that this definition is equivalent to the original definition of erosion
equation.
(b) Show also that this definition is equivalent to yet another definition of
erosion A
B = U (A)-b
7. (a) How edge detection is done by derivative operators? Explain?
(b) Explain about Global Processing using Hough Transform?
8. Discuss about the following?
(a) String Matching.
(b) Matching Shape Numbers.
(c) Multilayer feed forward neural Networks.
1 of 1
Code No: M1203
Set No. 3
Code No:
IV B.Tech I Semester Regular Examinations, November 2009
IMAGE PROCESSING
(Information Technology)
Time: 3 hours Max Marks: 80
Answers any Five Questions
All Questions carry equal marks
*****
1. (a) Differentiate between uniform sampling & Non-uniform sampling?
(b) Explain about different fields that use Digital image Processing.
2. (a) Explain about Histogram Specification.
(b) Which filters are used for blurring & for noise reduction? Explain ?
3. (a) Write short notes on Fourier transform.
(b) Explain about least mean SQUARE filter?
4. (a) What are different color models? Explain?
(b) What is meant by Luminance, brightness, Radiance & trichromati
Coefficients.
5. (a) Explain about Lossy Predictive Coding?
(b) Explain about inter-pixel Redundancy?
6. (a) Differentiate between Thinning & Thickening.
(b) What is meant by Dilation and Erosion? Explain?
7. (a) Explain about Global Processing using Graph Theoretic Techniques.
(b) What is meant by optimal Thresholding? Explain?
8. Discuss about the following?
(a) Neural Networks.
(b) Optimum Statistical Classifier.
(c) Structural Methods.
1 of 1
Code No: M1203
Set No. 4
Code No:
IV B.Tech I Semester Regular Examinations, November 2009
IMAGE PROCESSING
(Information Technology)
Time: 3 hours Max Marks: 80
Answers any Five Questions
All Questions carry equal marks
*****
1. Consider the two image subsets S1 & S2 shown below.
_ _ _ _ _ _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
For V= {1}, determine whether S1 & S2 are (a) 4 connected,(b) 8 - Connected, or
(c) m connected.
2. (a) Explain why the discrete histogram equalization technique will not, in general,
yield a flat histogram.
(b) Explain about Smoothing filters.
3. (a) Write short notes on Fourier transform.
(b) Explain about Constrained least SQUARES restoration?
4. (a) Explain about the Procedure for Converting RGB to HSI.
(b) Explain about pseudo-color image processing?
5. What is meant by data redundancy? Explain about three basic data redundancies?
6. (a) Explain about Pruning method?
(b) Discuss about HitorMiss Transform?
7. (a) Explain about Region Growing by Pixel Aggregation.
(b) What is meant by Region Splitting & Merging? Explain with example.
8. Discuss about the following?
(a) Minimum distance classifier.
(b) Matching by correlation.
(c) Back Propagation
1 of 1
| Earning: Approval pending. |
