Parallel Optical Flow Using Local Voting
Abstract
We describe a parallel algorithm for computing optical flow from short-range motion. Regularizing optical flow computation leads to a forruulation which minimizes matching error and, at the same time, maximises smoothness of the optical flow. We develop an approximation to the full regularization computation in which corresponding points are found by comparing local patches of the images. Selection aniong competing matches is performed using a winner-take-all scheme. The algorithm accommodates many different image transformations uniformly, with siniilar results, from brightness to edges. The optical flow computed froni different image transformations, such as edge detection and direct brightness computation, can be simply combined. The algorithm is easily implemented using local operations on a finegrained computer, and has been implemented on a Connection Machine. Experiments with natural images show that the scheme is effective and robust against noise. The algorithm leads to dense optical flow fields; in addition, inforniation from matching facilitates segmentation.
Cite
Text
Little et al. "Parallel Optical Flow Using Local Voting." IEEE/CVF International Conference on Computer Vision, 1988. doi:10.1109/CCV.1988.590023Markdown
[Little et al. "Parallel Optical Flow Using Local Voting." IEEE/CVF International Conference on Computer Vision, 1988.](https://mlanthology.org/iccv/1988/little1988iccv-parallel/) doi:10.1109/CCV.1988.590023BibTeX
@inproceedings{little1988iccv-parallel,
title = {{Parallel Optical Flow Using Local Voting}},
author = {Little, James J. and Bülthoff, Heinrich H. and Poggio, Tomaso A.},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {1988},
pages = {454-459},
doi = {10.1109/CCV.1988.590023},
url = {https://mlanthology.org/iccv/1988/little1988iccv-parallel/}
}