Fast unambiguous stereo matching using reliability-based dynamic programming
An efficient unambiguous stereo matching technique is presented in this paper. Our main contribution is to introduce a new reliability measure to dynamic programming approaches in general. For stereo vision application, the reliability of a proposed match on a scanline is defined as the cost differe...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 27(2005), 6 vom: 10. Juni, Seite 998-1003 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2005
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
| Schlagworte: | Evaluation Study Journal Article Research Support, Non-U.S. Gov't |
| Zusammenfassung: | An efficient unambiguous stereo matching technique is presented in this paper. Our main contribution is to introduce a new reliability measure to dynamic programming approaches in general. For stereo vision application, the reliability of a proposed match on a scanline is defined as the cost difference between the globally best disparity assignment that includes the match and the globally best assignment that does not include the match. A reliability-based dynamic programming algorithm is derived accordingly, which can selectively assign disparities to pixels when the corresponding reliabilities exceed a given threshold. The experimental results show that the new approach can produce dense (> 70 percent of the unoccluded pixels) and reliable (error rate < 0.5 percent) matches efficiently (< 0.2 sec on a 2GHz P4) for the four Middlebury stereo data sets |
|---|---|
| Beschreibung: | Date Completed 05.07.2005 Date Revised 10.12.2019 published: Print Citation Status MEDLINE |
| ISSN: | 1939-3539 |