Fast Computation of a Boundary Preserving Estimate of Optical Flow

In this study we seek a fast method for robust, boundary preserving estimation of optical flow. Several studies have addressed this topic and proposed methods that account for velocity boundaries at the cost of significant computational complexity. The answer we bring consists of adapting the benchmark algorithm of Horn and Schunck such that it produces robust boundary preserving estimates, while retaining its simplicity and speed of execution. Experimental verification on real image sequences is conducted.

• Type: Conference
• Year: 2000
• Where: BMVC
• Authors: Rosario El-Feghali, Amar Mitiche
• Keywords: BMVC 2000, Boundary Preserving Estimates, Boundary Preserving Estimation, Computer Vision, Significant Computational Complexity