arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.07248math.OCcs.CVcs.DCcs.MA
收藏

图上正交矩阵同步的分布式方法

Distributed methods for synchronization of orthogonal matrices over graphs

University of Luxembourg(卢森堡大学);Centre Hospitalier de Luxembourg(卢森堡医院中心);University of Cambridge(剑桥大学)

Johan Thunberg, Florian Bernard, Jorge Goncalves

摘要:

本文研究了有向图上正交矩阵的同步问题。对于同步转换(或矩阵),循环上的复合转换等于恒等式。我们制定的同步问题作为一个最小二乘最优化问题的非线性约束。同步问题是从三维定位到图像配准等应用中的关键问题之一。这项工作的主要贡献可以概括为引入两个新的算法,一个对称图和一个图形可能是不对称的。在一般条件下,前者保证收敛到同步问题的谱松弛解。后者是稳定的小步长时,图是准强连通。所提出的方法在数值模拟中得到了验证。

英文摘要:

This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as a least-squares optimization problem with nonlinear constraints. The synchronization problem appears as one of the key components in applications ranging from 3D-localization to image registration. The main contributions of this work can be summarized as the introduction of two novel algorithms; one for symmetric graphs and one for graphs that are possibly asymmetric. Under general conditions, the former has guaranteed convergence to the solution of a spectral relaxation to the synchronization problem. The latter is stable for small step sizes when the graph is quasi-strongly connected. The proposed methods are verified in numerical simulations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑