Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Parallel Optical Flow Using Local Voting

There are no MPG-Authors in the publication available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Little, J., Bülthoff, H., & Poggio, T. (1988). Parallel Optical Flow Using Local Voting. In Second International Conference on Computer Vision 1988 (pp. 454-459). Washington, DC, USA: IEEE Computer Society Press.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-EF31-1
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.