Sciweavers

Share
CVPR
2006
IEEE

Improving Border Localization of Multi-Baseline Stereo Using Border-Cut

11 years 14 days ago
Improving Border Localization of Multi-Baseline Stereo Using Border-Cut
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a disparity label to every pixel of a disparity map, it associates a position to every disparity discontinuity. This formulation allows us to find an approximate solution to a 2D labeling problem with robust smoothing term by minimizing multiple 1D problems, thus making possible the use of dynamic programming. Dynamic programming allows the efficient computation of the visibility of most of the cameras during the minimization. Whilst the proposed minimization strategy is particularly suitable for stereo with occlusion, it may be used with other labeling problems.
Marc-Antoine Drouin, Martin Trudeau, Sébast
Added 12 Oct 2009
Updated 12 Oct 2009
Type Conference
Year 2006
Where CVPR
Authors Marc-Antoine Drouin, Martin Trudeau, Sébastien Roy
Comments (0)
books