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

8m watch time

Sort: