Efficient Feature Matching For UAV Images Based On Compact GPU Data Scheduling
2025 Β· San Jiang, Kan You, Ruqin Zhou, et al.
Abstract
Feature matching dominates the time costs in structure from motion (SfM). The primary contribution of this study is a GPU data schedule algorithm for efficient feature matching of Unmanned aerial vehicle (UAV) images. The core idea is to divide the whole dataset into blocks based on matrix band reduction (MBR) and achieve efficient feature matching via GPU-accelerated cascade hashing. First, match pairs are selected by using an image retrieval technique, which converts images into global descriptors and searches high-dimension nearest neighbors with graph indexing. Second, compact image blocks are iteratively generated from a MBR-based data schedule strategy, which exploits image connections to generate image blocks and increase the usage of GPU computing power. Third, guided by the generated image blocks, feature matching is executed sequentially within the framework of GPU-accelerated cascade hashing, and initial candidate matches are refined by combining a local geometric constraint
Authors
(none)
Tags
Stats
Related papers
- Efficient Match Pair Retrieval For Large-scale UAV Images Via Graph Indexed Global Descriptor (2023)6.77
- GPU Accelerated Cascade Hashing Image Matching For Large Scale 3D Reconstruction (2018)0.00
- Uavpairs: A Challenging Benchmark For Match Pair Retrieval Of Large-scale UAV Images (2025)4.72
- Billion-scale Similarity Search With Gpus (2017)24.96
- Sparse-to-dense Hypercolumn Matching For Long-term Visual Localization (2019)12.99
- Pentagon-match (pmatch): Identification Of View-invariant Planar Feature For Local Feature Matching-based Homography Estimation (2023)0.00
- Hierarchical Image Matching For UAV Absolute Visual Localization Via Semantic And Structural Constraints (2025)0.00
- Fast, Compact And Highly Scalable Visual Place Recognition Through Sequence-based Matching Of Overloaded Representations (2020)9.41