Answers are grounded in this paper and cite their sources.
Note: Please see pdf for full abstract with equations.Optical flow is the apparent motion of the brightness patterns in an image. The pyramidal form of the Lucas-Kanade (LK) method is frequently used for its computation but experiments have shown that the method has deficiencies. Problems arise because of numerical issues in the least squares (LS) problem min ||Ax-b||_2^2 , A∈ Rm × 2 and m >> 2, which must be solved many times. Numerical properties of the solution x_0 = A^{}b = (A^TA)⁻¹A^Tb of the LS problem are considered and it is shown that the property m >> 2 has implications for the error and stability of x_0. In particular, it can be assumed that b has components that lie in the column space (range) R(A) of A, and the space that is orthogonal to R(A), from which it follows that the upper bound of the condition number of x_0 is inversely proportional to cos theta, where theta is the angle between b and its component in R(A). It is shown that this bound, a non-linear condition number and the errors in the solutions of the LS problems increase as the pyramid is descended from the top level (coarsest image) to the base (finest image), such that the optical flow computed at the base of the pyramid may be computationally unreliable.Two examples of the computation of the optical flow demonstrate the theoretical results, and the implications of these results for extended forms of the LK method are discussed.
No takes yet. Share an insight, caveat, or question.
Joab R. Winkler (2022) studied this question.