arrow
Return

A Feature Points Extraction Algorithm Based on Adaptive Information Entropy

delete2020-01-01
delete8
delete
OA
AI
D
Dan Yin
Z
Zhou Si-wei
王朋成 cover
王朋成 (Pengcheng Wang)
M
Manling Lin
H
Hui Song
柯峰 cover
柯峰 (Feng Ke) *
K
Kaiqing Luo *
DOI:10.1109/ACCESS.2020.3008457delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Feature points loss and images mismatch in the variation of light intensity, weak texture and large angle rotation for the feature points extraction of ORB-SLAM2 are severe. To deal with the problem, a feature points extraction algorithm based on adaptive information entropy, i.e., Adaptive Information Entropy Feature (AIEF) algorithm is proposed. According to the information entropy, the image blocks with less information are removed and those with more texture image information and larger gradient are selected. Then an adaptive algorithm is used to automatically calculate the optimal threshold of the image information entropy. The image blocks are homogenized to avoid that the extracted feature points are too dense and getting stuck is prevented, which makes the algorithm more robust. Finaly validation is performed using the Oxford standard data set and the performances of the AIEF algorithm are compared with those of the SIFT, SURF, and ORB-SLAM2 algorithms. Experimental results on the Oxford standard data set demonstrate that the AIEF algorithm outperforms the traditional counterparts in terms of processing time, number of feature points, correct matching number and correct matching rate.
Keywords:
Adaptive algorithm
information entropy
image matching
feature extraction
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.7W
Citations:
29.4W

Organization

S
south china normal university
Scholars:
2.0W
Papers: 1.3W
Citations: 13
S
south china university of technology
Scholars:
6.7W
Papers: 5.0W
Citations: 85