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

建筑物场景宽基线图像的准稠密匹配
引用本文:陈占军,戴志军,吴毅红.建筑物场景宽基线图像的准稠密匹配[J].计算机科学与探索,2010,4(12):1089-1100.
作者姓名:陈占军  戴志军  吴毅红
作者单位:1. 中国科学院,自动化研究所模式识别国家重点实验室,北京,100190
2. 中国科学院,自动化研究所模式识别国家重点实验室,北京,100190;中国科学院,软件研究所,人机交互技术与智能信息处理实验室,北京,100190
摘    要:室外建筑物纹理通常重复而且单一,在进行宽基线图像匹配时,得到的初始种子点匹配数量通常比较少,而且在匹配和扩散时存在匹配多义性问题,使得应用传统的宽基线准稠密匹配算法不能得到满意的结果。针对这一问题,提出了一种针对室外建筑物的宽基线图像准稠密匹配算法。算法从高斯差分空间提取最大稳定极值区域,以获取数量更多的初始种子点匹配;在仿射传递过程中,采用自适应支持加权计算匹配分数,去除匹配多义性问题。实验表明,提出的算法能获得比较满意的准稠密匹配结果。

关 键 词:宽基线图像  最大稳定极值区域  仿射传递  自适应支持加权
修稿时间: 

Quasi-dense Matching for Wide Baseline Images of Building Scene
CHEN Zhanjun,DAI Zhijun,WU Yihong.Quasi-dense Matching for Wide Baseline Images of Building Scene[J].Journal of Frontier of Computer Science and Technology,2010,4(12):1089-1100.
Authors:CHEN Zhanjun  DAI Zhijun  WU Yihong
Affiliation:1. National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China2. Intelligence Engineering Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
Abstract:Textures of outdoor buildings are generally repetitive and locally insufficient. Previous quasi-dense matching methods do not work well on such wide baseline images because the obtained initial seeds are not enough and have matching ambiguity when propagating. This paper proposes an efficient quasi-dense matching algorithm for wide baseline images of building scene, of which MSERDoG(maximally stable extremal regions on difference of Gaussian space) is given to obtain more initial seed matches, and then affine propagation with adaptive support- weight score is used to have better quasi-dense matches. Experiments demonstrate that the proposed algorithm is efficient and satisfactory.
Keywords:wide baseline images  maximally stable extremal regions on difference of Gaussian space (MSERDoG)  affine propagation  adaptive support-weight
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机科学与探索》浏览原始摘要信息
点击此处可从《计算机科学与探索》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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