The 'orthogonal algorithm' for optical flow detection using dynamic programming
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 249-252 vol.3
- https://doi.org/10.1109/icassp.1992.226204
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Dynamic programming for region based pattern recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An algorithm for connected word recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A dynamic programming processor for speech recognitionIEEE Journal of Solid-State Circuits, 1989
- On the estimation of optical flow: Relations between different approaches and some new resultsArtificial Intelligence, 1987
- Stereo by Intra- and Inter-Scanline Search Using Dynamic ProgrammingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Determining optical flowArtificial Intelligence, 1981
- Dynamic programming algorithm optimization for spoken word recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978