1. The Measurement of Visual Motion P. Anandan Microsoft Research

2. Direct Methods: Methods for motion and/or shape estimation, which recover the unknown parameters directly from measurable image quantities at each pixel in the image. Minimization step: Direct methods: Error measure based on dense measurable image quantities. Feature-based methods: Error measure based on distances of destinct features.

3. WHY BOTHER Visual Motion can be annoying –Camera instabilities, jitter –Measure it. Remove it. Visual Motion indicates dynamics in the scene –Moving objects, behavior –Track objects and analyze trajectories Visual Motion reveals spatial layout of the scene –Motion parallax

4. Video Enhancement Visual Motion can be annoying –Camera instabilities, jitter –Measure it. Remove it.

5. Temporal Information Visual Motion indicates dynamics in the scene –Moving objects, behavior –Track objects and analyze trajectories

6. Spatial Layout Visual Motion reveals spatial layout of the scene –Motion parallax Sprite Viewer Demo

7. Classes of Techniques Feature-based methods –Extract salient visual features (corners, textured areas) and track them over multiple frames –Analyze the global pattern of motion vectors of these features –Sparse motion fields, but possibly robust tracking –Suitable especially when image motion is large (10-s of pixels) Direct-methods –Directly recover image motion from spatio temporal image brightness variations –Global motion parameters directly recovered without an intermediate feature motion calculation –Dense motion fields, but more sensitive to appearance variations –Suitable for video and when image motion is small (< 10 pixels) Our Focus Today

8. Brightness Constancy Equation: The Brightness Constraint Or, better still, Minimize : Linearizing (assuming small (u,v)):

9. Gradient Constraint (or the Optical Flow Constraint) Minimizing: The gradient constraint – only one constraint for each pixel In general Hence,

10. Aperture Problem and Normal Flow

13. The gradient constraint: Defines a line in the (u,v) space u v Normal Flow:

14. Local Patch Analysis

15. Combining Local Constraints u v etc.

16. Patch Translation Minimizing Assume a single velocity for all pixels within an image patch On the LHS: sum of the 2x2 outer product tensor of the gradient vector

17. Singularities and the Aperture Problem Let Algorithm: At each pixel compute by solving M is singular if all gradient vectors point in the same direction -- e.g., along an edge -- of course, trivially singular if the summation is over a single pixel -- i.e., only normal flow is available (aperture problem) Corners and textured areas are OK and

18. Iterative Refinement Estimate velocity at each pixel using one iteration of Lucas and Kanade estimation Warp one image toward the other using the estimated flow field (easier said than done) Refine estimate by repeating the process

19. Motion and Gradients Consider 1-d signal; assume linear function of x x I t=0 t=1 t

20. Iterative refinement x t x t t x BUT!!

21. Limits of the gradient method 1.Fails when intensity structure within window is poor 2.Fails when the displacement is large (typical operating range is motion of 1 pixel) –Linearization of brightness is suitable only for small displacements Also, brightness is not strictly constant in images –actually less problematic than it appears, since we can pre-filter images to make them look similar

22. Pyramids Pyramids were introduced as a multi-resolution image computation paradigm in the early 80s. The most popular pyramid is the Burt pyramid, which foreshadows wavelets Two kinds of pyramids: Low pass or “Gaussian pyramid” Band-pass or “Laplacian pyramid”

23. Gaussian Pyramid Convolve image with a small Gaussian kernel –Typically 5x5 Subsample (decimate by 2) to get lower resolution image Repeat for more levels A sequence of low-pass filtered images

24. Laplacian pyramid Laplacian as Difference of Gaussian Band-pass filtered images Highlights edges at different spatial scales For matching, this is less sensitive to image illumination changes But more noisy than using Gaussians

27. image I image J JwJw warp refine + Pyramid of image JPyramid of image I image I image J Coarse-to-Fine Estimation u=10 pixels u=5 pixels u=2.5 pixels u=1.25 pixels ==> small u and v...

28. Global Motion Models 2D Models: Affine Quadratic Planar projective transform (Homography) 3D Models: Instantaneous camera motion models Homography+epipole Plane+Parallax

29. Example: Affine Motion Substituting into the B.C. Equation: Each pixel provides 1 linear constraint in 6 global unknowns (minimum 6 pixels necessary) Least Square Minimization (over all pixels):

31. Quadratic – instantaneous approximation to planar motion Other 2D Motion Models Projective – exact planar motion

32. 3D Motion Models Local Parameter: Instantaneous camera motion: Global parameters: Homography+Epipole Local Parameter: Residual Planar Parallax Motion Global parameters: Local Parameter:

33. Correlation and SSD For larger displacements, do template matching –Define a small area around a pixel as the template –Match the template against each pixel within a search area in next image. –Use a match measure such as correlation, normalized correlation, or sum-of-squares difference –Choose the maximum (or minimum) as the match –Sub-pixel interpolation also possible

34. SSD Surface – Textured area

35. SSD Surface -- Edge

36. SSD Surface – homogeneous area

37. Discrete Search vs. Gradient Based Estimation Consider image I translated by The discrete search method simply searches for the best estimate. The gradient method linearizes the intensity function and solves for the estimate

38. Consider image I translated by Uncertainty in Local Estimation Now, This assumes uniform priors on the velocity field

39. Quadratic Approximation When are small After some fiddling around, we can show

40. Posterior uncertainty At edges is singular, but just take pseudo-inverse Note that the error is always convex, since is positive semi-definite i.e., even for occluded points and other false matches, this is the case… seems a bit odd!

41. Match plus confidence Numerically compute error for various Search for the peak Numerically fit a qudratic to around the peak Find sub-pixel estimate for and covariance If the matrix is negative, it is false match Or even better, if you can afford it, simply maintain a discrete sampling of and

42. Quadratic Approximation and Covariance Estimation When where

43. Choosing the Correlation Window Size Small windows lead to more false matches Large windows are better this way, but… –Neighboring flow vectors will be more correlated (since the template windows have more in common) –Flow resolution also lower (same reason) –More expensive to compute Another way to look at this: Small windows are good for local search but more precise and less smooth Large windows good for global search but less precise and more smooth method

44. Robust Estimation Standard Least Squares Estimation allows too much influence for outlying points

45. Robust Estimation Robust gradient constraint Robust SSD

46. Influence functions and Redescening Estimators GO TO THE BOARD

47. Reweighted Least-Squares Robust Minimization (over all pixels): An Outlier Measure Residual normal flow

48. Outlier rejection Original Outliers Synthesized

49. Locking Property ORIGINAL ENHNACED

50. Original sequencePlane-aligned sequenceRecovered shape “block sequence” [Kumar-Anandan-Hanna’94] Dense 3D Reconstruction (Plane+Parallax)

51. Original sequence Plane-aligned sequence Recovered shape

52. Dense 3D Reconstruction Brightness Constancy constraint The intersection of the two line constraints uniquely defines the displacement. Epipolar line epipole p

53. Limitations Limited search range (up to 10% of the image size). Brightness constancy.

54. Multi-sensor Alignment Originals: IR and EO images

55. Direct Correlation Based Alignment

56. Example: Affine Motion Substituting into the B.C. Equation: Each pixel provides 1 linear constraint in 6 global unknowns    yIxIIyIxII yyyxxx (minimum 6 pixels necessary)

57. The Brightness Constraint Brightness Constancy Equation: Linearizing J (assume small (u,v)): In practice (although not necessary) one assumes

58. Motion Models Motion vector (u,v) has two unknowns (at each pixel) Brightness Constraint provides one equation One approach is to use a regularizer (e.g., Horn and Schunk) Alternative: Global Motion Model Constraint –e.g., Affine, Quadratic, Projective (planar) transform (2D Models) –Instantaneous camera motion, homography+epipole, Plane+Parallax, etc. (3D Models)

59. J JwJw I warp refine + J JwJw I warp refine + J pyramid construction J JwJw I warp refine + I pyramid construction Coarse-to-Fine Estimation

60. Affine Motion Estimation Each pixel provides one constraint Least square estimation; Minimize:

61. Coarse-to-Fine Estimation Problem: Brightness linearization assumes small (u,v). Solution: Iterative refinement Coarse-to-fine estimation within a pyramid