Download - Visual motion
![Page 1: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/1.jpg)
Visual motion
Many slides adapted from S. Seitz, R. Szeliski, M. Pollefeys
![Page 2: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/2.jpg)
Motion and perceptual organization• Sometimes, motion is the only cue
![Page 3: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/3.jpg)
Motion and perceptual organization• Sometimes, motion is the only cue
![Page 4: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/4.jpg)
Motion and perceptual organization• Even “impoverished” motion data can evoke
a strong percept
G. Johansson, “Visual Perception of Biological Motion and a Model For Its Analysis", Perception and Psychophysics 14, 201-211, 1973.
![Page 5: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/5.jpg)
Motion and perceptual organization• Even “impoverished” motion data can evoke
a strong percept
G. Johansson, “Visual Perception of Biological Motion and a Model For Its Analysis", Perception and Psychophysics 14, 201-211, 1973.
![Page 6: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/6.jpg)
Motion and perceptual organization• Even “impoverished” motion data can evoke
a strong percept
G. Johansson, “Visual Perception of Biological Motion and a Model For Its Analysis", Perception and Psychophysics 14, 201-211, 1973.
![Page 7: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/7.jpg)
Uses of motion• Estimating 3D structure• Segmenting objects based on motion cues• Learning and tracking dynamical models• Recognizing events and activities
![Page 8: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/8.jpg)
Motion field• The motion field is the projection of the 3D
scene motion into the image
![Page 9: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/9.jpg)
Motion field and parallax• X(t) is a moving 3D point• Velocity of scene point:
V = dX/dt• x(t) = (x(t),y(t)) is the
projection of X in the image
• Apparent velocity v in the image: given by components vx = dx/dt and vy = dy/dt
• These components are known as the motion field of the image
x(t)
x(t+dt)
X(t)X(t+dt)
V
v
![Page 10: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/10.jpg)
Motion field and parallax
x(t)
x(t+dt)
X(t)X(t+dt)
V
v
Z
Xfx
To find image velocity v, differentiate x=(x,y) with respect to t (using quotient rule):
Z
xVVfZ
XVZVfv
zx
zxx
2
Z
yVVfv zyy
Image motion is a function of both the 3D motion (V) and thedepth of the 3D point (Z)
Z
Yfy
![Page 11: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/11.jpg)
Motion field and parallax• Pure translation: V is constant everywhere
Z
xVVfv zxx
Z
yVVfv zyy
),(1
0 xvv zVZ yx VfVf ,0 v
![Page 12: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/12.jpg)
Motion field and parallax• Pure translation: V is constant everywhere
• The length of the motion vectors is inversely proportional to the depth Z
• Vz is nonzero: • Every motion vector points toward (or away from) the
vanishing point of the translation direction
),(1
0 xvv zVZ yx VfVf ,0 v
![Page 13: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/13.jpg)
Motion field and parallax• Pure translation: V is constant everywhere
• The length of the motion vectors is inversely proportional to the depth Z
• Vz is nonzero: • Every motion vector points toward (or away from) the
vanishing point of the translation direction
• Vz is zero: • Motion is parallel to the image plane, all the motion vectors
are parallel
),(1
0 xvv zVZ yx VfVf ,0 v
![Page 14: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/14.jpg)
Optical flow• Definition: optical flow is the apparent motion
of brightness patterns in the image• Ideally, optical flow would be the same as the
motion field• Have to be careful: apparent motion can be
caused by lighting changes without any actual motion• Think of a uniform rotating sphere under fixed lighting
vs. a stationary sphere under moving illumination
![Page 15: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/15.jpg)
Estimating optical flow
• Given two subsequent frames, estimate the apparent motion field u(x,y) and v(x,y) between them
• Key assumptions• Brightness constancy: projection of the same point looks the
same in every frame• Small motion: points do not move very far• Spatial coherence: points move like their neighbors
I(x,y,t–1) I(x,y,t)
![Page 16: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/16.jpg)
Brightness Constancy Equation:
),()1,,( ),,(),( tyxyx vyuxItyxI
),(),(),,()1,,( yxvIyxuItyxItyxI yx
Linearizing the right side using Taylor expansion:
The brightness constancy constraint
I(x,y,t–1) I(x,y,t)
0 tyx IvIuIHence,
![Page 17: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/17.jpg)
The brightness constancy constraint
• How many equations and unknowns per pixel?• One equation, two unknowns
• Intuitively, what does this constraint mean?
• The component of the flow perpendicular to the gradient (i.e., parallel to the edge) is unknown
0 tyx IvIuI
0),( tIvuI
![Page 18: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/18.jpg)
The brightness constancy constraint
• How many equations and unknowns per pixel?• One equation, two unknowns
• Intuitively, what does this constraint mean?
• The component of the flow perpendicular to the gradient (i.e., parallel to the edge) is unknown
0 tyx IvIuI
0)','( vuI
edge
(u,v)
(u’,v’)
gradient
(u+u’,v+v’)
If (u, v) satisfies the equation, so does (u+u’, v+v’) if
0),( tIvuI
![Page 19: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/19.jpg)
The aperture problem
Perceived motion
![Page 20: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/20.jpg)
The aperture problem
Actual motion
![Page 21: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/21.jpg)
The barber pole illusion
http://en.wikipedia.org/wiki/Barberpole_illusion
![Page 22: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/22.jpg)
The barber pole illusion
http://en.wikipedia.org/wiki/Barberpole_illusion
![Page 23: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/23.jpg)
The barber pole illusion
http://en.wikipedia.org/wiki/Barberpole_illusion
![Page 24: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/24.jpg)
Solving the aperture problem• How to get more equations for a pixel?• Spatial coherence constraint: pretend the pixel’s
neighbors have the same (u,v)• If we use a 5x5 window, that gives us 25 equations per pixel
B. Lucas and T. Kanade. An iterative image registration technique with an application tostereo vision. In Proceedings of the International Joint Conference on Artificial Intelligence, pp. 674–679, 1981.
![Page 25: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/25.jpg)
Solving the aperture problem• Least squares problem:
B. Lucas and T. Kanade. An iterative image registration technique with an application tostereo vision. In Proceedings of the International Joint Conference on Artificial Intelligence, pp. 674–679, 1981.
• When is this system solvable?• What if the window contains just a single straight edge?
![Page 26: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/26.jpg)
Conditions for solvability• “Bad” case: single straight edge
![Page 27: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/27.jpg)
Conditions for solvability• “Good” case
![Page 28: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/28.jpg)
Lucas-Kanade flowLinear least squares problem
B. Lucas and T. Kanade. An iterative image registration technique with an application tostereo vision. In Proceedings of the International Joint Conference on Artificial Intelligence, pp. 674–679, 1981.
The summations are over all pixels in the window
Solution given by
![Page 29: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/29.jpg)
Lucas-Kanade flow
• Recall the Harris corner detector: M = ATA is the second moment matrix
• We can figure out whether the system is solvable by looking at the eigenvalues of the second moment matrix• The eigenvectors and eigenvalues of M relate to edge
direction and magnitude • The eigenvector associated with the larger eigenvalue points
in the direction of fastest intensity change, and the other eigenvector is orthogonal to it
![Page 30: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/30.jpg)
Interpreting the eigenvalues
1
2
“Corner”1 and 2 are large,
1 ~ 2
1 and 2 are small “Edge” 1 >> 2
“Edge” 2 >> 1
“Flat” region
Classification of image points using eigenvalues of the second moment matrix:
![Page 31: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/31.jpg)
Uniform region
– gradients have small magnitude– small l1, small l2– system is ill-conditioned
![Page 32: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/32.jpg)
Edge
– gradients have one dominant direction– large l1, small l2 – system is ill-conditioned
![Page 33: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/33.jpg)
High-texture or corner region
– gradients have different directions, large magnitudes– large l1, large l2– system is well-conditioned
![Page 34: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/34.jpg)
Errors in Lucas-Kanade• The motion is large (larger than a pixel)
• Iterative refinement• Coarse-to-fine estimation• Exhaustive neighborhood search (feature matching)
• A point does not move like its neighbors• Motion segmentation
• Brightness constancy does not hold• Exhaustive neighborhood search with normalized correlation
![Page 35: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/35.jpg)
Feature tracking• So far, we have only considered optical flow
estimation in a pair of images• If we have more than two images, we can
compute the optical flow from each frame to the next
• Given a point in the first image, we can in principle reconstruct its path by simply “following the arrows”
![Page 36: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/36.jpg)
• Ambiguity of optical flow• Need to find good features to track
• Large motions, changes in appearance, occlusions, disocclusions• Need mechanism for deleting, adding new features
• Drift – errors may accumulate over time• Need to know when to terminate a track
Tracking challenges
![Page 37: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/37.jpg)
Tracking over many frames• Select features in first frame• For each frame:
• Update positions of tracked features – Discrete search or Lucas-Kanade (or a combination of the two)
• Terminate inconsistent tracks– Compute similarity with corresponding feature in the previous
frame or in the first frame where it’s visible• Find more features to track
![Page 38: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/38.jpg)
Shi-Tomasi feature tracker
• Find good features using eigenvalues of second-moment matrix• Key idea: “good” features to track are the ones whose motion can
be estimated reliably
• From frame to frame, track with Lucas-Kanade• This amounts to assuming a translation model for frame-to-frame
feature movement
• Check consistency of tracks by affine registration to the first observed instance of the feature• Affine model is more accurate for larger displacements• Comparing to the first frame helps to minimize drift
J. Shi and C. Tomasi. Good Features to Track. CVPR 1994.
![Page 39: Visual motion](https://reader035.vdocuments.us/reader035/viewer/2022081603/56813648550346895d9dc7c2/html5/thumbnails/39.jpg)
Tracking example
J. Shi and C. Tomasi. Good Features to Track. CVPR 1994.