计算机应用 ›› 2020, Vol. 40 ›› Issue (5): 1415-1420.DOI: 10.11772/j.issn.1001-9081.2019101771

• 虚拟现实与多媒体计算 • 上一篇    下一篇

基于图像分割的立体匹配算法

张一飞, 李新福, 田学东   

  1. 河北大学 网络空间安全与计算机学院,河北 保定 071000
  • 收稿日期:2019-10-18 修回日期:2019-12-10 出版日期:2020-05-10 发布日期:2020-05-15
  • 通讯作者: 李新福(1970—)
  • 作者简介:张一飞(1994—),男,河北石家庄人,硕士研究生,主要研究方向:智能图文处理; 李新福(1970—),男,河北保定人,教授,博士,主要研究方向:智能图文处理; 田学东(1963—),男,天津人,教授,博士,CCF会员,主要研究方向:模式识别、信息检索。
  • 基金资助:

    河北省教育厅高等学校科学技术研究重点项目(ZD2017209)。

Stereo matching algorithm based on image segmentation

ZHANG Yifei, LI Xinfu, TIAN Xuedong   

  1. School of Cyber Security and Computer, Hebei University, Baoding Hebei 071000, China
  • Received:2019-10-18 Revised:2019-12-10 Online:2020-05-10 Published:2020-05-15
  • Contact: LI Xinfu, born in 1970, Ph. D.,professor. His research interests include intelligent image and text processing.
  • About author:ZHANG Yifei,born in 1994,M. S. candidate. His research interests include intelligent image and text processing.LI Xinfu, born in 1970, Ph. D.,professor. His research interests include intelligent image and text processing.TIAN Xuedong,born in 1963,Ph. D.,professor. His research interests include pattern recognition, information retrieval.
  • Supported by:

    This work is partially supported by the Key Science and Technology Research Project in Colleges and Universities of Hebei Provincial Department of Education (ZD2017209).

摘要:

针对在立体匹配中弱纹理及纯色区域匹配不准确和图像分割算法耗时较多的问题,提出一种融合图像分割的立体匹配算法。首先,将初始图像进行高斯滤波和Sobel平滑的处理,获取图像的边缘特征图;然后,将原图的红、绿、蓝三个通道值采用最大类间方差法进行二分类,再融合得到分割模板图;最后,将所得到的灰度图、边缘特征图和分割模板图用于视差计算和视差优化的过程,计算得到视差图。相比绝对差值和(SAD)算法,所提算法在精度上平均提升了14.23个百分点,时间开销上平均每万个像素点只多消耗了7.16 ms。实验结果表明,该算法在纯色及弱纹理区域和视差不连续区域取得了更加平滑的匹配结果,在图像分割上能够自动计算阈值且能够较快地对图像进行分割。

关键词: 边缘特征, 图像分割, 弱纹理纯色区域, 二值化, 立体匹配

Abstract:

Aiming at the problem of inaccurate matching of weak texture and pure color region in stereo matching and long time consumption of image segmentation algorithms, a stereo matching algorithm fused with image segmentation was proposed. Firstly, the initial image was filtered by Gaussian and smoothed by Sobel to obtain the edge feature map of the image. Secondly, the red, green and blue channel values of the original image were dichotomized by using the Otsu method and then refused to obtain the segmentation template map. Finally, the obtained grayscale map, edge feature map and segmentation template map were applied in the parallax calculation and parallax optimization process in order to calculate the parallax map. The proposed algorithm has the accuracy improved by 14.23 percentage points on average with the time cost per 10 000 pixels increased by 7.16 ms in comparison with Sum of Absolute Differences (SAD) algorithm. The experimental results show that the proposed algorithm can obtain smoother matching results in pure color and weak texture regions and parallax discontinuity regions, and it can automatically calculate the threshold and segment the image faster.

Key words: edge feature, image segmentation, weak texture and pure color region, binarization, stereo matching

中图分类号: