2002
DOI: 10.1007/3-540-47977-5_58
|View full text |Cite
|
Sign up to set email alerts
|

Minimal Surfaces for Stereo

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 u… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

3
23
0

Year Published

2003
2003
2009
2009

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(26 citation statements)
references
References 16 publications
3
23
0
Order By: Relevance
“…It has long been recognized that multi-view matching can considerably improve the quality of the resulting disparity map [13,2,12]. This observation will be confirmed in this paper.…”
Section: Introductionsupporting
confidence: 76%
“…It has long been recognized that multi-view matching can considerably improve the quality of the resulting disparity map [13,2,12]. This observation will be confirmed in this paper.…”
Section: Introductionsupporting
confidence: 76%
“…Essentially the same result was rediscovered by Buehler et al [15,51,81]; see also recent results of Grady [52,53].…”
Section: Theorem 43 (Homological Maxflow/mincut)supporting
confidence: 56%
“…Among the area-based correlation approaches, the most closely related to our system is Sara's work [21], the classic real-time implementation of trinocular stereo [22], [23], and the recent improvements on correlation stereo by Hirschmuller et al [24]. Regarding trinocular stereo vision systems, we refer to the recently reported trinocular systems based on dynamic programming in [25] and [26].…”
Section: B Related Workmentioning
confidence: 99%