Message Passing Least Squares Framework and its Application to Rotation Synchronization
From MaRDI portal
Publication:6345928
Computational methods for problems pertaining to probability theory (60-08) Probabilistic models, generic numerical methods in probability and statistics (65C20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Robustness in mathematical programming (90C17)
Abstract: We propose an efficient algorithm for solving group synchronization under high levels of corruption and noise, while we focus on rotation synchronization. We first describe our recent theoretically guaranteed message passing algorithm that estimates the corruption levels of the measured group ratios. We then propose a novel reweighted least squares method to estimate the group elements, where the weights are initialized and iteratively updated using the estimated corruption levels. We demonstrate the superior performance of our algorithm over state-of-the-art methods for rotation synchronization using both synthetic and real data.
This page was built for publication: Message Passing Least Squares Framework and its Application to Rotation Synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345928)
