
	Information Technology Journal
	Year: 2012 \| Volume: 11 \| Issue: 7 \| Page No.: 891-897 DOI: 10.3923/itj.2012.891.897

Stereo Matching for Dynamic Programming on TRIZ

Yu Shuchun, Yu Xiaoyang, Hu Lijuan, Yu Guang, Han Liang Liang and Wang Heng

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.

PDF Fulltext XML References Citation Report Citation

RELATED ARTICLES:

•	Comparative Performance Analysis of Image Compression by JPEG 2000: A Case Study on Medical Images

•	A New Rapid Triangulation Method of Space Closed Point Cloud

•	Knapsack Based IR System for Bio-Medical Literature Using Similarity Based Clustering Approach

•	Optimal Continuous Cover Forest Management in an Uneven-Aged Forest in the North of Iran

How to cite this article:

Yu Shuchun, Yu Xiaoyang, Hu Lijuan, Yu Guang, Han Liang Liang and Wang Heng, 2012. Stereo Matching for Dynamic Programming on TRIZ. Information Technology Journal, 11: 891-897.

DOI: 10.3923/itj.2012.891.897

URL: https://scialert.net/abstract/?doi=itj.2012.891.897

COMMENT ON THIS PAPER

Navigation


		Online First
		Current Issue
		Previous Issues
		Editorial Board
		Submit a Manuscript
		Guide to Authors
		Subscribe to E-alerts

Indexed In


		ASCI-Database
		Asian Digital Library
		Google Scholar

Science Alert