Dense stereo matching over the Panum band

Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision, however, works over a narrow band of disparities-Panum's fusional band-whose typical range may be as little as 1/20 of the full range of disparities for...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1998. - 32(2010), 3 vom: 15. März, Seite 416-30
1. Verfasser: Agarwal, Ankur (VerfasserIn)
Weitere Verfasser: Blake, Andrew
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2010
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000caa a22002652 4500
001 NLM194366715
003 DE-627
005 20250211050556.0
007 cr uuu---uuuuu
008 231223s2010 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2008.298  |2 doi 
028 5 2 |a pubmed25n0648.xml 
035 |a (DE-627)NLM194366715 
035 |a (NLM)20075469 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Agarwal, Ankur  |e verfasserin  |4 aut 
245 1 0 |a Dense stereo matching over the Panum band 
264 1 |c 2010 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 10.03.2010 
500 |a Date Revised 15.01.2010 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision, however, works over a narrow band of disparities-Panum's fusional band-whose typical range may be as little as 1/20 of the full range of disparities for visible points. Only points inside the band are fused visually; the remainder of points are seen diplopically. A probabilistic approach is presented for dense stereo matching under the Panum band restriction. It is shown that existing dense stereo algorithms are inadequate in this problem setting and the main problem is segmentation, marking the image into the areas that fall inside the band. An approximation is derived that makes up for missing out-of-band information with a "proxy" based on image autocorrelation. It is shown that the Panum Proxy algorithm achieves accuracy close to what can be obtained when the full disparity band is available, and with gains of between one and two orders of magnitude in computation time. There are also substantial gains in computation space. Panum band processing is also demonstrated in an active stereopsis framework 
650 4 |a Journal Article 
700 1 |a Blake, Andrew  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1998  |g 32(2010), 3 vom: 15. März, Seite 416-30  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:32  |g year:2010  |g number:3  |g day:15  |g month:03  |g pages:416-30 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2008.298  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 32  |j 2010  |e 3  |b 15  |c 03  |h 416-30