Computer Science & Engineering Department


CS 479/679 Pattern Recognition (Spring 2006)


Make-up classes:
  • Friday April 21th: 2:00-3:15, same room
  • Friday April 28th: 1:00-2:15, same room

  • Meets: TR 11:00 - 12:15 (SEM 261)

  • Instructor: Dr. George Bebis

  • Text:

  • Optional Texts (not required):

  • Useful Links

  • Some useful software:


    Course Description

    This course will introduce the fundamentals of statistical pattern recognition with examples from several application areas. Techniques for handling multidimensional data of various types and scales along with algorithms for clustering and classifying data will be explained. This is an advanced level course suited for graduate students in Computer Science and Engineering. It is primarily intended for highly motivated graduate students who are interested in doing research in the areas of Pattern Recognition, Neural Networks and Computer Vision. There are many open problems in this areas suitable for investigation by Master's or Ph.D. students, leading to a professional paper, thesis, or dissertation.


    Course Outline (tentative)

  • Introduction (Chapter 1)
  • Bayesian decision theory (Chapter 2)
  • Maximum likelihood and Bayesian estimation (Chapter 3)
  • Non-parametric techniques (Chapter 4)
  • Linear discriminant functions (Selected Topics from Chapter 5)
  • Multilayer neural networks (Selected Topics from Chapter 6)
  • Stochastic Methods (Selected Topics from Chapter 7)
  • Algorithm-Independent Machine Learning (Selected Topics from Chapter 9)
  • Unsupervused Learning and Clustering (Selected Topics from Chapter 10)


    Course Prerequisites

    Probability & Statistics (MATH 352). Strong programming skills (i.e., CS202, CS302) math skills (MATH 181, MATH 182), and linear algebra (MATH 330). Courses on image processing, computer vision, and machine learning would be helpful but not required. Credit hours: 3.0

    Exams and Assignments

    Grading will be based on two exams, homework assignments, programming assignments, and a paper presentation. Specifically, there will be a midterm and a final exam. The material covered by the exams will be drawn from the material covered in class and the homework. Both exams will be closed books, closed notes. Homework problems will be assigned on a regular basis and will be collected at the beginning of the class on the due date. Also, there will be several programming assignments. Finally, each student will be also required to present a paper to the rest of the class. The topic of the paper should be related to the application of a pattern recognition technique (i.e., preferably among those discussed in class but not exclusive) to a computer vision problem. Each presentation should be professional as if it was presented in a formal conference (i.e., slides/projector).

    Late homework and/or programming assignments will not be accepted. If you are unable to hand in an assignment by the deadline, you must discuss it with me before the deadline. If you are unable to attend an exam you must inform me in advance. A missed exam may be made up only if it was missed due to an extreme emergency. Please, note that good programming skills and a lot of motivation would be essential in order to complete the programming assignments.


    Disability Statement

    Any student with a disability needing academic accommodations is requested to speak with me or contact the Disability Resource Center (Thompson Building, Suite 101), as soon as possible to arrange for appropriate accommodations.


    Syllabus


    Exam Related Material


    Useful Material


    Lectures and Reading Assignments


    Homework Assignments



    Programming Assignments



    Papers for Student Presentations




    Department of Computer Science and Engineering, University of Nevada, Reno, NV 89557
    Page created and maintained by: Dr. George Bebis (bebis@cs.unr.edu)