Local Stereo Matching with Adaptive and Rapid Cost Aggregation

Author

Li Li ; Cai-Ming Zhang

Author_Institution

Comput. Sci. & Technol. Dept., Shandong Univ., Jinan, China

Volume

2

fYear

2009

fDate

26-27 Aug. 2009

Firstpage

185

Lastpage

188

Abstract

This paper presents a new local binocular stereo matching algorithm. A local window with adaptive support weights is used to aggregate matching costs. A more robust matching score is set up combining sum of absolute intensity differences and a gradient based measure. Each pixel has a different disparity search range according to disparity gradient analysis and computational complexity decreases rapidly. Experimental results using the Middlebury stereo test bed demonstrate the validity of our presented approach.

Keywords

computational complexity; gradient methods; image matching; search problems; stereo image processing; adaptive cost aggregation; adaptive support weight; computational complexity; disparity search range; gradient based measure; image pixel; local binocular stereo matching; local window; rapid cost aggregation; sum of absolute intensity difference; Aggregates; Computational complexity; Computer science; Cost function; Equations; Intelligent systems; Layout; Man machine systems; Pixel; Stereo vision;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Human-Machine Systems and Cybernetics, 2009. IHMSC '09. International Conference on

Conference_Location

Hangzhou, Zhejiang

Print_ISBN

978-0-7695-3752-8

Type

conf

DOI

10.1109/IHMSC.2009.170

Filename

5336013