Distributed methods for synchronization of orthogonal matrices over graphs
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Image RegistrationSimilar Papers 제목 키워드 기반
On Transitive Consistency for Linear Invertible Transformations between Euclidean Coordinate Systems
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 la…
Pilot Synthesis for Distributed Synchronization
Multiuser Massive MIMO is ongoing wireless technology with high prospects in the distributed architecture with various system design and splitting options. Any of such solutions suffer from imperfect synchronization that…
Joint Activity-Delay Detection and Channel Estimation for Asynchronous Massive Random Access: A Free Probability Theory Approach
Grant-free random access (RA) has been recognized as a promising solution to support massive connectivity due to the removal of the uplink grant request procedures. While most endeavours assume perfect synchronization am…
Action DetectionActivity DetectionOn the validity of kernel approximations for orthogonally-initialized neural networks
In this note we extend kernel function approximation results for neural networks with Gaussian-distributed weights to single-layer networks initialized using Haar-distributed random orthogonal matrices (with possible res…
Eigenvalue Distribution of Large Random Matrices Arising in Deep Neural Networks: Orthogonal Case
The paper deals with the distribution of singular values of the input-output Jacobian of deep untrained neural networks in the limit of their infinite width. The Jacobian is the product of random matrices where the indep…