期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于限制搜索空间的快速立体匹配方法 被引量：2

Fast stereo matching algorithm based on limited search space
下载PDF
导出
摘要 为快速而准确地得到稠密视差图,提出了一种基于限制搜索空间的动态规划立体匹配算法。该算法以动态规划立体匹配方法为基础,通过初始匹配序列限制搜索空间以减少搜索变量个数。同时,提出一种基于自适应权重的多窗口累积策略来提高匹配精度,并在平滑性限制中引入亮度梯度以避免在物体边界的视差不连续处产生过度惩罚。实验结果表明,该匹配算法在匹配速度和匹配精度上都有很大的提高,是一种简单有效的立体匹配算法。 A fast stereo matching algorithm based on dynamic programming on limited search space is proposed to attain an accurate dense disparity map. The proposed algorithm is built on the base of dynamic programming for stereo matching and it limits the search space by an initial match sequence to reduce the number of vertices to be expanded. The multi-window aggregation strategy based on adaptive weight is proposed to improve the matching accuracy. The brightness gradient is integrated into the smoothness constraints to avoid over-punishment on disparity discontinuity on object boundary. Experimental results show that the matching speed and accuracy of the proposed algorithm are greatly improved, and the algorithm is simple and effective for stereo matching.
作者 门朝光 边继龙 李香
机构地区 哈尔滨工程大学计算机科学与技术学院
出处 《吉林大学学报（工学版）》 EI CAS CSCD 北大核心 2012年第2期423-428,共6页 Journal of Jilin University:Engineering and Technology Edition
基金 国家自然科学基金项目(61100004) 中央高校基本科研业务费专项资金项目(HEUCF100607)
关键词 计算机应用 立体匹配 动态规划 视差估计 搜索空间 computer application stereo matching dynamic programming disparity estimation search space
分类号 TP391.41 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献10

  • 1Scharstein D,Szeliski R.A taxonomy and evalua-tion of dense two-frame stereo correspondence algo-rithms[J].International Journal of Computer Vi-sion,2002,47(1-3):7-42.
  • 2Yoon K J,Kweon S.Adaptive support-weight ap-proach for correspondence search[J].IEEE Trans-actions on Pattern Analysis and Machine Intelli-gence,2006,28(4):650-656.
  • 3De-maeztu L,Villanueva A,Cabeza R.Stereo matc-hing using gradient similarity and locally adaptivesupport-weight[J].Pattern Recognition Letters,2011,32(13):1643-1651.
  • 4Geiger D,Ladendorf B,Yuille A.Occlusions andbinocular stereo[J].International Journal of Com-puter Vision,1995,14(3):211-226.
  • 5Cox I J,Hingorani S L,Rao S B,et al.A maxi-mum likelihood stereo algorithm[J].Computer Vi-sion Image Understanding,1996,63(3):542-567.
  • 6Birchfield S,Tomasi C.Depth discontinuities bypixel-to-pixel stereo[J].International Journal ofComputer Vision,1999,35(3):269-293.
  • 7Bobick A F,Intille S S.Large occlusions stereo[J].International Journal of Computer Vision,1999,33(3):181-200.
  • 8刘赫伟,汪增福.一种沿区域边界的动态规划立体匹配算法[J].模式识别与人工智能,2010,23(1):38-44. 被引量：6
  • 9Boykov Y,Veksler O,Zabih R.Fast approximateenergy minimization via graph cuts[J].IEEE Trans-actions on Pattern Analysis and Machine Intelli-gence,2001,23(11):1222-1239.
  • 10Sun J,Zheng N N,Shum H Y.Stereo matching u-sing belief propagation[J].IEEE Transactions onPattern Analysis and Machine Intelligence,2003,25(7):787-800.

二级参考文献14

  • 1Scharstein D, Szeliski R. A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms. International Journal of Computer Vision, 2002, 47 ( 1 ) : 7 - 42.
  • 2Brown M Z, Burschka D, Hager G D. Advances in Computational Stereo. IEEE Trans on Pattern Analysis and Machine Intelligence, 2003, 25(8): 993-1008.
  • 3Bobick A F, Intille S S. Large Occlusion Stereo. International Journal of Computer Vision, 1999, 33(3) : 181 -200.
  • 4Wei Yichen, Quan Long. Region-Based Progressive Stereo Matching //Proc of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Washington, USA, 2004, Ⅱ: 106-113.
  • 5Tao H, Sawhney H, Kumar R. A Global Matching Framework for Stereo Computation// Proc of the 8th IEEE International Conference on Computer Vision. Vancouver, Canada, 2001, Ⅰ : 532 - 539.
  • 6Lin M H, Tomasi C. Surfaces with Occlusions from Layered Stereo. IEEE Trans on Pattern Analysis and Machine Intelligence, 2004, 26(8) : 1073 - 1078.
  • 7Comaniciu D, Meer P. Mean Shift : A Robust Approach toward Feature Space Analysis. IEEE Trans on Pattern Analysis and Machine Intelligence, 2002, 24 (5) : 603 - 619.
  • 8Birchfield S, Tomasi C. A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling. IEEE Trans on Pattern Analysis and Machine Intelligence, 1998, 20(4): 401 -406.
  • 9Middlebury College Stereo Vision Research Page [ EB/OL]. [2008- 09- 20]. http://vision. middlebury. edu/stereo.
  • 10Veksler O. Stereo Correspondence by Dynamic Programming on a Tree//Proc of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. San Diego, USA, 2005, Ⅱ: 384 - 390.

共引文献5

同被引文献21

  • 1于仕琪,刘瑞祯.学习OpenCV[M].北京:清华大学出版社,2009.
  • 2冈萨雷斯.数字图像处理[M].阮秋琦,译.北京:电子工业出版社,2011.
  • 3NING J F,ZHANG L,ZHANG D,et al. Robust Object Tracking Using Joint Color-texture Histogram[J]. International Jour- nal of Pattern Recognition and Artificial Intelligence, 2009(23): 1245-1262.
  • 4Neubeck A, Luc Van Gool. Efficient Non-maximum Suppression[C]. Hong Kong :International Conference on Pattern Recog- nition, 2006(3): 850-855.
  • 5Derpanis K G. The Harris Corner Detection[R]. York: York University, 2007.
  • 6Hsu C Y, Lu C S, Pei S C. Image Feature Extraction in Encrypted Domain With Privacy-preserving SIFT[J]. IEEE Transac- tions Image Process, 2012, 21: 4593-4607.
  • 7ZHANG Hui-juan, HU Qiong. Fast Image Matching Based-on Improved SURF Algorithm [C]. Shanghai: Tongji University, 2011.
  • 8ZHU Wen-qiao, LU Dong-ming, DIAO Chang-yu, et al. Variational Stereo Matching with Left Right Consistency Constraint [C]. Hangzhou : Zhengjiang University, 2011.
  • 9Del Bimbo A, Nesi P, Sanz J C. Optical Flow Computation Using Extended Constraints [J]. IEEE Transactions Image Process, 1996, 5(5) :720-39.
  • 10Sharstein D, Szeliski R. A taxonomy and evaluation of (lense two-frame stereo correspondence algorithms [J]. International Journal on Computer Vision, 2002, 47(1-3): 7-42.

引证文献2

二级引证文献1

吉林大学学报（工学版）
2012年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部