Solving Stereo Matching Problems using Interior Point Methods


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… (More)

6 Figures and Tables


  • Presentations referencing similar topics