Feature matching algorithm based on partial limitation search region

This paper proposes a feature matching algorithm for partial limitation search regions, which combines spatial constraints with local descriptors. Based on the ASIFT algorithm, this paper improves the defects of directly removing one-to-many and many-to-one feature points in the feature matching pha...

Full description

Saved in:
Bibliographic Details
Published inDiànzǐ jìshù yīngyòng Vol. 44; no. 8; pp. 130 - 133
Main Authors Zhang Zhenning, Li Zheng, Zheng Junwei
Format Journal Article
LanguageChinese
Published National Computer System Engineering Research Institute of China 01.08.2018
Subjects
ASIFT
feature matching
partial limitation
Online AccessGet full text
ISSN0258-7998
DOI10.16157/j.issn.0258-7998.174463

Cover

More Information
Summary:This paper proposes a feature matching algorithm for partial limitation search regions, which combines spatial constraints with local descriptors. Based on the ASIFT algorithm, this paper improves the defects of directly removing one-to-many and many-to-one feature points in the feature matching phase. Since many of these removed feature points can be properly matched,resulting match points less. This paper will find a new unmatched pair of points within the surrounding area of the matching pairs, and finally achieve the goal of raising the correct number of matches. Experiments show that the feature matching algorithm proposed in this paper can greatly increase the number of feature matching compared with the ASIFT algorithm.
ISSN:0258-7998
DOI:10.16157/j.issn.0258-7998.174463