Message Passing Least Squares: A Unified Framework for Fast and Robust Group Synchronization
We propose an efficient algorithm for solving robust group synchronization given adversarially corrupted group ratios. We first present a theoretically guaranteed message passing algorithm that estimates the corruption levels of the group ratios. We then propose a novel weighted least squares method to estimate the group elements, where the weights are initialized using the estimated corruption levels and are iteratively updated by incorporating cycle consistency information. We demonstrate the superior performance of our algorithm over state-of-the-art methods for $SO(3)$ synchronization using both synthetic and real data.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Message Passing Least Squares Framework and its Application to Rotation Synchronization
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 pas…
Variational message passing for online polynomial NARMAX identification
We propose a variational Bayesian inference procedure for online nonlinear system identification. For each output observation, a set of parameter posterior distributions is updated, which is then used to form a posterior…
Bayesian InferenceFormOnline Bayesian system identification in multivariate autoregressive models via message passing
We propose a recursive Bayesian estimation procedure for multivariate autoregressive models with exogenous inputs based on message passing in a factor graph. Unlike recursive least-squares, our method produces full poste…
Matrix completion based on Gaussian parameterized belief propagation
We develop a message-passing algorithm for noisy matrix completion problems based on matrix factorization. The algorithm is derived by approximating message distributions of belief propagation with Gaussian distributions…
Matrix CompletionRectified Gaussian Scale Mixtures and the Sparse Non-Negative Least Squares Problem
In this paper, we develop a Bayesian evidence maximization framework to solve the sparse non-negative least squares (S-NNLS) problem. We introduce a family of probability densities referred to as the Rectified Gaussian S…