Disparity and Optical Flow Partitioning Using Extended Potts Priors

This paper addresses the problems of disparity and optical flow partitioning based on the brightness invariance assumption. We investigate new variational approaches to these problems with Potts priors and possibly box constraints. For the optical flow partitioning, our model includes vector-valued data and an adapted Potts regularizer. Using the notation of asymptotically level stable functions we prove the existence of global minimizers of our functionals. We propose a modified alternating direction method of minimizers. This iterative algorithm requires the computation of global minimizers of classical univariate Potts problems which can be done efficiently by dynamic programming. We prove that the algorithm converges both for the constrained and unconstrained problems. Numerical examples demonstrate the very good performance of our partitioning method

Disparity and optical flow partitioning using extended Potts priors

This paper addresses the problems of disparity and optical flow partitioning based on the brightness invariance assumption. We investigate new variational approaches to these problems with Potts priors and possibly box constraints. For the optical flow partitioning, our model includes vector-valued data and an adapted Potts regularizer. Using the notion of asymptotically level stable (als) functions, we prove the existence of global minimizers of our functionals. We propose a modified alternating direction method of multipliers. This iterative algorithm requires the computation of global minimizers of classical univariate Potts problems which can be done efficiently by dynamic programming. We prove that the algorithm converges both for the constrained and unconstrained problems. Numerical examples demonstrate the very good performance of our partitioning method

A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation

International audienceProximal splitting algorithms play a central role in finding the numerical solution of convex optimization problems. This paper addresses the problem of stereo matching of multi-component images by jointly estimating the disparity and the illumination variation. The global formulation being non-convex, the problem is addressed by solving a sequence of convex relaxations. Each convex relaxation is non trivial and involves many constraints aiming at imposing some reg- ularity on the solution. Experiments demonstrate that the method is efficient and provides better results compared with other approaches

A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation

Abstract Proximal splitting algorithms play a central role in finding the numerical solution of convex optimization problems. This paper addresses the problem of stereo matching of multi-component images by jointly estimating the disparity and the illumination variation. The global formulation being non-convex, the problem is addressed by solving a sequence of convex relaxations. Each convex relaxation is non trivial and involves many constraints aiming at imposing some regularity on the solution. Experiments demonstrate that the method is efficient and provides better results compared with other approaches