You are on page 1of 13

Berlin University of

Technology

Computer Vision &


Final Examination Remote Sensing

Automatic Image Analysis Prof. Dr. Olaf Hellwich


Dr. Ronny Hänsch
Summer term 2018

Name: ............................... Student ID number: ...........

A July 17, 2018

DO NOT OPEN THIS EXAMINATION SHEET UNTIL YOU ARE TOLD TO DO SO!

Write your name and student ID in the corresponding places at the top of this page now.

Books, notes, dictionaries, own empty sheets of paper, and pocket calculators are not allowed.
Use only a pen. Everything written with a pencil will not be taken into account.

If you do not understand a question, please ask.


It will be to your advantage to read the entire examination before beginning to work.

The exam is in most parts a multiple choice test.


For each question there is at least one and at most four correct answers.
The number of points p for a single correct answer are stated next to the question.
Please note, that there is a penalty of -p/2 points for a wrong answer, while by giving no answer
points are neither gained nor lost (i.e. no penalty for not giving an answer).
The minimal number of points for each question is 0 (i.e. no negative points for whole questions).

Which of the following numbers is even? 2P


i) 2 ii) 3 iii) 4 iv) 5
X
Example 1 (correct +2P) Result: 2P
X X
Example 2
(incorrect: -1P) (correct +2P) Result: 1P
X X
Example 3
(correct +2P) (correct +2P) Result: 4P
X
Example 4
(incorrect: -1P) Result: 0P

Notation:
Black = Gray level of 0 ; White = Gray level of 255
Image gradients point from dark to bright.
Angles are defined counter-clockwise.

Lots of luck and do your best!


Please use this table to denote your answers by making a cross (“X”) in the column
corresponding to your answer. If you want to correct a falsely given answer, strike the line
through and use the empty rows at the end of the table.
Question i) ii) iii) iv)
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
31.
32.

Total: 63 points
Block I

The figure on the right shows three


pixels that have been detected as
being edge pixels within an image,
i.e. they have strong local gradients.

The gradient direction is denoted


as double-arrow in the figure.

1. Based on the given information, which of the figures below shows the voting space 2P
of a line detector based on the Radon transform?

2. Based on the given information, which of the figures below show the voting space 2P
of a Hough line detector?

i) ii)

iii) iv)

3. How many dimensions has the voting space of a Hough ellipse detector that is 1P
able to detect general ellipses?

i) 3 ii) 5 iii) 6 iv) 4


4. The following R-table was computed based on four pixels on the outline of a 3P
template object.

Theta [ 0- [ 45 - [ 90 - [ 135 - [ 180 - [ 225 - [ 270 - [ 315 -


45) 90 ) 135 ) 180 ) 225 ) 270 ) 315 ) 360 )
Offset (5,-4) (4,-2) (0,-2) (5,3)

Which of the following is the correct R-table if the template image is scaled by a
factor s=2 and rotated counter-clockwise by an angle of ϕ=90 ° ?

i)
Orien- [ 0- [ 45 - [ 90 - [ 135 - [ 180 - [ 225 - [ 270 - [ 315 -
tation 45) 90 ) 135 ) 180 ) 225 ) 270 ) 315 ) 360 )
Offset (10,-8) (8,-4) (0,-4) (10,6)

ii)
Orien- [ 0- [ 45 - [ 90 - [ 135 - [ 180 - [ 225 - [ 270 - [ 315 -
tation 45) 90 ) 135 ) 180 ) 225 ) 270 ) 315 ) 360 )
Offset (10,-8) (8,-4) (0,-4) (10,6)

iii)
Orien- [ 0- [ 45 - [ 90 - [ 135 - [ 180 - [ 225 - [ 270 - [ 315 -
tation 45) 90 ) 135 ) 180 ) 225 ) 270 ) 315 ) 360 )
Offset (8,10) (4,8) (4,0) (-6,10)

iv)
Orien- [ 0- [ 45 - [ 90 - [ 135 - [ 180 - [ 225 - [ 270 - [ 315 -
tation 45) 90 ) 135 ) 180 ) 225 ) 270 ) 315 ) 360 )
Offset (8,10) (4,8) (4,0) (-6,10)
5. The figure below shows a 110×90 pixel large query image, with a light grey 2P
background (intensity value 200) and a dark grey object (intensity value 100).
Three distinct pixels are marked as black squares.

The R-Table of a Generalized Hough Transform computed from a template image


is given below.

theta offset
[0, 45)
[45, 90) (-10,10), (-30,30)
[90, 135)
[135, 180) (10,10), (30,30)
[180, 225)
[225, 270) (10,70), (30,50)
[270, 315)
[315, 360) (-10,70), (-30,50) Query image
R-Table

If only the three marked pixels of the query image are taken into account, which of
the following is the correct voting space?

i) ii)

iv) none of the shown voting spaces is


correct.

iii)
Block II

The figure on the right shows the space


spanned by two features with values
between 0 and 5 filled with several data
samples denoted by filled circles.

For the following two questions, assume


square windows with integer side length,
e.g. 1x1, 3x3, or 5x5.

6. Which of the following values is estimated by the Parzen Window estimator as the 2P
probability density at the position marked by X in the figure above if a window size
of 1×1 is used?

i) 2/30 ii) 2/80 iii) 2/40 iv) 2/50

7. Which k was selected if the k-Nearest-Neighbor estimator computes the 2P


probability density at the position marked by X in the figure above as p(x) = 1/15?

i) 6 ii) 18 iii) 2 iv) 12

根据KNN密度公式,本题K=2V,V为窗口的面积
Block III

8. Which of the following shows the amplitude of the Fourier spectrum of a cosine 1P
function, i.e. a function of the form f (x)=cos(ax)+b , with constants
a , b∈ℝ , a≠0 ?

b不等于0, 0处有频率

i) ii)

iii) iv)

9. Given two signals h and g, which of the following is the convolution theorem 2P
(“FFT” denotes the Fast Fourier Transform and ()* complex conjugation)?

i) h⊗g=∫ f (t)h(t + τ) d τ ii) h⊗g=∫ f (t)h(t−τ )d τ


*
iii) FFT (h⊗g)=FFT (h)⋅FFT (g ) iv) FFT (h⊗g)=FFT (h)⋅FFT (g)

10. Given is the following Fourier Transform F∈ℂ100 of the outline of a shape:

{
1000+ i 1000 if μ=0,
F(μ)= 500+ i 500 if μ=−1,
0 otherwise.

The outline of the shape used to construct the Fourier descriptor F stated above 1P
consists of

i) 1000 pixels. ii) 2000 pixels. iii) 500 pixels. iv) 100 pixels.

11. The center of the shape used to construct the Fourier descriptor F stated above 1P
(Question 10) is at position

i) (10,10) ii) (5,5) iii) (1000,1000) iv) (500,500)


12.
The shape used to construct the Fourier descriptor F stated above (Question 10) is
1P
i) a triangle. ii) a square. iii) a circle. iv) convex.

有三个不同的频率
13. The figures below show the original shape of an object and the amplitude of its 2P
- Fourier descriptor, i.e. Fourier transform of the outline without normalization.
16.

Which of the following Fourier Descriptors (shown in below in figures i)-iv))


belong to which of the shown transformed shapes shown in figures Q-10 to Q-13?

Question-13. Question-14.

Question-15. Question-16.

i) ii)

iii) iv)
Block IV

17. Which of the following statements is true for a typical, modern digital camera that 1P
is able to acquire color images?

i) Every element of the sensor integrates the intensity over three different
wavelength bands leading to the three color channels of the image.

ii) The sensor elements itself are “color blind” and integrate intensity over a wide
range of wavelengths.

iii) Such a camera records three images with a very short temporal delay in
which the sensor elements change the wavelength band for which they are sensitive.

iv) In front of the actual sensor is an array of color filters.

18. Given a data sample x=(x 1 ,... , x n)∈ℝn , classification usually refers to applying 1P
a function y=f ( x) which maps the sample x to a class label y . In the case
of a binary classification problem, i.e. y ∈{0,1 } , and n=10 , which of the
following is a linear classifier?

i) f (x)= {
1 if p ( x | μ1 )≥ p(x |μ 2),
0 otherwise.
where p( x | μ i) ,i∈{1,2 } are Gaussian distributions with mean vector μi and
identical variance-covariance matrices.

ii) f (x)= {
1 if p ( x | θ 1)≥ p( x | θ2 ),
0 otherwise.
where p( x | θ i) , i∈{1,2 } are Gaussian Mixture Models with individual
parameters θi .

iii) f (x)= { 1 if x3 <10,


0 otherwise.

iv) f (x)= {
1 if wT⋅x+b≥0,
0 otherwise.
where w∈ℝn , b∈ℝ .
Block V

19. If x=( x 1 , x 2)∈ℝ2 , which of the following statements is true for a probability 1P
density distribution p(x) over ℝ2 ?

i) ∀ x∈ℝ 2 : p( x)≤1 ii) ∫ℝ2 p (x)d x=1

iii) ∀ x∈ℝ 2 : p( x)≥0 iv) p(x 1)=∫ℝ p( x) d x 2

20. If x∈R is a real-valued, Gaussian-distributed (mean value μ=0 and standard 1P


deviation σ=1 ) random variable, what is the probability P( x=0) ?

1
i) P( x=0)=1 ii) P( x=0)=0 iii) P(x=0)= √ 2 π iv) P( x=0)=
√2 π

21. Given two random variables A and B, which of the following statements are 1P
always true?

i) P( A , B)=P (A )P( B) ii) P( A , B)=P (A | B) P (A )


iii) P( A)=∑ B P( A , B) iv) P( A , B)=P (B | A) P (A )

22. Which of the following is Bayes theorem? 2P

likelihood⋅posterior likelihood⋅prior
i) evidence= ii) posterior=
prior evidence
likelihood⋅evidence posterior⋅prior
iii) posterior= iv) likelihood=
prior evidence
The histograms below denote the absolute frequencies of co-occurrence of two
measurements ( x∈{0,1, 2 } and y ∈{10,20, 30 } ) within the training data of a
two-class classification problem (i.e. class label ω∈{ A , B} ). You can assume
that the given training data is a proper representation of the data during
application.

2 10 5 1 2 10 20 10
x 1 10 5 1 x 1 20 40 20
0 10 5 1 0 10 20 10
10 20 30 10 20 30
y y
Histogram for class A Histogram for class B

23. Given the histograms above, which of the following values corresponds to the 2P
likelihood of class A for the sample (x,y) = (1,10)?

i) 5/104 ii) 5/24 iii) 15/104 iv) 1/8

24. Given the histograms above, for which class would a Maximum Likelihood (ML) 2P
classifier decide given the sample (x,y) = (1,10)?

i) B iv) A

25. Given the histograms above, which of the following values corresponds to the 2P
posterior of class B for the sample (x,y) = (1,10)?

i) 2/3 ii) 1/8 iii) 5/24 iv) 1/3

26. Given the histograms above, for which class would a Maximum A Posteriori 2P
(MAP) classifier decide given the sample (x,y) = (1,10)?

i) B iv) A
Block VI

27. Which of the following statements are correct given the general laws of probability 2P
theory and the conditional independence assumption A,B ⊥ C. Please note, that
nothing else should be assumed!

i) P(A,B|C) = P(A|C)P(B|C) ii) P(C|A,B) = P(C|A)P(C|B)


iii) P(A,B,C) = P(A|C)P(B|C)P(C) iv) P(A,B) = P(A)P(B)

28. The figure on the right shows a small part 2P


of a specific graphical model. It consists
of multiple nodes connected via
undirected links.

This particular graphical model shall be


used for semantic segmentation of a
binary image x∈{0,1 }N ×M with
N×M pixels. In particular, the goal is
to estimate P( y | x) where
N ×M
y ∈{0,1 } are the class labels of
each pixel in the image.

The measurement nodes are denoted by squares and initialized with the given
binary image. The label nodes are denoted by circles. The unary energy ψi is
defined as ψi =−1+2| y i−x i| . The binary energy ϕij is given as
ϕij =2( y i + y j )−4 y i y j−1 .

What is the local energy at node y 5 for y 5=1 given the graphical model
depicted in the figure?

i) 3 ii) -3 iii) 1 iv) -1

29. Given the current state of the model in the question above, 1P

i) y 5 is likely to be set to 1. ii) y 5 is likely to be set to 0.


iii) y 5 will be set to 0 or 1 with equal iv) the value of x 5 is likely to be
probability. changed to 1.
Block VII

30. Which of the following expressions is referred to as ReLU activation function 1P


within the context of artificial neural networks?

1 ii) f (x)=max(0, x)
i) f (x)=
1+exp(−x )
iv) f (x)=tanh( x )
iii) f (x)= {
|x| if |x|<1
1 otherwise.

31. The MLP shown in the figure on the right


consists of three layers, with two neurons
n in all layers. The bias term is denoted
as an additional neuron in each layer with
1 as constant output. Within the figure,
the numerical weight values are attached
to the corresponding connections. The
same activation function f is used in all
layers (except the input layer) and is
defined as the following lookup table:

x <-3 [-3,-2) [-2,-1) [-1,0) 0 (0,1] (1,2] (2,3] >3


f(x) -0.2 -0.2 -0.2 -0.1 0 1 2 2 2

Given the current state of the network and an input x α=( x 1 , x 2)α =(−1,1) , what 2P
is the output y ( x α ) of the network?

i) (2, 0) ii) (1, 0) iii) (0.1, -0.1) iv) (0, 0)

32. What does the abbreviation GAN stand for? 1P

i) Generative Adversarial Network ii) Gaussian Annealing Network


iii) General Accumulator Network iv) Greater Artificial Network

You might also like