- Instructor: Prof.
- CRN: 48412
- Meeting Times: Th 05:50 - 08:45 PM, Fall 2002
- Place: Miller M12
- Textbook: Pattern
Classification (2nd. Edition) by Duda, Hart and
Pattern Recognition techniques are useful in many applications of
computer science and information systems, such as information retrieval,
mining, artificial intelligence and image processing. This course is
an introduction to the foundation of pattern recognition
Topics to be studied: data structures for pattern representation,
feature extraction and selection, parametric and non-parametric
classification, supervised and non-supervised learning, clustering,
decision trees, nearest neighbor, artificial neural networks
and hidden Markov models. Applications of
various classification techniques will be demonstrated by several
on-going handwriting, graphics, and speech recognition projects.
- Prerequisites: CS242 Data
Structures and Algorithms II, No previous background
in Pattern Recognition required.
- Lecture Notes: can be accessed using the http://blackboard.pace.edu
Blackboard Login Procedures for Registered Students are available
- Project: click here.
||Ch 2 Bayes Decision Theory & Text categorization |
||Ch 8 Nonmetric Methods (Decision Tree)
||Ch 8 Nonmetric Methods (Nearest Neighbor & Matching)|
Signature Verification, Prj Proposal
||Image Processing, Indexing, & Retrieval|
||Image Analysis & Biometric Authentication, HW 1
||NLP algorithm & Speech recognition|
||Ch 5 Linear Discriminant Functions, HW 2
||Ch 6 Neural Networks|
||Ch 7 Evolutionary Methods (GA & GP)|
|| Ch 10 Unsupervised Learning & Clustering, HW 3
||Thanx giving break |
||Presentation, Prj rpt
- Project (50%): Students are required to implement
one pattern recognition application, e.g., handwriting,
graphics or speech recognition system (Presentation required.)
- Homeworks (30%):There will be three homeworks.
- Final Report on your project (20%):