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...

Ausführliche Beschreibung

Bibliographische Detailangaben
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: Gong, Minglun (VerfasserIn)
Weitere Verfasser: Yang, Yee-Hong
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
LEADER 01000naa a22002652 4500
001 NLM16895284X
003 DE-627
005 20231223120250.0
007 tu
008 231223s2007 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0563.xml 
035 |a (DE-627)NLM16895284X 
035 |a (NLM)17357744 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Gong, Minglun  |e verfasserin  |4 aut 
245 1 0 |a Real-time stereo matching using orthogonal reliability-based dynamic programming 
264 1 |c 2007 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 03.07.2007 
500 |a Date Revised 10.12.2019 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a 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 
650 4 |a Evaluation Study 
650 4 |a Letter 
700 1 |a Yang, Yee-Hong  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 16(2007), 3 vom: 24. März, Seite 879-84  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:16  |g year:2007  |g number:3  |g day:24  |g month:03  |g pages:879-84 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 16  |j 2007  |e 3  |b 24  |c 03  |h 879-84