Differentiable Product Quantization for Memory Efficient Camera Relocalization
Zakaria Laskar, Iaroslav Melekhov, Assia Benbihi, Shuzhe Wang, Juho Kannala
TL;DR
Memory-heavy 3D scene maps limit camera relocalization deployment. The paper introduces a standalone Differentiable Product Quantization with a tiny scene-specific dequantizer (D-PQED) trained with margin-based metric losses to preserve descriptor matching under extreme compression, and studies its combination with map compression to explore memory-efficiency trade-offs. It demonstrates superior memory-accuracy trade-offs on Aachen Day-Night and other benchmarks, supported by extensive ablations of losses and matchers. The approach enables accurate relocalization at very small memory footprints and informs the design of hybrid map/descriptor compression for real-world systems.
Abstract
Camera relocalization relies on 3D models of the scene with a large memory footprint that is incompatible with the memory budget of several applications. One solution to reduce the scene memory size is map compression by removing certain 3D points and descriptor quantization. This achieves high compression but leads to performance drop due to information loss. To address the memory performance trade-off, we train a light-weight scene-specific auto-encoder network that performs descriptor quantization-dequantization in an end-to-end differentiable manner updating both product quantization centroids and network parameters through back-propagation. In addition to optimizing the network for descriptor reconstruction, we encourage it to preserve the descriptor-matching performance with margin-based metric loss functions. Results show that for a local descriptor memory of only 1MB, the synergistic combination of the proposed network and map compression achieves the best performance on the Aachen Day-Night compared to existing compression methods.
