Parallel optical flow using local voting

James J. Little, Heinrich H. Bulthoff, Tomaso Poggio

Research output: Chapter in Book/Report/Conference proceedingConference contribution

24 Citations (Scopus)

Abstract

A parallel algorithm is described for computing optical flow from short-range motion. Regularizing optical flow computation leads to a formulation which minimizes matching error and, at the same time, maximizes smoothness of the optical flow. An approximation to the full regularization computation is developed in which corresponding points are found by comparing local patches of the images. Selection among competing matches is performed using a winner-take-all scheme. The algorithm accommodates many different image transformations uniformly, with similar results, from brightness to edges. The optical flow computed from 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 fine-grained 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, information from matching facilitates segmentation.

Original languageEnglish
Title of host publicationSecond Int Conf on Comput Vision
PublisherPubl by IEEE
Pages454-459
Number of pages6
ISBN (Print)0818608838
Publication statusPublished - 1988

Publication series

NameSecond Int Conf on Comput Vision

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Parallel optical flow using local voting'. Together they form a unique fingerprint.

Cite this