期刊文献+

改进的ORB特征提取及描述算法 被引量:4

Improved ORB Feature Extraction and Description Algorithm
下载PDF
导出
摘要 针对传统ORB特征点提取分布密集的问题提出均匀化orb特征点提取以及针对经典二进制描述符鲁棒性差,特征点相似度高的问题提出使用局部差异二值(LBD)描述子,实现特征提取及匹配。首先构造图像金字塔,在金字塔每层使用四叉树的方法均匀提取特征点;之后采用LBD描述子,对特征点及其邻域采用网格的形式得到灰度和梯度信息,比较网格间的灰度和梯度信息;在提升辨别能力的同时,继承二进制描述子运行速度快和低存储的特点,最后在均匀化ORB特征点和LBD描述子的基础上对图像特征点进行提纯,匹配操作。实验结果表明,该方法计算的特征点更加均匀,区分度高,速度快,为后续的其他图像算法的应用提供了更加准确的匹配数据。 Aiming at the problems of dense distribution and uneven distribution of traditional ORB feature points extraction and the poor robustness and high similarity of feature points in classical binary descriptors, the homogenized ORB feature points extraction and its combination with local difference binary(LBD) descriptor were proposed to achieve feature extraction and matching. Firstly, an image pyramid is constructed and the quadtree method is used to extract feature points evenly in each layer of the pyramid. Then LBD descriptor was used to obtain the gray scale and gradient information of feature points and their neighborhoods in the form of grids, and the gray scale and gradient information between grids were compared. At the same time of improving the discrimination ability, the characteristics of fast running speed and low storage of binary descriptors are inherited. Finally, on the basis of homogenizing ORB feature points and LBD descriptor, the image feature points are purified and matched. Experimental results show that the feature points calculated by this method are more uniform, higher discrimination and faster, which provides more accurate matching data for subsequent applications of other image algorithms.
作者 秦志钢 QIN Zhigang(Hefei University of Technology,Anhui 230009,China)
机构地区 合肥工业大学
出处 《集成电路应用》 2022年第2期132-133,共2页 Application of IC
关键词 计算机工程 ORB 特征检测 LDB 描述子 图像匹配 computer engineering ORB feature detection LDB descriptor image matching
  • 相关文献

参考文献1

二级参考文献23

  • 1SZELISKI R. Video mosaics for virtual environments [J]. IEEE Computer Graphics and Applications, 1996, 16(2): 22-30.
  • 2LOWE D G. Object recognition from local scale-invariant features[C]. IEEE International Conference on Computer Vision, Kerkyra, Corfu, Greece, 1999, 2: 1150-1157.
  • 3LOWE D G. Distinctive image features from scale-invariant keypoints[J]. International Journal of Computer Vision, 2004 60(2): 91-110.
  • 4BROWN M and LOWED G. Automatic panoramic image stitching using invariant features[J]. International Journal of Computer Vision, 2007, 74(1): 59-73.
  • 5BAY H, TUYTELAARS T, and VAN Gool L. Surf: Speeded Up Robust Features[C]. European Conference on Computer Vision, Graz, Austria, 2006:404 417.
  • 6SILPA-ANAN C and HARTLEY R. Optimized KD-trees for fast image descriptor matching[C]. IEEE Conference oil Computer Vision and Pattern Recognition, Anchorage, AK, USA. 2008: 1-8.
  • 7MUJA M and LOWED G. Fast approximate nearest neighbors with automatic algorithm configuration[C]. The International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, Lisbon, Portugal, 2009: 331-340.
  • 8CALONDER M, LEPETIT V, STRECHA C, et al. Brief: binary robust independent elementary features]C]. European Conference on Computer Vision, Hersonissos, Heraklion, Crete, Greece, 2010: 778-792.
  • 9RUBLEE E, RABAUD V, KONOLIGE K, et al. ORB: an efficient alternative to SIFT or SURF[C]. IEEE International Conference on Computer Vision, Barcelona, Spain, 2011: 2564-2571.
  • 10LEUTENEGGER S, CHLI M, and SIEGWART R Y. BRISK: binary robust invariant scalable keypoints[C]. IEEE International Conference on Computer Vision, Barcelona, Spain, 2011: 2548-2555.

共引文献45

同被引文献53

引证文献4

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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