Robust and efficient algorithms for optical flow computation

• Venue: ISCV '95 Proceedings of the International Symposium on Computer Vision
• Year: 1995

In this paper, we present two new, very efficient and accurate algorithms for computing optical flow. The first is a modified gradient-based regularization method, and the other is an SSD-based regularization method. To amend the errors in the image flow constraint caused by the discontinuities in the brightness function, we propose to selectively combine the image flow constraint and the contour-based flow constraint into the data constraint in a regularization framework. The image flow constraint is disabled in the neighborhood of discontinuities, while the contour-based flow constraint is active at discontinuity locations. To solve the linear system resulting from the regularization formulation, the incomplete Cholesky preconditioned conjugate gradient algorithm is employed, leading to an efficient algorithm. Our SSD-based regularization method uses the SSD measure as the data constraint in a regularization framework. The preconditioned nonlinear conjugate gradient with a modified search direction scheme is developed to minimize the resulting energy function. Experimental results for these two algorithms are given to demonstrate their performance.