地图上基于方向单位分割的点特征描述子
Point Feature Descriptor via Directional Partition of Unity on Maps
- Faculty of Applied Science, Ho Chi Minh City University of Technology（胡志明市理工大学应用科学学院）
- Department of Applied Mathematics, Faculty of Applied Science, Ho Chi Minh City University of Technology（胡志明市理工大学应用科学学院应用数学系）
- Vietnam National University Ho Chi Minh City（越南国家大学胡志明市分校）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
本文提出一种基于单位分割的平滑方向点描述子，通过完全性和Parseval型恒等式保证渐近单射性，并给出稳定性界，支撑可认证误差的GPS-free地图定位。
AI中文摘要：
我们为基于GPS-free地图定位中的光滑方向点描述子建立了一个泛函分析框架。给定地图$\mathcal{M} \subset \mathbb{R}^d$中的查询点$\mathbf{p}$，该描述子将环境信号与基于softmax核构建的单位分割权重族进行积分，从而得到$\mathcal{C}^\infty$光滑的硬角度分箱替代方案。我们的主要贡献包括：(i) 一个完全性定理，表明相关的线性泛函在$L^2(\mathbb{S}^{d-1})$中构成完全族，确立了描述子映射的渐近单射性；(ii) 一个由描述子诱导的半范数$|f|_{\mathcal{D},n} = \\|P_n f\\|_{L^2}$，通过权重的Gram矩阵识别，并满足Parseval型恒等式$|f|_{\mathcal{D},n} \to \\|f\\|_{L^2(\mathbb{S}^{d-1})}$（当$n \to \infty$）。补充结果包括Fréchet可微性、遮挡下的下半连续性，以及依赖于核和温度的显式Lipschitz稳定性界。这些性质支撑了一种定位理论，其中描述子网格能够实现最近邻位置恢复，并具有可认证的静态误差界，而机器人运动生成一个可观测性Gram矩阵，其最小特征值控制动态误差界，并通常能解决在单观测匹配下持续存在的对称性引起的模糊性。
英文摘要：
We develop a functional-analytic framework for smooth directional point descriptors in GPS-free map-based localization. Given a query point $\mathbf{p}$ in a map $\mathcal{M} \subset \mathbb{R}^d$, the descriptor integrates an environment signal against a partition-of-unity weight family built from a softmax kernel, yielding a $\mathcal{C}^\infty$ alternative to hard angular binning. Our main contributions are: (i) a totality theorem showing that the associated linear functionals form a total family in $L^2(\mathbb{S}^{d-1})$, establishing asymptotic injectivity of the descriptor map; and (ii) a descriptor-induced seminorm $|f|_{\mathcal{D},n} = \|P_n f\|_{L^2}$, identified via the Gram matrix of the weights, which satisfies a Parseval-type identity $|f|_{\mathcal{D},n} \to \|f\|_{L^2(\mathbb{S}^{d-1})}$ as $n \to \infty$. Complementary results include Fréchet differentiability, lower semicontinuity under occlusion, and explicit Lipschitz stability bounds with constants depending on the kernel and temperature. These properties underpin a localization theory in which the descriptor grid enables nearest-neighbor position recovery with a certifiable static error bound, while robot motion generates an observability Gramian whose smallest eigenvalue controls a dynamic error bound and generically resolves symmetry-induced ambiguities that persist under single-observation matching.
