Minimal Surfaces for Stereo

DSpace/Manakin Repository

Minimal Surfaces for Stereo

Citable link to this page

 

 
Title: Minimal Surfaces for Stereo
Author: Cohen, Michael F.; Buehler, Chris; Gortler, Steven; McMillan, Leonard

Note: Order does not necessarily reflect citation order of authors.

Citation: Buehler, Chris, Steven J. Gortler, Michael F. Cohen, and Leonard McMillan. 2002. Minimal surfaces for stereo. In Proceedings of the Seventh European Conference on Computer Vision (ECCV), Copenhagen, Denmark, May 28-31, 2002, ed. European Conference on Computer Vision and Anders Heyden, 1-14. Lecture Notes In Computer Science 2352. Berlin: Springer.
Full Text & Related Files:
Abstract: Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorithmic approaches. These approaches include techniques such as dynamic programming min-cut and alpha-expansion. In this paper we show how an algorithmic technique that constructs a discrete spatial minimal cost surface can be brought to bear on stereo global minimization problems. This problem can then be reduced to a single min-cut problem. We use this approach to solve a new global minimization problem that naturally arises when solving for three-camera (trinocular) stereo. Our formulation treats the three cameras symmetrically, while imposing a natural occlusion cost and uniqueness constraint.
Published Version: http://dx.doi.org/10.1007/3-540-47977-5_58
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:2634284
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters