Optimizing motion estimation with linear programming and detail-preserving variational method

We propose a novel linear programming based method to estimate arbitrary motion from two images. The proposed method always finds the global optimal solution of the linearized motion estimation energy function and thus is much more robust than traditional motion estimation schemes. As well, the method estimates the occlusion map and motion field at the same time. To further reduce the complexity of even a complexity-reduced pure linear programming method we present a two-phase scheme for estimating the dense motion field. In the first step, we estimate a relatively sparse motion field for the edge pixels using a non-regular sampling scheme, based on the proposed linear programming method In the second step, we set out a detail-preserving variational method to upgrade the result into a dense motion field. The proposed scheme is much faster than a purely linear programming based dense motion estimation scheme. And, since we use a global optimization method - linear programming - in the first estimation step, the proposed two-phase scheme is also significantly more robust than a pure variational scheme.

[1]  Stephen T. Barnard,et al.  Stochastic stereo matching over scale , 1989, International Journal of Computer Vision.

[2]  Ingemar J. Cox,et al.  A maximum-flow formulation of the N-camera stereo correspondence problem , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[3]  João Paulo Costeira,et al.  A Global Solution to Sparse Correspondence Problems , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Nanning Zheng,et al.  Stereo Matching Using Belief Propagation , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Michael Werman,et al.  Real-time motion analysis with linear-programming , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[6]  Vladimir Kolmogorov,et al.  Multi-camera Scene Reconstruction via Graph Cuts , 2002, ECCV.

[7]  H. Ishikawa Global Optimization Using Embedded Graphs , 2000 .

[8]  Vladimir Kolmogorov,et al.  Computing visual correspondence with occlusions using graph cuts , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[9]  Berthold K. P. Horn,et al.  Determining Optical Flow , 1981, Other Conferences.

[10]  Michael Werman,et al.  Model Based Pose Estimator Using Linear-Programming , 2000, ECCV.

[11]  Joseph Naor,et al.  Approximation algorithms for the metric labeling problem via a new linear programming formulation , 2001, SODA '01.

[12]  Clark F. Olson Maximum-Likelihood Image Matching , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  David J. Fleet,et al.  Performance of optical flow techniques , 1994, International Journal of Computer Vision.

[15]  Azriel Rosenfeld,et al.  Accurate dense optical flow estimation using adaptive structure tensors and a parametric model , 2003, IEEE Trans. Image Process..

[16]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Takeo Kanade,et al.  An Iterative Image Registration Technique with an Application to Stereo Vision , 1981, IJCAI.