By Topic

Computation of optical flow using basis functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rakshit, S. ; Centre for Artificial Intelligence & Robotics, Bangalore, India ; Anderson, C.H.

The issues governing the computation of optical flow in image sequences are addressed. The trade-off between accuracy versus computation cost is shown to be dependent on the redundancy of the image representation. This dependency is highlighted by reformulating Horn's (1986) algorithm, making explicit use of the approximations to the continuous basis functions underlying the discrete representation. The computation cost of estimating optical flow, for a fixed error tolerance, is shown to be a minimum for images resampled at twice the Nyquist rate. The issues of derivative calculation and multiresolution representation are also briefly discussed in terms of basis functions and information encoding. A multiresolution basis function formulation of Horn's algorithm is shown to lead to large improvements in dealing with high frequencies and large displacements

Published in:

Image Processing, IEEE Transactions on  (Volume:6 ,  Issue: 9 )