Stereo matching using belief propagation

Jian Sun, Heung Yeung Shum, Nan Ning Zheng

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

97 Citations (Scopus)

Abstract

In this paper, we formulate the stereo matching problem as a Markov network consisting of three coupled Markov random fields (MRF’s). These three MRF’s model a smooth field for depth/disparity, a line process for depth discontinuity and a binary process for occlusion, respectively. After eliminating the line process and the binary process by introducing two robust functions, we obtain the maximum a posteriori (MAP) estimation in the Markov network by applying a Bayesian belief propagation (BP) algorithm. Furthermore, we extend our basic stereo model to incorporate other visual cues (e.g., image segmentation) that are not modeled in the three MRF’s, and again obtain the MAP solution. Experimental results demonstrate that our method outperforms the state-of-art stereo algorithms for most test cases.

Original languageEnglish
Title of host publicationComputer Vision - 7th European Conference on Computer Vision, ECCV 2002, Proceedings
EditorsAnders Heyden, Gunnar Sparr, Mads Nielsen, Peter Johansen
PublisherSpringer Verlag
Pages510-524
Number of pages15
ISBN (Print)9783540437444
DOIs
Publication statusPublished - 2002
Externally publishedYes
Event7th European Conference on Computer Vision, ECCV 2002 - Copenhagen, Denmark
Duration: 28 May 200231 May 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2351
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th European Conference on Computer Vision, ECCV 2002
Country/TerritoryDenmark
CityCopenhagen
Period28/05/0231/05/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

Fingerprint

Dive into the research topics of 'Stereo matching using belief propagation'. Together they form a unique fingerprint.

Cite this