Core Concepts
Adaptive Image Retrieval optimizes processing time by adjusting the number of retrieved images based on query similarity.
Abstract
The paper introduces AIR-HLoc, a method that adapts the number of retrieved images based on query similarity to optimize processing time. It divides queries into different difficulty levels and retrieves a variable number of images accordingly. Extensive experiments on various datasets show a reduction in computational overhead while maintaining accuracy compared to fixed image retrieval methods.
I. Introduction
- Visual localisation systems estimate 6DOF camera pose.
- HLoc pipelines use image retrieval for 2D-3D correspondences.
- Fixed k value in HLoc affects robustness and performance.
II. Related Work
- Structure-based methods and Absolute Pose Regressors for camera pose estimation.
- Image Retrieval (IR) models like NetVLAD and EigenPlaces.
III. Methods
- AIR-HLoc adaptively retrieves images based on query similarity.
- Cosine similarity used to evaluate localisation difficulty.
- Different retrieval strategies for easy, medium, and hard queries.
IV. Evaluation
- Datasets include Cambridge Landmarks, 7Scenes, and Aachen Day-Night-v1.1.
- AIR-HLoc reduces computational overhead while maintaining accuracy.
- Results show improved efficiency and accuracy across datasets.
V. Conclusions
- AIR-HLoc optimizes processing time by adaptively adjusting retrieved images.
- System efficiency improved with reduced computational overhead.
- Application in visual-inertial odometry systems for real-time camera relocalisation.
Stats
"Our AIR-HLoc reduces the average matching cost of all queries by 30%, 26%, and 10% on three different datasets, respectively."
"For easy queries, AIR-HLoc reduces runtime by 600 ms to 1200 ms when k = 10 ∼20."
Quotes
"AIR-HLoc optimizes processing time by adaptively assigning different values of k based on the similarity between the query and reference images without losing accuracy."