Segment-based stereo matching using graph cuts

DMCA

Segment-based stereo matching using graph cuts (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Li Hong , George Chen

Citations:

79 - 0 self

BibTeX

@INPROCEEDINGS{Hong04segment-basedstereo,
    author = {Li Hong and George Chen},
    title = {Segment-based stereo matching using graph cuts},
    booktitle = {},
    year = {2004},
    pages = {74--81}
}

OpenURL

Abstract

In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments and the scene structure is represented as a set of planes in the disparity space. The stereo matching problem is formulated as an energy minimization problem in the segment domain instead of the traditional pixel domain. Graph cuts technique is used to fast approximate the optimal solution, which assigns the corresponding disparity plane to each segment. Experiments demonstrate that the performance of our algorithm is comparable to the state-ofthe-art stereo algorithms on various data sets. Furthermore, strong performance is achieved in the conventionally difficult areas such as: textureless regions, disparity discontinuous boundaries and occluded portions. 1.

Keyphrases

graph cut segment-based stereo scene structure segment domain disparity discontinuous boundary traditional pixel domain optimal solution non-overlapping homogeneous segment difficult area state-ofthe-art stereo algorithm strong performance textureless region occluded portion various data set graph cut technique corresponding disparity plane disparity space reference image energy minimization problem new segment-based stereo stereo matching problem

DMCA