# Robust Multi-view Registration of Point Sets with Laplacian Mixture Model

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

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- Builds on 5 of its 29 references that are in the map.
- First posted on arXiv 26 Oct 2021.

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

- [TEASER: Fast and Certifiable Point Cloud Registration](https://mlsanity.com/paper/2001.07715/) (2020)
- [PointNetLK: Robust & Efficient Point Cloud Registration using PointNet](https://mlsanity.com/paper/1903.05711/) (2019)
- [Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registration](https://mlsanity.com/paper/1605.03344/) (2016)
- [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)

## Built on by (most cited first, 4 of 4)

- [3D Registration in 30 Years: A Survey](https://mlsanity.com/paper/2412.13735/) (2024)
- [Multiview Point Cloud Registration via Optimization in an Autoencoder Latent Space](https://mlsanity.com/paper/2504.21467/) (2025)
- [Attention-guided reference point shifting for Gaussian-mixture-based partial point set registration](https://mlsanity.com/paper/2512.02496/) (2025)
- [Spectral Consistency-Guided Multiview Point Cloud Registration for Low-Overlap Scenes](https://mlsanity.com/paper/2609.12417/) (2026)

## Abstract (arXiv)

Point set registration is an essential step in many computer vision applications, such as 3D reconstruction and SLAM. Although there exist many registration algorithms for different purposes, however, this topic is still challenging due to the increasing complexity of various real-world scenarios, such as heavy noise and outlier contamination. In this paper, we propose a novel probabilistic generative method to simultaneously align multiple point sets based on the heavy-tailed Laplacian distribution. The proposed method assumes each data point is generated by a Laplacian Mixture Model (LMM), where its centers are determined by the corresponding points in other point sets. Different from the previous Gaussian Mixture Model (GMM) based method, which minimizes the quadratic distance between points and centers of Gaussian probability density, LMM minimizes the sparsity-induced L1 distance, thereby it is more robust against noise and outliers. We adopt Expectation-Maximization (EM) framework to solve LMM parameters and rigid transformations. We approximate the L1 optimization as a linear programming problem by exponential mapping in Lie algebra, which can be effectively solved through the interior point method. To improve efficiency, we also solve the L1 optimization by Alternating Direction Multiplier Method (ADMM). We demonstrate the advantages of our method by comparing it with representative state-of-the-art approaches on benchmark challenging data sets, in terms of robustness and accuracy.