噪声稳定的刚性图的欧氏嵌入
Noise-Stable Rigid Graphs for Euclidean Embedding
摘要:
提出了一个新的评价MDS算法的标准\textit{noise-stability},它修正了经典的刚性理论,能真实地反映全局结构重建的保真度;然后证明了cMDS算法在一般条件下的噪声稳定性,为欧氏嵌入的精度和理论界及其在无线传感器网络定位、卫星定位此外,我们研究了以前的工作,最小成本的全球刚性生成子图,并提出了一个算法,以构建一个最小成本的噪声稳定的生成图在欧氏空间,使可靠的定位在稀疏图的噪声距离约束的线性数量的边缘和次线性成本的总边长。此外,该算法还提出了一种方案,以最小的$O(n)$时间复杂度,从cMDS的$O(n^3)$,从成对距离重建点云。
英文摘要:
We proposed a new criterion \textit{noise-stability}, which revised the classical rigidity theory, for evaluation of MDS algorithms which can truthfully represent the fidelity of global structure reconstruction; then we proved the noise-stability of the cMDS algorithm in generic conditions, which provides a rigorous theoretical guarantee for the precision and theoretical bounds for Euclidean embedding and its application in fields including wireless sensor network localization and satellite positioning. Furthermore, we looked into previous work about minimum-cost globally rigid spanning subgraph, and proposed an algorithm to construct a minimum-cost noise-stable spanning graph in the Euclidean space, which enabled reliable localization on sparse graphs of noisy distance constraints with linear numbers of edges and sublinear costs in total edge lengths. Additionally, this algorithm also suggests a scheme to reconstruct point clouds from pairwise distances at a minimum of $O(n)$ time complexity, down from $O(n^3)$ for cMDS.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。