Abstract
Rapid advancement in remote sensing sensors has resulted in an enormous increase in the use of satellite imagery (SI) and images taken from unmanned aerial vehicles (UAVs) in a wide range of remote sensing applications. These applications include urban planning, environment monitoring, map updating, change detection, and precision agriculture. This paper focuses on an agricultural application of SI and UAV images. SI-UAV images possess high temporal, textural, and intensity differences due to rapid changes in agricultural crops with the passage of time. Feature points such as scale invariant feature transform (SIFT), oriented FAST and rotated BRIEF (ORB), and speeded-up robust features (SURF) are not invariant to such differences and underperform in SI-UAV image registration. To deal with this problem, we propose a new method that combines the strength of nearest neighbor (NN) and brute force (BF) descriptor matching strategies to register SI?UAV images. The proposed method is named NN-BF. For NN-BF first corresponding feature point descriptor matches are identified between SI-UAV images of the training set with overlap error. Then the corresponding descriptors are matched with the descriptors of SI images of the test set with NN strategy. The resulting descriptor matches are then further matched with the descriptors of UAV images of the test set using BF strategy. Finally, the descriptor matches obtained are processed with RANSAC to remove outliers and estimate a homography for image registration. Experiments are performed on an agricultural land image dataset. The experimental results show that the NN-BF method improves SIFT, SURF, and ORB feature point performances and also outperforms recently proposed feature matching strategies for remote sensing images. SIFT on average obtains 6.1% and 18.9% better precision scores than SURF and ORB with NN-BF, respectively. SIFT also obtains lower root mean square error than SURF and ORB with NN-BF.
Highlights
Image registration deals with the stitching of two images, taken from different viewpoints, at different times or by different sensors [1, 2]
We propose a new method that combines the strength of nearest neighbor (NN) and brute force (BF) descriptor matching strategies for satellite imagery (SI)-unmanned aerial vehicles (UAVs) image registration
This paper presents a new method for registration between SI-UAV images of agricultural land
Summary
Image registration deals with the stitching of two images (reference and target), taken from different viewpoints, at different times or by different sensors [1, 2]. Feature points such as scale invariant feature transform (SIFT) [23], oriented FAST and rotated BRIEF (ORB) [24], speeded-up robust features (SURF) [25], binary robust invariant scalable keypoints (BRISK) [26], and accelerated (A)-KAZE [27] are not invariant to such differences and underperform in the SI-UAV image registration task To overcome this problem, we propose a new method that combines the strength of nearest neighbor (NN) and brute force (BF) descriptor matching strategies for SI-UAV image registration. The proposed NN-BF method is a feature point-based approach It uses feature points such as SIFT, ORB, SURF, AKAZE, and BRISK without any modification and matches such feature points with a novel matching strategy to accurately register SI-UAV images despite high intensity, temporal, and textural differences. Homography H is known in advance between each SI-UAV image pair of the test set
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
