GPU Accelerated Cascade Hashing Image Matching For Large Scale 3D Reconstruction

Abstract

Image feature point matching is a key step in Structure from Motion(SFM). However, it is becoming more and more time consuming because the number of images is getting larger and larger. In this paper, we proposed a GPU accelerated image matching method with improved Cascade Hashing. Firstly, we propose a Disk-Memory-GPU data exchange strategy and optimize the load order of data, so that the proposed method can deal with big data. Next, we parallelize the Cascade Hashing method on GPU. An improved parallel reduction and an improved parallel hashing ranking are proposed to fulfill this task. Finally, extensive experiments show that our image matching is about 20 times faster than SiftGPU on the same graphics card, nearly 100 times faster than the CPU CasHash method and hundreds of times faster than the CPU Kd-Tree based matching method. Further more, we introduce the epipolar constraint to the proposed method, and use the epipolar geometry to guide the feature matching procedure, which f

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyxu2018gpu

Related papers

• Efficient Feature Matching For UAV Images Based On Compact GPU Data Scheduling (2025)0.00
• Billion-scale Similarity Search With Gpus (2017)24.96
• Hashmod: A Hashing Method For Scalable 3D Object Detection (2016)10.07
• Simultaneous Feature Aggregating And Hashing For Large-scale Image Search (2017)10.61
• Efficient Match Pair Retrieval For Large-scale UAV Images Via Graph Indexed Global Descriptor (2023)6.77
• Sparse-to-dense Hypercolumn Matching For Long-term Visual Localization (2019)12.99
• On-device Scalable Image-based Localization Via Prioritized Cascade Search And Fast One-many RANSAC (2018)11.19
• FLASH: Randomized Algorithms Accelerated Over CPU-GPU For Ultra-high Dimensional Similarity Search (2017)9.23