| DOI | Resolve DOI: https://doi.org/10.1007/s11263-009-0223-3 |
|---|
| Author | Search for: Drouin, Marc-Antoine; Search for: Trudeau, Martin; Search for: Roy, Sébastien |
|---|
| Format | Text, Article |
|---|
| Subject | stereo; occlusion; multi-camera; dynamic programming |
|---|
| Abstract | 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. The proposed algorithm is not a stereo matcher on it own since it requires an initial disparity map. Nevertheless, it is a very effective way of improving the border localization of disparity maps obtained from a large class of stereo matchers. Whilst the proposed minimization strategy is particularly suitable for stereo with occlusion, it may be used for other labeling problems. |
|---|
| Publication date | 2009-07 |
|---|
| Publisher | Springer |
|---|
| In | |
|---|
| Language | English |
|---|
| Peer reviewed | Yes |
|---|
| NRC publication | This is a non-NRC publication"Non-NRC publications" are publications authored by NRC employees prior to their employment by NRC. |
|---|
| NPARC number | 23005013 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | a3350c9b-c3cd-414d-a044-450d424bd2e9 |
|---|
| Record created | 2019-02-12 |
|---|
| Record modified | 2020-04-16 |
|---|
