期刊文献+

改进的立体像对稠密匹配算法 被引量:5

Improved image dense stereo matching algorithm
下载PDF
导出
摘要 针对目前主流方法对图像中纹理单一区域匹配效果不佳的问题,提出了一种改进的立体像对稠密匹配算法。该算法首先利用区域增长技术找到图像中的纹理单一区域,然后将整个区域作为匹配基元以得到纹理单一区域的稠密视差图。相对于点基元,区域基元包含的信息更多,且在图像中不易重复出现,因此可以减少误匹配发生的几率。在国际标准测试图像上进行了实验,结果证明该算法的可行性与准确性。 To obtain better disparity result of the less textured area of image, an improved dense stereo matching algorithm is proposed. First, the image is divided into several less textured or well textured areas based on region-growing strategy. Then, the dense disparity map of the less textured area is identified through the matching based on the whole region. Compared to pixel, a region contains more information and repeats seldom occur, thus reducing the probability of matching error. The proposed algorithm was tested with the international standard image data and compared with several existing algorithms. Experiment results show that the performance of the improved algorithm is better in handling less textured area and can be use in practice.
出处 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2010年第1期212-217,共6页 Journal of Jilin University:Engineering and Technology Edition
基金 '863'国家高技术研究发展计划项目(2006AA10Z233) 国家自然科学基金项目(60773082/F0205) 重庆市自然科学基金项目(CSTC2006BB2229)
关键词 计算机应用 计算机视觉 立体匹配 基于区域的匹配 纹理单一 视差计算 computer application computer vision stereo matching matching based on region less textured disparity computation
  • 相关文献

参考文献10

  • 1Lhuillier M, Quan L. Match propagation for imagebased modeling and rendering[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002, 24(8): 1140-1146. 被引量:1
  • 2周秀芝,文贡坚,王润生.自适应窗口快速立体匹配[J].计算机学报,2006,29(3):473-479. 被引量:32
  • 3Barnard S T. Stochastic stereo matching over scale [J]. International Journal of Computer Vision, 1989, 3(1): 17-32. 被引量:1
  • 4Boykov Y, Veksler O, Zabih R. Fast approximate energy minimization via graph cuts[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001, 23(11): 1222-1239. 被引量:1
  • 5KolmogoroV V, Zabih R. What energy functions can be minimized via graph cuts? [C]//European Conference on Computer Vision, 2002:185-208. 被引量:1
  • 6彭启民,贾云得.一种基于最小割的稠密视差图恢复算法[J].软件学报,2005,16(6):1090-1095. 被引量:7
  • 7Lhuillier M, Quan L. A quasi-dense approach to surface reconstruction from unealibrated images[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005, 27(3): 418-433. 被引量:1
  • 8Quan L, Tan P, Zeng G, et al. Image-based plant modeling [J]. ACM Transactions on Graphics, 2006, 25(3): 599-604. 被引量:1
  • 9Haralick R M, Shanmugam K, Dinstein I H. Textural features for image classification[J]. IEEE Transactions on Systems, Man, and Cybernetics, 1973,3(6): 610-621. 被引量:1
  • 10Scharstein D, Szeliski R. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms[J]. International Journal of Computer Vision, 2002, 47(1-3): 7-42. 被引量:1

二级参考文献19

  • 1吴翊 李永乐 等.应用数理统计[M].长沙:国防科技大学出版社,1997.135-144. 被引量:7
  • 2Szeliski R, Zabih R. An experimental comparison of stereo algorithms. In: Proc. of the Int'l Workshop on Vision Algorithms:Theory and Practice table of contents LNCS 1883, London: Springer-Verlag, 1999. 1-19. 被引量:1
  • 3Boykov Y, Veksler O, Zabih R. Markov random fields with efficient approximations. In: Proc. of the IEEE Computer Society Conf.on Computer Vision and Pattern Recognition. Washington, DC: IEEE Computer Society, 1998. 648-655. 被引量:1
  • 4Ishikawa H. Global optimization using embedded graphs [Ph.D. Thesis]. New York: University of New York, 2000. 被引量:1
  • 5Kolmogorov V, Zabih R. Computing visual correspondence with occlusions using graph cuts. In:Proc. of the Int'l Conf. on Computer Vision (ICCV 2001), Vol.Ⅱ, 2001. 508-515. 被引量:1
  • 6Geiger D, Ladendorf B, Yuille A. Occlusions and binocular stereo. Int'l Journal of Computer Vision, 1995,14(3):211-226. 被引量:1
  • 7Bobick AF, Sintille S. Large occlusion stereo. Int'l Journal of Computer Vision, 1999,33(3): 1-20. 被引量:1
  • 8Veksler O. Efficient graph-based energy minimization methods in computer vision [Ph.D. Thesis]. Cornell University, 1999. 被引量:1
  • 9Cook W J, Cunningham WH, Pulleyblank WR. Combinatorial Optimization. John Wiley & Sons, 1998. 被引量:1
  • 10Boykov Y, Jolly MP. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In: Proc. of the Int'l Conf. on Computer Vision (ICCV 2001). 2001. 105-112. 被引量:1

共引文献34

同被引文献27

  • 1唐丽,吴成柯,刘侍刚,颜尧平.基于区域增长的立体像对稠密匹配算法[J].计算机学报,2004,27(7):936-943. 被引量:27
  • 2周秀芝,文贡坚,王润生.自适应窗口快速立体匹配[J].计算机学报,2006,29(3):473-479. 被引量:32
  • 3Schafer R. Review and future directions for 3D-video [C] // Proceedings of the Picture Coding. Beijing, China.2006 : 1-11. 被引量:1
  • 4Larsen E S, Mordohai P, PolIefeys M, et al. Tem- porally consistent reconstruction from multiple video streams using enhanced belief propagation [C]// IEEE Int Conf on Computer Vision (ICCV)-2007, Rio de Janeiro, Brasil, 2007. 被引量:1
  • 5Shawn Lankton. 3D vison with stereo disparity[EB/ OL]. [2010-11 ]. http://www, shawnlankton. com/. 被引量:1
  • 6Bleyer M, Gelautz M. A layered stereo matching al- gorithm using image segmentation and global visibil- ity constraints[J]. ISPRS Journal of Photogramme- try and Remote Sensing, 2005,59(3) : 128-150. 被引量:1
  • 7Lee S, Oh K, Ho Y. Segment-based multi-view depth map estimation using belief propagation from dense multi-view video[C]//IEEE 3D-TV Conf, Is- tanbul, Turkey, 2008. 被引量:1
  • 8Comaniciu D, Meer P. Mean shift: a robust ap- proach toward feature space analysis [J]. PAMI, 2002,24(5) :603-619. 被引量:1
  • 9KANADE T, OKUTOMI M. A stereo matching algorithm with anadaptive window: Theory and experiment[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1994, 16(9):920-932. 被引量:1
  • 10ROY S, COX I. J. Amaximum-flow formulation of the N- camerastereo correspondence problem[C]. IEEE Proceedings of International Conference on Computer Vision, Bombai, 1998:492-499. 被引量:1

引证文献5

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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