An explanation of the Lucas-Kanade optical flow algorithm for feature tracking in computer vision. Covers the core brightness constancy assumption, Taylor expansion approximation, the aperture problem, and the least-squares solution using overdetermined systems. Also explains two extensions for handling large motions: iterative refinement and coarse-to-fine Gaussian pyramid search. Ends with an anecdote from Takeo Kanade about how Bruce Lucas convinced him to publish what became one of the most cited papers in computer vision history.
•8m watch time
Sort: