TeachingWs16TDCV

Chair for Computer Aided Medical Procedures & Augmented Reality
Lehrstuhl für Informatikanwendungen in der Medizin & Augmented Reality

Tracking and Detection in Computer Vision - Winter Term 2016/17

Administrative Info

Lecture by Dr. Slobodan Ilic
Exercises by: Mira Slavcheva, Tolga Birdal

Type: Lecture Module IN2210
Programs: Informatics (Bachelor, Master)
Biomedical Computing (Master)
Robotics, Cognition, Intelligence(Master)
SWS: 2+4
ECTS: 7 Credits
Course Language: English

Time, Location & Requirements

Lectures: every Monday from 24.10.2016 at 12:15-14:00h in 00.13.009a.

Exercises: every Thursday from 20.10.2016 at 12:00-14:00h in 00.13.009a.

Consultation hours: Office of the responsible tutor (see names next to the exercise).

Requirements:

  • The classes and exams are in English.
  • 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.
  • There is no repetition exam.

Contents

Overview

Computer Vision, as a relatively young research area, has emerged as a key discipline in computer science. 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 structure from motion and bundle adjustment, synchronous localization and mapping algorithms as well as object detection using classification approaches. In the end, the students will have a thorough description of the most important tracking and detection techniques. They should be able to understand and implement those solutions and apply them in reasonably complex problems. The concepts described in this course will be accompanied with brief explanations of the necessary mathematical tools. The participants of this course will be given an important basis to follow the vast and growing Computer Vision literature and use the acquired knowledge to solve new practical problems.

Who should attend this course?

Bachelor students in their last years and all Master students that are interested in learning about the modern and well-established concepts and algorithms related to tracking, detection and recognition in Computer Vision, or desire to use those techniques in their research.

Prerequisites: Most of the knowledge required should be part of the normal background in Computer Science, undergraduate/graduate Mathematics and Geometry.

Announcements

The grades have been finalized. Please send us an email by the evening of 10.03. if the update you got in the exam inspection has not been applied correctly. We will transfer the grades to TUMonline at the beginning of next week.


The exam inspection is going to be on Wednesday, 8 March, 11:00-12:30 in room 03.13.036. If you cannot make it then, we offer an additional session on Thursday, 2 March, 11:00-12:30 (please come to this session only if you cannot attend the other one).

The summary of bonus points achieved this semester is available here. Please email us in case you are missing from the list or you suspect that your points have been miscalculated.

If you have questions regarding the course material, you can come by 03.13.036 on Thursday, 16.02., 13:00 - 15:00, or send an email to tdcv.tum@gmail.com.


The MIDTERM RESULTS are now available. Only matriculation numbers and scores are shown smile The overall point distribution is shown on this plot.
You can have a look at your exam during the midterm exam inspection which is going to take place on Thursday, 19.01.2017, 14:00-15:00 (after the exercise session) in the CAMP seminar room (03.13.10).
If you missed the exam inspection, you can come by 03.13.36 on Monday, 23.01.2017, between 11:30 and 12:15.

The current list of registered exercise groups is available here (last update: 30.11., 19:00).

The final exam is going to take place on 18.02.2017 at 9:00 in Hörsaal 1.

Exercises

Exercise FAQ

The exercises will be done in MATLAB and students are expected to do them on their own computer/laptop. In case you do not have your own laptop please let us know by sending an e-mail to: tdcv.tum@gmail.com.

You can also find a short MATLAB tutorial here.

Registration

You are required to register via TUMOnline (link)!

Homework

Students will be given one week to solve the problems. The exact due dates for each homework are announced next to the exercises on this website and will be mentioned during the exercise sessions. Students have to make groups of TWO students and send the names to tdcv.tum@gmail.com. After that, those who didn't create groups will be associated to groups based on a random selection and will receive a notification about this. If you are looking for a (TDCV) partner tell us and we will assign you one!

During the checking of the exercises each group will have at 15 min to be questioned to answer the questions. All members of the group will be questioned about the algorithms and their implementation, so only those who can prove that they understood both theory and practice will get the respective points. Thus, having a working exercise doesn't mean that everyone in the group is going to get full points. Please note that only exercises which work might get the maximal number of points. There will be no "debugging-correcting"-sessions for your solutions during the exercise reviews! If you have questions, ask them beforehand by either mail or in person.

All homework should be submitted through e-mail at least one hour before the exercise session with the following format and information.

  1. To: tdcv.tum@gmail.com
  2. Subject: [TDCV16] Exer<exercise number> - <last names of all members>
    For example: [TDCV16] Exer1 - Huang, Tan
  3. Attachment: The whole source code for this homework.
  4. Body: This should include the (a) full names and Matrikel-Nr. of each member; and, (b) reference to any code used in the homework that is not specified on the exercise sheet or by the tutors.

Textbooks

For some basic concepts the textbook "Computer Vision: a modern approach" by David Forsyth and Jean Ponce can be used. Also, most topics can be found in a new book of Rick Szeliski from Microsoft Research, available also on-line. However, since the majority of the topics is state-of-the-art, students will be referred to the relevant publications which will be provided during the course and can be regarded as additional lecture notes.

Lecture Schedule and Content

Date Topic Conducted by Material/Literature
Do 20.10.2016 12:15 - 14:00 Introduction Dr. S. Ilic Introduction
Mo 24.10.2016 12:15 - 14:00 Convolution, Non-linear filtering, Gaussian filtering, Image derivatives, Edge detection Dr. S. Ilic Filtering and Edge Detection
Mo 31.10.2016 12:15 - 14:00 Local invariant feature detectors: Harris corner, Harris Laplace/Affine, Hessian, Hessian-Laplace/Affine, FAST Mira Slavcheva Feature Detection
Related papers:
1. Feature detectors
2. Harris-Laplace
Mo 07.11.2016 12:15 - 14:00 Feature descriptors: Difference of Gaussians and SIFT, Integral images and SURF, Histogram of oriented gradients Tolga Birdal Feature descriptors
Related papers:
1. SIFT
2. SURF
3. HOG
Mo 14.11.2016 12:15 - 14:00 Keypoint recognition: Randomized and regression trees, FERNS, Hough forests Dr. S. Ilic Keypoint recognition
Mo 21.11.2016 12:15 - 14:00 Camera models, Model based tracking, Pose estimation from 2D-3D coresspondencies (DLT, P-n-P), Rotation parametrization Dr. S. Ilic Camera models and pose estimation
Related paper:
1. Monocular Model-Based 3D Tracking of Rigid Objects: A Survey.
Mo 28.11.2016 18:30 - 20:00 MIDTERM EXAM (room MW 1801, Ernst-Schmidt-Hörsaal (5508.01.801)) Dr. S. Ilic  
Mo 05.12.2016 12:15 - 14:00 Non-linear optimization, Robust estimators, RANSAC Dr. S. Ilic Non-linear optimization, Robust estimators, Ransac
Mo 12.12.2016 12:15 - 14:00 Feature learning and Classification with Deep neural networks Dr. S. Ilic Deep Neural Networks
Mo 09.01.2017 12:15 - 14:00 Haar features, Ada-boost, Viola-Jones face detection Dr. S. Ilic Face Detection
Mo 16.01.2017 12:15 - 14:00 Template tracking methods: Lucas-Kanade, Compositional alg., Inverse compositional, ESM, Linear predictor Dr. S. Ilic Template Tracking
Mo 23.01.2017 12:15 - 14:00 Mean-shift tracking Dr. S. Ilic Mean-shift Tracking
Mo 30.01.2017 12:15 - 14:00   Dr. S. Ilic CANCELED
Mo 06.02.2017 12:15 - 14:00 Template matching approaches Dr. S. Ilic Template Matching

Exercise Schedule

If you have questions about a specific exercise, please direct them to the responsible tutor.

Date Topic Conducted by Material/Literature Sample Output
Do 27.10.2016 12:00 - 14:00 Matlab Introduction/Convolution, Gaussian Filtering, Image Derivatives (due: 03.11.) Paul & Mira Exercise01
Lena.gif
Sample Output 1
Sample Output 2
Sample Output 3
Do 03.11.2016 12:00 - 14:00 Harris, Harris-Laplace (due: 10.11.) Wadim Exercise02
house.tif
checkerboard_tunnel.png
test.pgm
sample2.jpg
Sample Output 1
Sample Output 2
Sample Output 3
Sample Output 4
Do 10.11.2016 12:00 - 14:00 Textured and texture-less object detection with SIFT and HOG (due: 17.11.) Tolga Exercise03
Files
 
Do 17.11.2016 12:00 - 14:00 Random forests (due: 01.12.) Paul Exercise04
Files
Slides
Sample Output
Do 01.12.2016 12:00 - 14:00 Sift, Dlt, Ransac, Image Stiching (due: 08.12.) Mira Exercise05
Files
Sample Output 1
Sample Output 2
Do 08.12.2016 12:00 - 14:00 Non-linear optimization (due: 15.12.) Mira Exercise06
Image Sequence
Slides and Sample Output
Do 15.12.2016 12:00 - 14:00 Feature learning and Classification with Deep neural networks (due: 12.01.) Nikolas & Sergey Exercise07 (updated)
NN_templates.zip
trained_autoencoder.zip
Do 12.01.2017 12:00 - 14:00 Ada-boost classification (due: 19.01.) Nikolas Exercise08
Data
Sample Outputs
Do 19.01.2017 12:00 - 14:00 Template tracking with linear predictor (due: 26.01.) Tolga Exercise09
Data
For more details, see section 3 of:
Online Learning of Linear Predictors for Real-Time Tracking. The image sequences also contain the sample output.
Do 26.01.2017 12:00 - 14:00 Mean-shift tracking (due: 02.02.) Haowen Exercise10
Data
 
Do 02.02.2017 12:00 - 14:00 Template matching (due: 09.02.) Wadim Exercise11 Sample Output
Do 09.02.2017 12:00 - 14:00 Template matching corrections - - -

TeachingForm
Title: Tracking and Detection in Computer Vision
Professor: Dr. Slobodan Ilic
Tutors:  
Type: Lecture
Information: 2 + 4; 7 ECTS
Term: 2016WiSe
Abstract:  


Edit | Attach | Refresh | Diffs | More | Revision r1.69 - 08 Mar 2017 - 14:50 - MiraSlavcheva

Lehrstuhl für Computer Aided Medical Procedures & Augmented Reality    rss.gif