CS 531/ECE 517: Pattern Recognition

Spring 2007

TTr 2:00-3:15

Room: ECE 220


Instructor:

    Joe Michael Kniss
    Ferris 301G
    277-2967
    jmk (at) cs.unm.edu
    Office Hours: TR 3:15-4:15 (in ECE 218)

Info:

    Official class web page:
    www.cs.unm.edu/~jmk/cs531
    Class Blog:
    unm-cs531.blogspot.com

Text:

    Duda, Hart, and Stork.
    Pattern Classification, 2nd edition
    Wiley-Interscience, ISBN-10: 0471056693, ISBN-13: 978-0471056690
    Amazon link
    Errata, PDFs (by printing): Printings 1 and 2, 1and2-Section 2.11 Revision, Printings 3 and 4, Printing 5, Printing 6, Printing 7, Printing 8

Course Objectives

    This course covers the fundamentals of Pattern Recognition and Classification primarily from a statististical point of view. Students will learn a variety of strategies for feature space and classifier selection, and gain exposure to a wide range of problems. Topics include Bayesian methods, parametric and nonparametric models, Markov models, kernel methods, and surveys of modern/research approaches.

Grading

    Homework: 35%
    Tests: 35%
    Projects: 20%
    Participation: 10%

Homework

Homework is to be delivered electronically, via email. Please be sure to have the words CS 531 or ECE 517 and Homework # in the email.

Policies

  1. This is a graduate level class. Students are expected to conduct themselves as adults and professionals. It is the student's responsibility to keep up, ask questions, and keep the instructor informed if something prevents them from doing so.
  2. Attendance   Attendance is the responsibility of the student. I will not be taking role. However, since quizes will cover the reading assinments, regular attendance is required for an A in the class.
  3. Cheating   Cheating will not be tolerated! This includes copying homeworks, plagerisim, sharing information during tests, and use of unapproved packages for homeworks. A first offence will result in a 0 for the assignment/test. Repeat offences will result in an "F" for the class and potential University action.
  4. Late assignments, quizes, or exams will not be accepted without prior approval from the instructor.

Schedule

January
Date
Reading
Assignment
Tues/Thurs 16/18 Chap. 1 and Appendix
Tue 23 Chap 2.1 and 2.2 Problems 1 and 2, Due Jan 30
Thurs 25 Chap 2.3 and 2.4 Problems 3, 12, 13, 14, Due Feb 1
Tue 30 Chap 2.5 and 2.6 Problems 15, 18, 21, 22, 26, 27, Due Feb 6
Thurs Feb 1 Review of Expected Values
Tue 06 Chap 2.7, 2.8, 2.9 Problems 33, 35, 39, 43, 46, Due Feb 15
Thurs 08 Chap 2.10, 2.11, and 2.12 Problems 48, 50, Due Feb 15
Tues 13 Review of Chap 2 and problems
Thurs 15 Review of Chap 2 Computer Problems 1, and 2 Due March 1
Tues 20 TBA
Thurs 22 TEST on Chap 2
Tues 27 Chap 5.1, 5.2, 5.3
Thurs Mar 1 Chap 5.8
Tues 06 Chap 5.5, 5.6. Computer HW 2
Tues 20 Chap 4 (yes all of it)
Tues 27 Chap 5.11 PPT slides, PDF slides
Tues April 3 Chap 5.11 continued Computer HW 3
Thurs April 26 Chapter 8 Computer HW 4
Final Take home Final Exam Due Friday May 11