lucas kanade Flashcards

(51 cards)

1
Q

What is optical flow?

A

The apparent motion of image brightness patterns between consecutive frames, represented as a vector field.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the motion field?

A

The true motion of points in 3D space as projected onto the 2D image plane.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

When does optical flow differ from the motion field?

A

When brightness changes are due to lighting, reflections, or motion illusions.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What assumption underlies optical flow estimation?

A

Brightness constancy — that a point retains the same intensity over time.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the brightness constancy equation?

A

I(x, y, t) = I(x + δx, y + δy, t + δt)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the optical flow constraint equation?

A

Iₓu + Iᵧv + Iₜ = 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What does each variable in the optical flow constraint represent?

A

Iₓ, Iᵧ are spatial gradients; Iₜ is temporal gradient; u, v are flow components.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Why is optical flow under-constrained?

A

Because the constraint equation provides one equation for two unknowns (u and v).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

What is the aperture problem?

A

The inability to determine full motion from a small image region due to missing directional information.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

In which region is flow best estimated?

A

Corners or textured regions, where gradients exist in multiple directions.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

What is the Lucas–Kanade method?

A

A technique to estimate constant optical flow over a small window using least squares.

23
Q

What type of region does Lucas–Kanade assume?

A

A small window where motion is constant across all pixels.

25
What system does Lucas–Kanade solve?
An overdetermined system of optical flow constraints using least squares.
26
27
What is the matrix form of the Lucas–Kanade solution?
AᵀA · [u v]ᵀ = -Aᵀb
28
29
What happens if you try to compute flow in a flat region?
You can't — the gradients are too small to provide useful information.
30
31
Why does motion on an edge cause flow ambiguity?
Because gradient information exists in only one direction — you can't resolve full flow.
32
33
What is used to compute image gradients Iₓ and Iᵧ in practice?
Finite difference approximations or convolution filters like Sobel.
34
35
What is coarse-to-fine estimation in optical flow?
A multiscale method that starts at low resolution and refines flow estimates at higher resolutions.
36
37
Why is coarse-to-fine estimation used?
To handle large motions that exceed one pixel, which basic methods can't resolve.
38
39
What is the main limitation of standard Lucas–Kanade?
It assumes small motion — fails when motion between frames is large.
40
41
What does the vector [u, v] represent in optical flow?
The displacement (in x and y) of a pixel over time, in pixels per frame.
42
43
What is the unit of optical flow?
Pixels per frame.
44
45
How is the temporal gradient Iₜ estimated?
By taking the difference in intensity between corresponding pixels in two frames.
46
47
What is the main challenge in optical flow computation?
Recovering accurate motion from limited local gradient information, especially in noisy or textureless regions.
48
49
What is the goal of the optical flow algorithm?
To estimate how each pixel in an image moves from one frame to the next.
50
51
What is the best type of image region for optical flow estimation?
Corner or textured regions with non-zero gradients in multiple directions.