Date of this Version
This paper describes an approach to reformulating the stereo matching problem as a large scale Linear Program. The approach proceeds by approximating the match cost function associated with each pixel with a piecewise linear convex function. Regularization terms related to the first and second derivative of the disparity field are also captured with piecewise linear penalty terms. The resulting large scale linear program can be tackled using interior point methods and the associated Newton Steps involve matrices that reflect the structure of the underlying pixel grid. The proposed scheme effectively exploits the structure of these matrices to solve these linear systems efficiently.
Date Posted: 07 October 2009