Academic Journals Database
Disseminating quality controlled scientific knowledge

Stereo Matching for Dynamic Programming on TRIZ

ADD TO MY LIST
 
Author(s): Yu Shuchun | Yu Xiaoyang | Hu Lijuan | Yu Guang | Han Liang Liang | Wang Heng

Journal: Information Technology Journal
ISSN 1812-5638

Volume: 11;
Issue: 7;
Start page: 891;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: dynamic programming | stereo matching | TRIZ Theory | ground control points

ABSTRACT
To solve the contradiction between matching precision and matching speed in stereo matching for dynamic programming, TRIZ theory was introduced. After locating the contradiction in 39 contradiction matrix and getting the solutions for the matrix, we get the TRIZ advice. With this guidance, we apply the pyramid algorithm on low resolution images and adopt bidirectional dynamic programming strategy on disparity space image to speed DP process and then the ground control points were attained. Experimental results showed that the proposed method in the paper has higher matching precision with less time.
Save time & money - Smart Internet Solutions     

Tango Jona
Tangokurs Rapperswil-Jona