Solving Stereo Matching Problems Using Interior Point Methods

Loading...
Thumbnail Image
Penn collection
Lab Papers (GRASP)
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Contributor
Abstract

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.

Advisor
Date of presentation
2008-06-01
Conference name
Lab Papers (GRASP)
Conference dates
2023-05-17T03:19:03.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Published in: Arvind Bhusnurmath and Camillo J. Taylor. Solving Stereo Matching Problems Using Interior Point Methods. In Proceedings of the Fourth International Symposium on 3D Data Processing, Visualization and Transmission, 3DPVT, Stefan Gumhold, Jana Kosecka, Oliver Staadt, eds. June 2008. pp. 321-329.
Recommended citation
Collection