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 reg- ularity on the solution. Experiments demonstrate that the method is efficient and provides better results compared with other approaches.