128 / 2022-10-21 14:21:56
E-OrbF A Robust Image Feature Matching Algorithm
Draft Pending
刘畅 / 长春理工大学
李华 / 长春理工大学
To improve the real-time performance and robustness of traditional feature matching algorithms, an improved image feature matching algorithm E-OrbF based on ORB and FREAK is proposed. In E-OrbF, the original FAST feature points in ORB algorithm are distributed unevenly and redundant. The strategy of subregion and local threshold is adopted to improve the uniform distribution and stability of feature points. Then simplify the sampling mode of FREAK algorithm and design a new feature descriptor. While improving the matching speed, the sampling point pairs are further filtered to improve the matching accuracy. Finally, combine RANSAC matching algorithm to eliminate mismatches and reduce the rate of mismatches. The experimental results show that the algorithm has good real-time performance, while under the conditions of perspective transformation, rotation scale, complex illumination and blur. Both of them can well complete feature detection and feature matching, and improve the robustness of existing methods. The algorithm can be applied to the fusion of virtual and real scenes on mobile terminals, and the average visual frame rate reaches 30 FPS, meeting the real-time requirements
Important Date
  • Conference Date

    Nov 18

    2022

    to

    Nov 20

    2022

  • Oct 25 2022

    Draft paper submission deadline

  • Nov 20 2022

    Final Paper Deadline

  • Nov 21 2022

    Registration deadline

Sponsored By
中国仿真学会
中国图象图形学会
中国计算机学会
Organized By
北京航空航天大学云南研究院
云南大学
云南艺术学院
昆明理工大学
Supported By
虚拟现实技术与系统国家重点实验室(北京航空航天大学)
北京市混合现实与新型显示工程技术研究中心(北京理工大学)
计算机辅助设计与图形学国家重点实验室(浙江大学)
文旅部闽台非遗文化数字化保护与智能处理文化和旅游部重点实验室(厦门大学)
云南省人工智能重点实验室(昆明理工大学)
Previous Conferences