loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06)
Stereo Matching with Color-Weighted Correlation, Hierachical Belief Propagation and Occlusion Handling
New York, NY
June 17-June 22
ISBN: 0-7695-2597-0
Q?ngxiong Yang, University of Kentucky
Liang Wang, University of Kentucky
Ruigang Yang, University of Kentucky
Henrik Stewenius, University of Kentucky
David Nister, University of Kentucky
In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matching stereo model based on an energy- minimization framework. The global energy contains two terms, the data term and the smoothness term. The data term is first approximated by a color-weighted correlation, then refined in occluded and low-texture areas in a repeated application of a hierarchical loopy belief propagation algorithm. The experimental results are evaluated on the Middlebury data set, showing that our algorithm is the top performer.
Citation:
Q?ngxiong Yang, Liang Wang, Ruigang Yang, Henrik Stewenius, David Nister, "Stereo Matching with Color-Weighted Correlation, Hierachical Belief Propagation and Occlusion Handling," cvpr, vol. 2, pp.2347-2354, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.