摘要

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.

  • 出版日期2013-11

全文