Real-time stereo matching using orthogonal reliability-based dynamic programming
A novel algorithm is presented in this paper for estimating reliable stereo matches in real time. Based on the dynamic programming-based technique we previously proposed, the new algorithm can generate semi-dense disparity maps using as few as two dynamic programming passes. The iterative best path...
| Veröffentlicht in: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 16(2007), 3 vom: 24. März, Seite 879-84 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2007
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society |
| Schlagworte: | Evaluation Study Letter |
| Zusammenfassung: | A novel algorithm is presented in this paper for estimating reliable stereo matches in real time. Based on the dynamic programming-based technique we previously proposed, the new algorithm can generate semi-dense disparity maps using as few as two dynamic programming passes. The iterative best path tracing process used in traditional dynamic programming is replaced by a local minimum searching process, making the algorithm suitable for parallel execution. Most computations are implemented on programmable graphics hardware, which improves the processing speed and makes real-time estimation possible. The experiments on the four new Middlebury stereo datasets show that, on an ATI Radeon X800 card, the presented algorithm can produce reliable matches for 60% approximately 80% of pixels at the rate of 10 approximately 20 frames per second. If needed, the algorithm can be configured for generating full density disparity maps |
|---|---|
| Beschreibung: | Date Completed 03.07.2007 Date Revised 10.12.2019 published: Print Citation Status MEDLINE |
| ISSN: | 1941-0042 |