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

基于灰度段的立体匹配算法
引用本文:周东翔,蔡宣平,孙茂印. 基于灰度段的立体匹配算法[J]. 软件学报, 2001, 12(7): 1101-1106
作者姓名:周东翔  蔡宣平  孙茂印
作者单位:国防科学技术大学电子科学与工程学院,
基金项目:高等学校骨干教师资助计划资助项目
摘    要:立体匹配一直是计算机视觉领域的一个中心研究问题.为了得到适用于IBR(image-basedrendering)技术中视图合成的比较精确的高密度视差图,提出了一种基于灰度段的立体匹配算法.该算法以灰度段作为匹配基元,并将应用于语音识别的DTW(dynamictimewarping)方法引入灰度段的匹配算法中.相对于点基元,灰度段基元覆盖的图像空间要大得多,且不易受噪声、光度变化等因素的影响,因此可以减少误匹配发生的几率,更容易进行匹配,比特征线段、二次曲线等匹配基元计算要简便得多.实验结果表明,该算法效果良好,具有实用价值.

关 键 词:立体匹配  灰度段  视差图  动态时间规整
文章编号:1000-9825200112(07)1101-06
收稿时间:1999-11-30
修稿时间:1999-11-30

A Stereo Matching Algorithm Based on Gray-Level Segments
ZHOU Dong xiang,CAI Xuan ping and SUN Mao yin. A Stereo Matching Algorithm Based on Gray-Level Segments[J]. Journal of Software, 2001, 12(7): 1101-1106
Authors:ZHOU Dong xiang  CAI Xuan ping  SUN Mao yin
Abstract:Stereo matching has long been one of the central research problems in computer vision. A stereo matching algorithm is proposed based on gray level segments in order to recover dense depth map for the application of view synthesis in IBR (image-based rendering). This algorithm uses gray level segments as elements to be matched, and introduces the principle of DTW (dynamic time warping), which applied for speech recognition, into the matching processes on the segments. Covering more image space than point elements, gray-level segments are less sensitive to noise and photometric variations and easier to be matched, and can reduce the false matching. Moreover, gray-level segments segments require less computational resources than feature-based line segments and conices. Experimental results show that this algorithm is effective and of great value to use.
Keywords:stereo matching   gray level segment   disparity map   dynamic time warping
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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