Tentin tekstisisältö

DATA.ML.300 Computer Vision - 03.03.2023 (Final Exam)

Tentin tekstisisältö

Teksti on luotu tekstintunnistuksella alkuperäisestä tenttitiedostosta, joten se voi sisältää virheellistä tai puutteellista tietoa. Esimerkiksi matemaattisia merkkejä ei voida esitää oikein. Tekstiä käytetään pääasiassa hakutulosten luomiseen.

Alkuperäinen tentti
DATA.ML.300 Computer Vision

Final exam

The maximum number of points for each task is shown in parenthesis. The use of
calculator is allowed, but it is not necessary.

1. Explain briefly the following terms and concepts:

(a) Camera projection matrix (1p)
(b) Scale Invariant Feature Transform (SIFT) (1 p)
(c) Camera calibration (1 p)
(d) Structure from motion (1 p)
(e) Essential matrix (1 p)
(f) Hough transform (1p)

2. Model fitting using RANSAC algorithm

(a) Describe the main stages of the RANSAC algorithm in the general case. (2 p)

(b) In this context, why it is usually beneficial to sample minimal subsets of data
points instead of using more data. points? (Minimal subsets have the minimal
number of data points required for fitting.) (1p)

(c) Mention at least two examples of models that can be fitted using RANSAC.
Describe how the models are used in computer vision and what is the size of
the minimal subset of data points required for fitting in each case. (1p)

(d) Describe how RANSAC can be used for panoramic image stitching. Why is
RANSAC needed and what is the model fitted in this case? (2p)

3. Feature tracking

(a) Describe the main elements of the Shi-Tomasi feature tracker (i.e. how the
features are selected and tracked, and tracks terminated or added). (2 p)
(b) Describe the Lucas-Kanade method for estimating the displacement of an im-
age patch. What kind of equations need to be solved and what is the brightness
constancy constraint in this context? (2p)

(c) What are the benefits of Lucas-Kanade method when compared to simple
template matching? (2p)

4, Neural networks

(a) What is a Perceptron? Explain the construction and give a rough idea how it
can be trained (hint: use picture). (2 p)
(b) Explain the basic concepts of the backpropagation algorithm and stochastic
gradient descend training. (What it does? How it works? When it can be
used? Why it may fail?) (2 p)
(c) Explain how neural networks are typically used in image classification? What
kind of neural networks are popular in this context and why? {1 p)
 

 

Figure 1:

(4)

P= (Xp,Yp, Zp)

 

Top view of a stereo pair where two pinhole cameras are placed side by side.

Explain the main differences between one and two stage object detection net-
works? Give an example of both types. (1 p)

5. Triangularisation and stereo

(a)

(b)

(c)

Figure 1 presents a stereo system with two parallel pinhole cameras separated
by a baseline } so that the centers of the cameras are c; = (0,0,0) and c, =
(b, 0,0). Both cameras have the same focal length f. The point P is located in
front of the cameras and its disparity d is the distance between corresponding
image points, i¢., d = |2; — a,|. Assume that d= 1 em, b= 6 cm and f=1
cm. Compute Zp. (2 p)
Two cameras are looking at the same scene. The projection matrices of the
two cameras are P; and Pz. They see the same 3D point X = (X,Y, 2)".
The observed coordinates for the projections of point X are x; and x, in the
two images, respectively. The numerical values are as follows:

1000 10 01 9 3
P,=/0 1 0 0], Po=jo 0 -1 1), x= [, x= (f).
0010 01 0 1
Compute the 3D coordinates of the point X. (Hint: Perhaps the simplest way
in this case is to write the projection equations in homogeneous coordinates
by explicitly writing out the unknown scale factors, and to solve X,Y, Z and
the scale factors directly from those equations.) (1 p)

Present a derivation for the linear triangulation method and explain how X
can be solved using that approach in the general case (i.e. no need to compute
with numbers in this subtask). (2 p)
How does the triangulation approach differ from the bundle adjustment pro-
cedure which is commonly used in structure-from-motion problems (i.e. how
is the bundle adjustment problem different)? (1 p)

 

 


Käytämme evästeitä

Tämä sivusto käyttää evästeitä, mukaanlukien kolmansien puolten evästeitä, vain sivuston toiminnan kannalta välttämättömiin tarkoituksiin, kuten asetusten tallentamiseen käyttäjän laitteelle, käyttäjäistuntojen ylläpitoon ja palvelujen toiminnan mahdollistamiseen. Sivusto kerää käyttäjästä myös muuta tietoa, kuten käyttäjän IP-osoitteen ja selaimen tyypin. Tätä tietoa käytetään sivuston toiminnan ja tietoturvallisuuden varmistamiseen. Kerättyä tietoa voi päätyä myös kolmansien osapuolten käsiteltäväksi sivuston palvelujen tavanomaisen toiminnan seurauksena.

FI / EN