全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

针对图像区域连续化问题的立体匹配算法

, PP. 47-52

Keywords: 图割,图像区域连续化,能量函数最小化,区域匹配,窗口单位化

Full-Text   Cite this paper   Add to My Lib

Abstract:

传统图割算法解决双目立体匹配问题,在高精度的同时需要消耗大量时间.提出一种新的算法,将最小割求取问题转化为贪心问题,从而降低算法复杂度.由于转化后的图割在处理图像区域连续化问题时效率低下,给出了图割与区域匹配相结合的GR(GraphicCutinRegion)算法,算法不仅将图割理论运用到立体匹配问题中,且在求取初始视差时提出了用窗口单位化匹配代价算法来提高初始视差的精度.实验证明,该算法在图像区域连续化时有较好的效果,明显提高了匹配的精度,且复杂度也大大降低.

References

[1]  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.
[2]  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.
[3]  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.
[4]  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.
[5]  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.
[6]  王年,范益政,鲍文霞. 基于图割的图像匹配算法[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)

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133