Tracking and Detection in Computer Vision
This module handbook serves to describe contents, learning outcome, methods and examination type as well as linking to current dates for courses and module examination in the respective sections.
Module version of SS 2015 (current)
There are historic module descriptions of this module. A module description is valid until replaced by a newer one.
|available module versions|
|SS 2015||WS 2011/2|
IN2210 is a semester module in English language at Bachelor’s level and Master’s level which is offered in winter semester.
This Module is included in the following catalogues within the study programs in physics.
- Catalogue of non-physics elective courses
|Total workload||Contact hours||Credits (ECTS)|
|210 h||90 h||7 CP|
Content, Learning Outcome and Preconditions
This is not only evident by a growing and highly competitive research community with a high impact factor in computer science, but also by the emergence of numerous vision companies turning research ideas into a myriad of commercial applications. Besides well-known studies of 3D geometry and camera models, object tracking and detection in images and videos becomes one of the principal research directions of modern Computer Vision. The main objective of this course is to provide students with a gradual introduction to modern tracking, detection and recognition techniques developed in the last years. The course will provide in-depth knowledge of image features, their detection and description, matching techniques, key-point recognition, basic and advanced tracking algorithms based on image features and image intensities, basics of probabilistic and machine learning methods for tracking and object detection. Note that every year the course content is refreshed with new the most promising and potentially the most influential works in the field.
The following topics will be handled
- Introduction (overview of the course)
- Convolution and filtering:
-- Basic of image formation
-- Convolution and correlation
-- Non-linear filtering
-- Gaussian Filtering
-- Image Derivatives
-- Edge Detection
- Local invariant feature detectors:
-- Harris corner
-- Harris Laplace/Affine
-- Hessian, Hessian-Laplace/Affine
- Feature descriptors:
-- Difference of Gaussians and SIFT
-- Integral images and SURF
-- Histogram of Oriented Gradients (HOG)
- Keypoint recognition:
-- Randomized trees
-- Keypoint signatures
- Face detection
-- Haar features
-- Viola-Jones Face Detection
- Camera models and projections
-- Model based tracking
-- Pose estimation from 2D-3D coresspondencies (DLT, P-n-P)
-- Rotation parametrization
- Non-linear optimisation
-- Robust estimators
- Template tracking methods:
-- Compositional Alg.
-- Inverse Compositional
-- Linear Predictor
- Mean-shift tracking
-- mean-shift for pdf estimation
-- mean-shift for segmentation
-- mean-shift for object tracking
- Template matching approaches
-- basic correlation methods (SAD, NCC etc.)
-- DOT(Dominant Orientation Template)
-- LineMod (LINEarizing the memory multiMODal template matching)
- Kalman and particle filtering
-- basics Kalman filer
-- basics Particle filer
-- applications to visual tracking
-- applications to camera tracking
- Tracking with Dictionary Learning
Courses, Learning and Teaching Methods and Literature
Courses and Schedule
|VI||6||Tracking and Detection in Computer Vision (IN2210)||Bui, L. Ilic, S.||
Thu, 14:00–16:00, MI 01.05.012
Thu, 14:00–16:00, MI 03.09.012
Thu, 14:00–16:00, MI 03.11.018
Mon, 14:00–16:00, MI 00.13.009A
Thu, 14:00–16:00, MI 00.13.009A
Learning and Teaching Methods
- accompanied scientific papers and book excerpts
- Computer Vision: a modern approach" by David Forsyth and Jean Ponce
- Computer Vision: Algorithms and Applications, Rick Szeliski
Description of exams and course work
Mid-term exam is planed after 6 lectures and it is written exam. The final exam takes place at the end of the lectures and it also takes the form of written test. Questions allow to assess acquaintance with concepts thought at the lectures and exercises, small calculation tasks and pseudo codes of the algorithmic solutions.
Programming tasks are not part of the examinations.
For the midterm exam, nothing but your pens and your calculators are allowed.
For the final exam, nothing but your pens, your calculators and one DIN A4 page (handwritten, front and back side) with notes are allowed.
Bonus points can be earned from the homework projects and the intermediate exam.
The final exam brings maximally 100 points. You need to have 50 points in order to pass it. Bonus points are irrelevant for the 50-points-hurdle and are added afterwards to your final exam score.