# Robust Motion Averaging for Multi-view Registration of Point Sets Based Maximum Correntropy Criterion

arXiv: https://arxiv.org/abs/2208.11327 · HTML: https://mlsanity.com/paper/2208.11327/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 7 of its 30 references that are in the map.
- First posted on arXiv 24 Aug 2022.

## Builds on (most cited first, 7 of 7)

- [Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registration](https://mlsanity.com/paper/1605.03344/) (2016)
- [A micro Lie theory for state estimation in robotics](https://mlsanity.com/paper/1812.01537/) (2018)
- [Fast and Robust Iterative Closest Point](https://mlsanity.com/paper/2007.07627/) (2020)
- [Joint Alignment of Multiple Point Sets with Batch and Incremental Expectation-Maximization](https://mlsanity.com/paper/1609.01466/) (2016)
- [Registration of multi-view point sets under the perspective of expectation-maximization](https://mlsanity.com/paper/2002.07464/) (2020)
- [Robust Motion Averaging under Maximum Correntropy Criterion](https://mlsanity.com/paper/2004.09829/) (2020)
- [Weighted Motion Averaging for the Registration of Multi-View Range Scans](https://mlsanity.com/paper/1702.06264/) (2017)

## Abstract (arXiv)

As an efficient algorithm to solve the multi-view registration problem,the motion averaging (MA) algorithm has been extensively studied and many MA-based algorithms have been introduced. They aim at recovering global motions from relative motions and exploiting information redundancy to average accumulative errors. However, one property of these methods is that they use Guass-Newton method to solve a least squares problem for the increment of global motions, which may lead to low efficiency and poor robustness to outliers. In this paper, we propose a novel motion averaging framework for the multi-view registration with Laplacian kernel-based maximum correntropy criterion (LMCC). Utilizing the Lie algebra motion framework and the correntropy measure, we propose a new cost function that takes all constraints supplied by relative motions into account. Obtaining the increment used to correct the global motions, can further be formulated as an optimization problem aimed at maximizing the cost function. By virtue of the quadratic technique, the optimization problem can be solved by dividing into two subproblems, i.e., computing the weight for each relative motion according to the current residuals and solving a second-order cone program problem (SOCP) for the increment in the next iteration. We also provide a novel strategy for determining the kernel width which ensures that our method can efficiently exploit information redundancy supplied by relative motions in the presence of many outliers. Finally, we compare the proposed method with other MA-based multi-view registration methods to verify its performance. Experimental tests on synthetic and real data demonstrate that our method achieves superior performance in terms of efficiency, accuracy and robustness.