Warning

B4M33GVG: Annotation Schedule Students

BE4M33GVG: Annotation Schedule Students

# Geometry of Computer Vision and Graphics (Summer 2019)

He who loves practice without theory is like the sailor who boards ship without a rudder and compass and never knows where he may cast. — Leonardo Da Vinci (1452-1519)

And since geometry is the right foundation of all painting, I have decided to teach its rudiments and principles to all youngsters eager for art. — Albrecht Durer (1471-1528)

As for everything else, so for a mathematical theory: beauty can be perceived but not explained. — Arthur Cayley (1821–1895)

## Content

We will explain the basics of Euclidean, Affine and Projective geometry and show how to measure distances and angles in a scene from its images. We will introduce a model of the perspective camera, explain how images change when moving a camera and show how to find the camera pose from images. We will demonstrate the theory in practical tasks of panorama construction, finding the camera pose, adding a virtual object to a real scene and reconstructing a 3D model of a scene from its images. We will be building on our previous knowledge of Linear algebra and will provide fundamentals of geometry for computer vision, computer graphics, image processing and object recognition.

## Lectures: Monday 12:45-14:15, KN:E-127

Lecturers: Tomas Pajdla, Martin Matoušek, Petr Olšák

WeekDateContent
01 18.2. MM: Intro: Geometry of CV & G, LA L[2.1], image coordinate system L[5]
02 25.2. TP: Mathematical model of the perspective camera L[6]
03 04.3. PO: Camera calibration L[7] and pose L[4], (PO)
04 11.3. TP: Calibrated camera pose computation I L[7.2, 7.3]
05 18.3. PO: Calibrated camera pose computation II L[7.3-par.38], vector product L[2.2], (PO)
06 25.3. TP: Homography L[8], affine space L[3]
07 01.4. PO: Projective plane L[9]
08 08.4. TP: Camera calibration from vanishing points L[11]
09 17.4. TP: Dual space L[2.3]
10 22.4. Easter Monday
11 29.4. PO: Epipolar geometry L[12.1-12.3], (PO)
12 06.5. PO: 3D reconstruction with a calibrated camera L[12.4]
13 13.5. Calibrated camera motion computation L[12.5], SVD L[2.3]

## Exercises: Monday 14:30-16:00 in KN:E-230

Teachers: Martin Matoušek, Stanislav Steidl, Petr Olšák

Details about exercises (technical content and assessment) are in the separate section Labs.

## Assessment (zápočet)

1. All home works must be submitted and accepted (0 in the column ~HW)
2. At least 50% of points in total from the home works (at least 0.5 in the column HW).
3. At least 50% of points in total from the tests (at least 0.5 in the column T).
4. Regular submission of home works ends on May 27, 2019. Later submissions are possible only by agreement with teaching assistants.
5. All the above conditions have to be fulfilled and the results have to be recorded in the Submission system before coming to the exam.

## Exam

The exam consists of a written and an oral part.

1. It is required to achieve at least 50% of points from the written part of the exam to be admitted to the oral part of the exam.
2. The final grade depends on the exam (40%), tests (30%), and home works (30%) as given below (Actual weights of individual home works and tests may be set according to their relative difficulty).
3. Lack of understanding of fundamental principles and concepts may lead to Fail grade independently from the number of points achieved.

Points P a are calculated as

P = 100*(0.3*H/(9*5) + 0.3*T/(3*10) + 0.4*(0.5*we + 0.5*oe))

where H and T are points for home works and tests, and we and oe are success rates for oral exam and written exam, respectively. The grade is given by the points P and the table below.

A (Excellent) >= 90
B (Very good) [80,90)
C (Good) [70,80)
D (Satisfactory)[60,60)
E (Sufficient) [50,60)
F (Failed) < 50

Exam content:

1. Linear algebra: linear space, basis, coordinates, linear dependence/independence, matrices, rank, determinant, eigenvalues and eigenvectors, solving systems of linear equations, Frobenius theorem and linear independence, linear function, affine function, linear mapping and its matrix, computing roots of a polynomial via eigenvalues of its companion matrix, dual space, dual basis, change of the dual basis corresponding to a change of a basis, vector product and derived linear mappings, SVD, dual space and dual basis.
2. Course material: Course Text.

## Rules

1. Lecture: It is very difficult to pass the course without attending lectures.
2. Labs: It is impossible to pass the course without attending labs.
3. Homeworks: Homeworks are assigned at a lab where they can be discussed with teaching assistants. Students work out homeworks independently (rulesin Czech). The deadline for submitting a homework is on the next Monday 6:00 in the morning. Late submissions are penalized (10% for each commenced day of delay but not more than 50% of points).
4. Assessment: see above.
5. Tests: Students work out tests independently.

## Literature

1. P. Olšák. Úvod do algebry, zejména lineární. ČVUT 2007.
2. P. Pták. Introduction to Linear Algebra. Vydavatelství ČVUT, Praha, 2007.
3. R. Hartley and A.Zisserman. Multiple View Geometry in Computer Vision. Cambridge University Press, 2003.
4. Maple - A0B01MVM Matematika v Maple Installation

## Contacts

 Tomas Pajdla Martin Matoušek Petr Olšák Stanislav Steidl pajdla@cvut.cz martin.matousek@cvut.cz petr@olsak.net stanislav.steidl@cvut.cz CIIRC, room B-638 CIIRC, room B-606 FEL, room E-213 CIIRC, room B-637b