ECE 568 Pattern Classification
Classification models, discriminant functions, decision surfaces, generalized linear discriminant functions, parameter estimation, problems of dimensionality, component analysis, Fisher discriminant analysis, hidden Markov models, nearest neighbor rules, classification trees, string matching, resampling for classifier design and evaluation, clustering algorithms, projects.
Credit Hours: 3 Lecture
Prerequisites: Consent of instructor
Course Coordinator:
Lalit Gupta
Textbooks:
R.O. Duda, P.E. Hart, & D.G. Stork, Pattern Classification, John Wiley & Sons, 2001.
References:
Journal Papers.
Goals:
To introduce graduate students to the major topics in pattern classification and applications in automatic target recognition, human-computer interfacing, biometric identification, bioinformatics, biomedical signal classification, and industrial inspection.
Projects:
Multidimensional data generation, distance measures, decision surfaces.
Principal component analysis and Fisher linear discriminant analysis.
Nearest neighbor and nearest mean classification.
Hidden Markov models and dynamic time warping.
Resampling for classifier design and performance evaluation.
Clustering algorithms.
Computer Tools: Matlab
Last Review: Spring Semester 2004
|