The 'orthogonal algorithm' for optical flow detection using dynamic programming

An algorithm for optical flow detection is introduced. It is based on an iterative search for a displacement field that minimizes the L/sub 1/ or L/sub 2/ distance between two images. Both changes are sliced into parallel and overlapping strips. Corresponding strips are aligned using dynamic programming. Two passes are performed using orthogonal slicing directions. This process is iterated in a pyramidal fashion by reducing the spacing and width of the strips. This algorithm provides very-high-quality matching for calibrated patterns as well as for human visual sensation. The results appear to be at least as good as those obtained with classical optical flow detection methods.<<ETX>>

[1]  Jean-Luc Gauvain,et al.  A dynamic programming processor for speech recognition , 1989 .

[2]  Michael D. Brown,et al.  An algorithm for connected word recognition , 1982, ICASSP.

[3]  Takeo Kanade,et al.  Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  B. Zavidovique,et al.  Pattern Recognition Through Dynamic Programming , 1985, Optics & Photonics.

[5]  S. Chiba,et al.  Dynamic programming algorithm optimization for spoken word recognition , 1978 .

[6]  Berthold K. P. Horn,et al.  Determining Optical Flow , 1981, Other Conferences.

[7]  Hans-Hellmut Nagel,et al.  On the Estimation of Optical Flow: Relations between Different Approaches and Some New Results , 1987, Artif. Intell..

[8]  B. Zavidovique,et al.  Dynamic programming for region based pattern recognition , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.