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

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 27(2005), 6 vom: 10. Juni, Seite 998-1003
1. Verfasser: Gong, Minglun (VerfasserIn)
Weitere Verfasser: Yang, Yee-Hong
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
LEADER 01000naa a22002652 4500
001 NLM155846442
003 DE-627
005 20231223073004.0
007 tu
008 231223s2005 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0520.xml 
035 |a (DE-627)NLM155846442 
035 |a (NLM)15943431 
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 Fast unambiguous stereo matching using reliability-based dynamic programming 
264 1 |c 2005 
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 05.07.2005 
500 |a Date Revised 10.12.2019 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a 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 
650 4 |a Evaluation Study 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Yang, Yee-Hong  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 27(2005), 6 vom: 10. Juni, Seite 998-1003  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:27  |g year:2005  |g number:6  |g day:10  |g month:06  |g pages:998-1003 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 27  |j 2005  |e 6  |b 10  |c 06  |h 998-1003