|Table of Contents|

Continuous Problem of Image Region Stereo Matching Algorithm(PDF)

南京师范大学学报（工程技术版）[ISSN:1006-6977/CN:61-1281/TN]

Issue:
2011年04期
Page:
47-52
Research Field:
Publishing date:

Info

Title:
Continuous Problem of Image Region Stereo Matching Algorithm
Author(s):
Xu Shanshan; Liu Yingan; Xu Sheng
College of Information Science and Technology,Nanjing Forestry University,Nanjing 210037,China
Keywords:
graph cut; continuity of image region; minimization of energy function; region matching; scale the window cost
PACS:
TP391.41
DOI:
-
Abstract:
Traditional graph cut algorithm to solve the binocular matching problem is time-consuming while it requires great precision． This paper proposes a new algorithm by which the minimum cut graph cut problem is converted into the greedy algorithm to reduce the complexity of the problem． At the same time as the transformed graph cut has a low effect in dealing with the image continuous problem，we propose the graph cuts combined with the region matching algorithm called GR( Graphic Cut in Region) algorithm． They not only apply the Graph cut algorithm theory to the stereo matching problem，but also use a new method which computes the initial disparity cost through scaling the SAD window and twice compute the window cost to improve the accuracy of the initial disparity． The experiments show that this new algorithm in image continuous region has a better effect，and significantly improves the accuracy of matching at this time，and also that the algorithm complexity is greatly reduced．

References:

［1］Hsieh Y C，D McKeown，F P Perlant． Performance evaluation of scene registration and stereomatching for car-tographic feature extraction［J］． IEEE Trans，1992，PAMI-14( 2) : 214-238．
［2］D Scharstein，R Szeliski． A taxonomy and evaluation of dense two-frame stereo correspondence algorithms［J］． Internation Journal of Computer Vision，2002， 47( 1) : 7-42．
［3］Sun Dongmei，Qiu Zhengding． A new non-rigid image matching algorithm using thin-plate spline［J］． Acta Electronica Sinica， 2002，30( 8) : 1 104-1 107．
［4］Boykov Y，Kolmogorov V． An experimental comparison of mincut /maxflow algorithms for energy minimization in vision［J］． IEEE Transon Pattern Analysis and Machine Intelligence，2004， 26( 9) : 1 124-1 137．
［5］王年，范益政，鲍文霞． 基于图割的图像匹配算法［J］． 电子学报， 2006， 34( 2) : 232-236． Wang Nian，Fan Yizheng，Bao Wenxia． Graph matching algorithm base on graph cut［J］． E-Journal， 2006， 34( 2) : 232-236． ( in Chinese)
［6］Alvarez L，Deriche R，S’anchez J，et al． Dense disparity map estimation respecting image derivatives: a PDE and scale-space based approach［J］． Journal of Visual Communication and Image Representation，2002，13( 1 /2) : 3-21．

Memo

Memo:
-
Last Update: 2013-03-21