Chengjiang Long 龙成江[CV]

Ph.D.
Computer Vision Researcher/Senior R&D Engineer at Kitware Inc.
Adjunct Professor at Rensselaer Polytechnic Institute (RPI)

Email: chengjiang.long@kitware.com




 

Description: picture










 

ECSE-6110 Pattern Recognition

Term: Spring 2018 
Instructor:
Dr. Chengjiang Long
Time:
Tuesday and Friday, 2:00pm – 3:20pm
Building/Room: JEC 4107 
Office Hour
: Tuesday and Friday 3:20pm—4:00pm by appointment
Office Hour Location: JEC 6045
Course Assistant
: II-Young Son
Course Website
: www.chengjianglong.com/teachings.html

Course Overview:
This course will give an introduction to the large and diverse field of pattern recognition. Topics include Introduction to Pattern Recognition, Probability theory and Linear algebra review, Basic graph concepts and Belief Network, Bayesian decision theory, Maximum-likelihood estimation, Bayesian methods, Nonparametric techniques, Principal Component Analysis, Fisher Discrimination, Linear models for regression, Linear models for classification and support vector machines, Bagging, Random Forests and Boosting, Introduction to Neural Networks and Multilayer Neural Network, Introduction to deep learning: Deep Feedforward Network and Convolutional Neural Network, Unsupervised Learning and clustering. On completion of the course, students should be sufficiently familiar with the formal theoretical structure, notation, and vocabulary of pattern recognition to be able to read and understand current technical literature. They will also have experience in the design and implementation of pattern recognition systems and be able to use those methods to program and solve practical problems.

Prerequisites:
Basic probability and statistics, some linear algebra, basic programming skills. Working familiarity with Matlab, Python, Java or C/C++ will be expected.  

Text Books:
Rechard O. Duda, Peter E. Hart, and David G. Stork, “ Pattern Classification”, 2nd Edition, John Wiley, 2001. 

Auxiliary Text Books:
Trevor Hastie, Robert Tibshirani and Jerome Friedman, “ The Elements of Statistical Learning”, 2nd Edition, Springer, 2009. 
David Barber, “ Bayesian Reasoning and Machine Learning”, Cambridge University Press, 2012. 
Ian Goodfellow and Yoshua Beio and Aaron Courville, “ Deep Learning”, MIT Press, 2016. 

Grading:
The students will be graded based on course participation (5%), four homework assignments (20%, some of them need programming), a midterm exam (20%), a final exam (20%), and a final project/presentation (35%). Final grade: A-- 90% to 100%; B--80% to 89%; C-- 60% to 79%; F -- < 60%. 

Late submission policy:
Exponential penalty -- late for one day loses half, two day loses another half of the remaining, and so on and so forth. 

Topics:

  • Introduction to Pattern Recognition.
  • Probability theory and Linear algebra review.
  • Basic graph concepts and Belief Network.
  • Bayesian decision theory.
  • Maximum-likelihood estimation.
  • Bayesian methods.
  • Nonparametric techniques.
  • Dimension reduction: Principal Component Analysis;
  • Fisher Discrimination.
  • Linear models for regression.
  • Linear models for classification and support vector machines.
  • Bagging, Random Forests and Boosting.
  • Introduction to Neural Networks and Multilayer Neural Network
  • Introduction to deep learning: Deep Feedforward Network and Convolutional Neural Network.
  • Unsupervised learning and clustering.


Course schedule:

ClassDateTopicReadingHomework/ProjectSlides
01/16/2018Short class
11/19/2018Introduction to Pattern RecognitionDuda Ch 1Lecture_1
21/23/2018Probability theory and Linear algebra reviewDuda Ch 2Lecture_2
31/26/2018Bayesian decision theoryDuda Ch 2.3-4Lecture_3
41/30/2018Bayesian decision theory and Max Likelihood EstimationDuda Ch 2.5-6, 3.1-2, Barber Ch 8Lecture_4
52/2/2018 Bayesian Esitmation Methods and Naive Bayes ClassifierDuda Ch 3.3-5, Barber Ch 13HW 1 assignedLecture_5
62/6/2018Non-Parametric Methods – Parzen EstimationDuda Ch 4.1-3Lecture_6
72/9/2018Non-Parametric Methods – KNNDuda Ch 4.4-5HW 1 dueLecture_7
82/13/2018Dimensionality – PCA and Fisher DiscriminationDuda Ch 3.7-8, Barber Ch 15-16HW 2 assignedLecture_8
92/16/2018Linear Discriminant Functions (1)Duda Ch 5.1-2, Barber Ch 17Lecture_9
102/20/2018Linear Discriminant Functions (2)Duda Ch 5.3-4, Barber Ch 17, HTF Ch 12HW3 assigned, HW2 due
112/23/2018Perceptron Classification and LearningDuda Ch 5.5-7, HTF Ch 4
122/27/2018Minimum Squared-Error ClassificationDuda Ch 5.8-9HW3 due
133/2/2018Bagging; Random Forests; Boosting (1)HTF Ch. 10 and 15
143/6/2018Bagging; Random Forests; Boosting (2)HTF Ch. 10 and 15
153/9/2018Midterm examMidterm exam
3/13/2018Spring break
3/16/2018Spring break
163/20/2018Presentation of Project Proposals to ClassFinal Project Proposal
173/23/2018Basic graph concepts and Belief NetworkDuda Ch. 2.5-6, 3.10
183/27/2018Introduction to Nueral NetworksDuda Ch 6.1
193/30/2018Multilayer Neural NetworksDuda Ch 6.2
204/3/2018Multilayer Neural Networks: BackpropagationDuda Ch 6.3-4
214/6/2018Multilayer Neural Networks: ImplementationDuda Ch 6.5-8
224/10/2018Introduction to Deep Feedforward NeworkIan Ch 6
234/13/2018Introduction to Regularization and OptimizationIan Ch 7-8
244/17/2018Introduction to Convolutional Neural NetworkIan Ch 9HW4 assigned
254/20/2018Unsupervised learningDuda Ch 10.1-5, HTF Ch 14
264/24/2018Clustering AlgorithmsDuda Ch 10.6-7HW4 due
274/27/2018Hierarchical and On-line ClusteringDuda Ch 10.9-14
285/1/2018Presentation of Project Reports to ClassFinal Project Presentation
29TBAFinal examFinal exam








Description: Free Hit Counter
© By Chengjiang Long since Mar 21, 2012.