Ex/CP 42D/25/2006

B.C.S.E. FINAL YEAR EXAMINATION, 2006

(Second Semester)

Pattern Recognition & Image Processing

Time : 3 hours Answer question no.l and any four from the rest All questions carry equal marks 1. Answer true or false stating reasons 210 = 20 Full marks : 100

(a) The method of pattern classification by distance functions can be expected to yield practical and satisfactory results when the patterns are linearly separable. (b) Minimum distance classifiers are nothing but a special case of linear classifiers. (c) K-means algorithm uses an objective function based on the average squared distances between samples in different cluster domains. (d) Clustering based on a non-metric similarity function (which is the cosine of the angle between a pattern vector x and its prototype z) is suitable when the data exhibit characteristic pockets, which are relatively far from each other. (e) It is always possible to visualize the result of a clustering algorithm. (f) The slope of the ramp based on the gray-level profile of a horizontal line through an edge of an image is directly proportional to the degree of blurring in the edge. (g) Genetic Algorithms are usually employed as a supervised pattern classifier. (h) Morphological processing of an image is usually governed by the output of image segmentation. (i) Hopfield network is usually employed for data coding. (j) Image restoration is based on human subjective preferences regarding what constitutes a good image.

2. (a)

Consider prototype utilizing

M the

pattern distance

classes of

and

assume Derive vectors

that the from

these their

classes of prototype

are

represented

by

patterns

Z1,Z2,...,ZM. pattern

expression

decision patterns.

function Show that 12

such a decision function is a linear one.

(b)

How the above-mentioned decision function gets characterized by several prototypes. Comment boundaries needed in this case.

modified when each pattern is on the nature of decision 8

3. (a) For the following three pattern classes 1,2 and 3 in 2 compute the decision boundaries and decision rules that are needed to successfully classify all the patterns from the said three classes. 10

(b) State some of the clustering criteria that are employed in partitional clustering.

(c) What are the factors that affect the performance of a clustering algorithm that is based on minimization of squared Euclidean distance classifier concept? Comment on some of the limitations of such a clustering method. 6

4 (a) What is genetic algorithms? How can it be useful in solving some problems of PR? 2 + 4 (b) Describe briefly one method of partitional clustering using GAs. 14

5. (a) Describe briefly the various features of a typical ANN.

(b) Suppose that two pattern classes are linearly separable. Describe a method using a suitable ANN that can successfully classify the said two patterns classes. 12

6.

(a) Consider an image function fC(x,y) (where x[xmin, xmax] and y[ymin,ymax] which very in a continuum given by the respective intervals. The values taken by the image function are real numbers which again vary in a continuum such that fc(x, y) [fmin, fmax]. Narrate the steps necessary to convert the said image into a digital image having a given number (P) of gray levels and resolution (N M). 8 (b) Describe briefly how masking can be employed to detect the edges present in a digital image. Comment on the performance of such a method when the given image is corrupted by noise. 12

7.

Write short notes on any two of the following. (a) Morphological processing of a digital image (b) Isodata algorithm (c) Evaluation of clustering results

210