ECE611 Pattern Recognition and Classification L T P C

3 0 0 3
Version No: 1.00
Prerequisite: -

Objectives:
 To know about the basics of pattern recognition
 To introduce the student to pattern recognition and classification techniques.
 To learn about different estimation methods
 To study about classification methods.

Expected Outcome
 Learn the basics of pattern recognition
 Understanding the pattern recognition and classifying methods
 Learning different estimation methodologies

Unit I 9 hours
Basics of pattern recognition: Bayesian decision theory, Classifiers, Discriminant functions,
Decision surfaces, Normal density and discriminant functions, Discrete features

Unit II 8 hours
Parameter estimation methods: Maximum, Likelihood estimation, Gaussian mixture models,
Expectation, maximization method Bayesian estimation

Unit III 10 hours

Hidden Markov models for sequential pattern classification: Discrete hidden Markov
models, Continuous density hidden Markov models.

Unit IV 8 hours
Dimension reduction methods: Fisher discriminant analysis, Principal component analysis
Non-parametric techniques for density estimation: Parzen window method, K-Nearest
Neighbor method.

Unit V 10 hours
Linear discriminant function based classifiers: Perceptron, Support vector machines, Non-
metric methods for pattern classification , Non-numeric data or nominal data , Decision trees
Unsupervised learning and clustering: Criterion functions for clustering, Algorithms for
clustering: K-means, Hierarchical and other methods, Cluster validation.

Reference Books
1. R.O. Duda, P.E. Hart and D.G. Stork, Pattern Classification, John Wiley, 2001.
2. S. Theodoridis and K.Koutroumbas, Pattern Recognition, 4th Ed., Academic Press, 2009.
3. C.M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006.

Mode of Evaluation: Assignments/Term-end/Projects.

Proceedings of the 29th Academic Council [26.4.2013] 228