Efficient path-based stereo matching with subpixel accuracy

This paper presents an efficient algorithm to achieve accurate subpixel matchings for calculating correspondences between stereo images based on a path-based matching algorithm. Compared with point-by-point stereo-matching algorithms, path-based algorithms resolve local ambiguities by maximizing the...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society. - 1996. - 41(2011), 1 vom: 15. Feb., Seite 183-95
1. Verfasser: Donate, Arturo (VerfasserIn)
Weitere Verfasser: Liu, Xiuwen, Collins, Emmanuel G
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2011
Zugriff auf das übergeordnete Werk:IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
Schlagworte:Journal Article Research Support, N.I.H., Extramural Research Support, U.S. Gov't, Non-P.H.S.
LEADER 01000caa a22002652 4500
001 NLM199035776
003 DE-627
005 20250211164407.0
007 cr uuu---uuuuu
008 231223s2011 xx |||||o 00| ||eng c
024 7 |a 10.1109/TSMCB.2010.2049839  |2 doi 
028 5 2 |a pubmed25n0663.xml 
035 |a (DE-627)NLM199035776 
035 |a (NLM)20570775 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Donate, Arturo  |e verfasserin  |4 aut 
245 1 0 |a Efficient path-based stereo matching with subpixel accuracy 
264 1 |c 2011 
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 02.05.2011 
500 |a Date Revised 14.01.2011 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a This paper presents an efficient algorithm to achieve accurate subpixel matchings for calculating correspondences between stereo images based on a path-based matching algorithm. Compared with point-by-point stereo-matching algorithms, path-based algorithms resolve local ambiguities by maximizing the cross correlation (or other measurements) along a path, which can be implemented efficiently using dynamic programming. An effect of the global matching criterion is that cross correlations at all pixels contribute to the criterion; since cross correlation can change significantly even with subpixel changes, to achieve subpixel accuracy, it is no longer sufficient to first find the path that maximizes the criterion at integer pixel locations and then refine to subpixel accuracy. In this paper, by writing bilinear interpolation using integral images, we show that cross correlations at all subpixel locations can be computed efficiently and, thus, lead to a subpixel accuracy path-based matching algorithm. Our results show the feasibility of the method and illustrate significant improvement over existing path-based matching methods 
650 4 |a Journal Article 
650 4 |a Research Support, N.I.H., Extramural 
650 4 |a Research Support, U.S. Gov't, Non-P.H.S. 
700 1 |a Liu, Xiuwen  |e verfasserin  |4 aut 
700 1 |a Collins, Emmanuel G  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society  |d 1996  |g 41(2011), 1 vom: 15. Feb., Seite 183-95  |w (DE-627)NLM098252887  |x 1941-0492  |7 nnns 
773 1 8 |g volume:41  |g year:2011  |g number:1  |g day:15  |g month:02  |g pages:183-95 
856 4 0 |u http://dx.doi.org/10.1109/TSMCB.2010.2049839  |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 41  |j 2011  |e 1  |b 15  |c 02  |h 183-95