arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.00728math.OCcs.CVcs.MAcs.NAmath.NAstat.ML
收藏

关于欧几里得坐标系统之间线性可逆变换的传递一致性

On Transitive Consistency for Linear Invertible Transformations between Euclidean Coordinate Systems

Luxembourg Centre for Systems Biomedicine, University of Luxembourg, Esch-sur-Alzette, LUXEMBOURG(卢森堡系统生物医学研究中心,卢森堡大学,埃施-sur-阿尔泽特);Centre Hospitalier de Luxembourg, Luxembourg City, LUXEMBOURG(卢森堡医院,卢森堡市);Control Group, Department of Engineering, University of Cambridge, Cambridge, UNITED KINGDOM(控制组,工程系,剑桥大学,剑桥)

Johan Thunberg, Florian Bernard, Jorge Goncalves

AI总结:

本文研究了如何同步非传递一致的线性可逆变换,提出两种同步方法及迭代Gauss-Newton方法,适用于不同图拓扑,并通过仿真验证了方法的有效性。

摘要:

传递一致性是欧几里得坐标框架之间线性可逆变换集合的内在属性。在实践中,当变换由数据估计时,这一属性往往缺失。本文解决如何同步非传递一致的变换的问题。一旦变换被同步,它们将满足传递一致性条件——从框架A到框架C的变换等于先从A到B再从B到C的复合变换。坐标框架对应图中的节点,变换对应图中的边。提出了两种直接或集中同步方法,分别适用于近强连通图和连通图。作为第二种方法的扩展,提出了迭代Gauss-Newton方法,并将其适应于仿射和欧几里得变换的情况。还提出了适用于正交矩阵的两种分布式同步方法,这些方法可以看作是两种直接或集中方法的分布式版本;它们类似于用于分布式平均的标准共识协议。当变换为正交矩阵时,可以计算最优性间隙的上界。仿真显示,即使在噪声幅度较大的情况下,间隙也几乎准确。本文还从理论层面提供了传递一致变换的线性代数关系。所提出方法的一个优点是其简单性——使用基本线性代数方法,例如奇异值分解(SVD)。对于广泛参数设置范围内的方法,进行了数值验证。

英文摘要:

Transitive consistency is an intrinsic property for collections of linear invertible transformations between Euclidean coordinate frames. In practice, when the transformations are estimated from data, this property is lacking. This work addresses the problem of synchronizing transformations that are not transitively consistent. Once the transformations have been synchronized, they satisfy the transitive consistency condition - a transformation from frame $A$ to frame $C$ is equal to the composite transformation of first transforming A to B and then transforming B to C. The coordinate frames correspond to nodes in a graph and the transformations correspond to edges in the same graph. Two direct or centralized synchronization methods are presented for different graph topologies; the first one for quasi-strongly connected graphs, and the second one for connected graphs. As an extension of the second method, an iterative Gauss-Newton method is presented, which is later adapted to the case of affine and Euclidean transformations. Two distributed synchronization methods are also presented for orthogonal matrices, which can be seen as distributed versions of the two direct or centralized methods; they are similar in nature to standard consensus protocols used for distributed averaging. When the transformations are orthogonal matrices, a bound on the optimality gap can be computed. Simulations show that the gap is almost right, even for noise large in magnitude. This work also contributes on a theoretical level by providing linear algebraic relationships for transitively consistent transformations. One of the benefits of the proposed methods is their simplicity - basic linear algebraic methods are used, e.g., the Singular Value Decomposition (SVD). For a wide range of parameter settings, the methods are numerically validated.

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

↑