期刊文献+

结合局部描述和拓扑约束的直线段匹配算法 被引量:4

A line matching algorithm combining local description with topological constraint
下载PDF
导出
摘要 针对弱纹理目标匹配问题,提出了一种基于直线局部邻域梯度信息和全局结构信息的直线匹配算法:对均值标准差直线描述符进行改进用于初始匹配;利用直线间的全局拓扑结构滤除误匹配;利用迭代拓扑滤波寻找更多的匹配,同时引入全局角度约束提高算法效率并进一步滤除错误匹配。实验表明,在光照变化、图像旋转、图像模糊、尺度变换、视点变化等条件下,该方法都具有很强的鲁棒性,并在匹配效率和准确度上优于现有的两种比较流行的方法。 In view of the matching problem of low texture objects,a line matching algorithm based on local neighboring gradient information and global structural information was proposed. The mean standard deviation line descriptor was redesigned to get the initial matching; the global topological structure between lines was used to get rid of wrong matches; more matches were achieved by utilizing the iterative topological filter.Moreover,global angle constrains were implemented to make the algorithm more efficient and to further remove wrong matches. Experiments show that the proposed algorithm is highly robust under various image changes including heavy illumination change,image rotation,image blur,scale change as well as viewpoint change and is much better than the other two popular methods in terms of matching accuracy and efficiency.
出处 《国防科技大学学报》 EI CAS CSCD 北大核心 2014年第6期25-30,共6页 Journal of National University of Defense Technology
基金 国家重点基础研究发展计划(973计划)资助项目(2013CB733100)
关键词 直线检测 直线描述 直线匹配 拓扑约束 line detection line descriptor line matching topological constraint
  • 相关文献

参考文献13

  • 1Lowe D G. Distinctive image features from scale-invariant key points[ J]. International Journal of Computer Vision, 2004, 60 (2): 91-110. 被引量:1
  • 2Bay H, Tuytelaars T, van Gool L. Surf: speeded up robust features[ C ]. Computer Vision - ECCV 2006, 2006, 3951 : 404 -417. 被引量:1
  • 3Calonder M, Lepetit V, Ozuysal M, et al. BRIEF : computing a local binary descriptor very fast [ J ]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2012, 34 (7): 1281 - 1298. 被引量:1
  • 4Rublee E, Rabaud V, Konolige K, et al. ORB : an efficient alternative to SIFT or SURF [ C ]. IEEE International Conference on Computer Vision, 2011:2564 - 2571. 被引量:1
  • 5Hartley R I. A linear method for reconstruction from lines and points [ C ]. IEEE Intemational Conference on Computer Vision, 1995 : 882 - 887. 被引量:1
  • 6Sehmid C, Zisserman A. The geometry and matching of lines and curves over multiple views [ J ]. International Journal of Computer Vision, 2000, 40(3 ) : 199 - 233. 被引量:1
  • 7Schmid C, Zisserman A. Automatic line matching across views[C]. IEEE Computer Soviety Conference on Computer Vision and Pattern Recognition, 1997:666 -671. 被引量:1
  • 8Lourakis M I A, Halkidis S T, Orphanoudakis S C. Matching disparate views of planar surfaces using projective invariants[J]. Image and Vision Computing, 2000, 18(9): 673 - 683. 被引量:1
  • 9Bay H, Ferrari V, van Gool L. Wide-baseline stereo matching with line segments[ C ]. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005, 1:329 -336. 被引量:1
  • 10Wang Z H, Wu F H, Hu Z Y. MSLD : a robust descriptor for line matching[ J]. Pattern Recognition, 2009, 42 ( 5 ) : 941 - 953. 被引量:1

同被引文献18

引证文献4

二级引证文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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