期刊
SENSORS
卷 21, 期 18, 页码 -出版社
MDPI
DOI: 10.3390/s21186035
关键词
image matching; BRISK; color space; geometric mapping
资金
- JSPS KAKENHI [19H02408]
- Grants-in-Aid for Scientific Research [19H02408] Funding Source: KAKEN
The paper proposes a systematic algorithm that combines the SC-EABRISK and ATBB methods to address robustness, number of matches, and processing efficiency issues in image matching. Experimental results show that this algorithm is faster, provides more matches, and achieves higher matching precision compared to previous methods.
Matching local feature points is an important but crucial step for various optical image processing applications, such as image registration, image mosaicking, and structure-from-motion (SfM). Three significant issues associated with this subject have been the focus for years, including the robustness of the image features detected, the number of matches obtained, and the efficiency of the data processing. This paper proposes a systematic algorithm that incorporates the synthetic-colored enhanced accelerated binary robust invariant scalar keypoints (SC-EABRISK) method and the affine transformation with bounding box (ATBB) procedure to address these three issues. The SC-EABRISK approach selects the most representative feature points from an image and rearranges their descriptors by adding color information for more precise image matching. The ATBB procedure, meanwhile, is an outreach that implements geometric mapping to retrieve more matches from the feature points ignored during SC-EABRISK processing. The experimental results obtained using benchmark imagery datasets, close-range photos (CRPs), and aerial and satellite images indicate that the developed algorithm can perform up to 20 times faster than the previous EABRISK method, achieve thousands of matches, and improve the matching precision by more than 90%. Consequently, SC-EABRISK with the ATBB algorithm can address image matching efficiently and precisely.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据