Developer Reference

  • 2020
  • 10/21/2020
  • Public Content

Optical Flow

This section describes the functions that calculate the optical flow using the pyramidal Lucas-Kanade algorithm [ Bou99].
The optical flow between two images is generally defined as an apparent motion of image brightness. Let
I(x, y, t)
be the image brightness that changes in time to provide an image sequence.
Optical flow coordinates
can be found from so called
optical flow constraint equation
The Lucas-Kanade algorithm assumes that the group of adjacent pixels has the same velocity and founds the approximate solution of the above equation using the least square method.

Product and Performance Information


Intel's compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instruction sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserved for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice.

Notice revision #20110804