An Image Feature Matching Algorithm with Clustering Constraints
Aiming at the problem that the traditional ORB feature matching algorithm has many mismatches and poor robustness, a feature matching optimization algorithm with clustering constraints is proposed. Firstly, the K-means++ algorithm is used to assign classification labels to the feature points obtaine...
Gespeichert in:
Veröffentlicht in: | Journal of physics. Conference series 2023-08, Vol.2577 (1), p.12006 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Aiming at the problem that the traditional ORB feature matching algorithm has many mismatches and poor robustness, a feature matching optimization algorithm with clustering constraints is proposed. Firstly, the K-means++ algorithm is used to assign classification labels to the feature points obtained in the current image, and the clustering region is redivided. Secondly, the corresponding clustering region is found in the next picture, and the feature points in the region are also assigned classification labels. Then, the classification labels of feature points in the two images were compared during matching, and the inconsistent matching point pairs were removed. Finally, the RANSAC algorithm is used to optimize the matching results, and the results are verified. The results show that the proposed algorithm can effectively eliminate the false matching points, and the running speed is greatly improved. |
---|---|
ISSN: | 1742-6588 1742-6596 |
DOI: | 10.1088/1742-6596/2577/1/012006 |