LiteLoc通过去色解耦与匹配压缩,实现高效稀疏到稠密定位。
Efficient Sparse-to-Dense Visual Localization via Compact Gaussian Scene Representation and Accelerated Dense Pose Estimation

- 去色解耦特征场,仅保留定位必要属性,减少94%冗余存储。
- 将稠密匹配浓缩至5%代表点,计算速度提升近19倍,精度损失极小。
- 适合对延迟敏感的实时视觉定位场景,训练更简单,部署更高效。
本文提出LiteLoc,一种基于3D高斯溅射(3DGS)的新颖高效定位器。先前最先进的稀疏到稠密定位器STDLoc虽表现优异,但存在严重的存储冗余和计算延迟问题。通过对设计决策的重新审视,我们提出两项简单而有效的改进,显著提升内存与计算效率,同时更易训练。关键发现是:沿用自Feature 3DGS的颜色场对定位无实际作用,却因重建高频光照细节需大量高斯素数,导致颜色-特征紧密耦合,带来巨大内存开销且特征优化不佳。为此,我们提出无色解耦特征场,仅保留任务必需特征属性,构建紧凑高斯场景表示,消除约94%冗余存储,且不损失定位相关信息。进一步发现,主要计算瓶颈在于稠密透视n点(PnP)求解器,多数匹配贡献饱和几何约束,精度增益递减。因此,我们提出压缩策略,将稠密匹配提炼为仅5%的代表性匹配,实现近19倍的速度提升,性能下降可忽略。大量实验表明,LiteLoc在多个场景中超越STDLoc,兼具显著效率优势,为低延迟视觉定位开辟新前景。
原文摘要 · Abstract (English)
This letter presents LiteLoc, a novel and efficient localizer built on 3D Gaussian Splatting (3DGS). The previous state-of-the-art (SoTA) sparse-to-dense localizer, STDLoc, has shown remarkable localization capability but suffers from severe storage redundancy and computational latency. By revisiting its design decisions, we derive two simple yet highly effective improvements that cumulatively make LiteLoc much more efficient in both memory and computation, while also being easier to train. One key observation is that the color field, inherited directly from Feature 3DGS, is functionally useless for localization. Yet, its reconstruction of high-frequency photometric details necessitates excessive Gaussian primitives, resulting in a tightly coupled color-feature representation with significant memory overhead and sub-optimal feature field optimization. To resolve this, we propose a color-free decoupled feature field that constructs a compact Gaussian scene representation by retaining only task-essential feature attributes, thereby eliminating approximately 94% of redundant storage with no loss of localization-relevant information. We further find that the primary computational bottleneck lies in the dense Perspective-n-Point (PnP) solver, where most matches contribute saturated geometric constraints with diminishing accuracy gains. Accordingly, we propose a condensing strategy that distills dense matches into a subset of 5% representative matches, enabling a nearly 19-fold speedup in robust estimation with negligible performance drop. Extensive experiments show that LiteLoc surpasses STDLoc in multiple scenes with considerable efficiency benefits, opening up exciting prospects for latency-sensitive visual localization.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。