首页 | 本学科首页   官方微博 | 高级检索  
     

一种改进的快速立体匹配算法
引用本文:刘党辉,肖艳青,苏永芝,李智强.一种改进的快速立体匹配算法[J].新技术新工艺,2010(5):22-25.
作者姓名:刘党辉  肖艳青  苏永芝  李智强
作者单位:1. 装备指挥技术学院,北京,101416
2. 解放军63883部队,河南,洛阳,741000
基金项目:国家863计划支持项目 
摘    要:提出了一种改进的快速立体匹配算法。对于双目视觉系统采集的2幅图像,首先采用区域匹配算法进行初始快速立体匹配,再采用左右一致性检验剔除误匹配点,得到立体匹配的初始视差图。然后将初始视差作为图割法构图的限制条件,对初始视差图进行二值分割。最后对分割获得的前景区域和背景区域施加不同的限制,并通过修正能量函数,使构图网络大大减小,从而进一步提高了匹配速度。试验结果表明,该算法既提高了立体匹配速度,又保证了匹配精度。

关 键 词:区域匹配  图割法  视差图

An Improved Fast Stereo Matching Algorithm
LIU Danghui,XIAO Yanqing,SU Yongzhi,LI Zhiqiang.An Improved Fast Stereo Matching Algorithm[J].New Technology & New Process,2010(5):22-25.
Authors:LIU Danghui  XIAO Yanqing  SU Yongzhi  LI Zhiqiang
Affiliation:1. Academy of Equipment Command and Teehnology, Beijing 101416, China; 2. The Chinese PLA 63883 Troops, Luoyang 741000, China)
Abstract:An Improved fast stereo matching algorithm is presented in this paper. An area matching algorithm is used to perform stereo matching for two images captured from a stereo-vision system. And left-right conformity verification is adopted to further eliminate those mistaken matching points. Then the initial disparity map is segmented by an optimal threshold segmentation algorithm, and the background and foreground regions are obtained. Then the different limits for the background and foreground regions are used as a constraint condition of graph cuts matching algorithm and that reduce the scale of graphs heavily. The experimental results demonstrate that the proposed algorithm can improve stereo matching speed while keeping disparity precision.
Keywords:Area matching  Graph cuts  Disparity map
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号