FACT: Multinomial Misalignment Classification for Point Cloud Registration

Ludvig Dillén, Per-Erik Forssén, Johan Edstedt
4/9/2025
cs.CVcs.LG

Official code: LudvigDillen/FACT_for_PCMC (16 stars, MIT, last commit 2025-07-05).

Abstract

We present FACT, a method for predicting alignment quality (i.e., registration error) of registered lidar point cloud pairs. This is useful e.g. for quality assurance of large, automatically registered 3D models. FACT extracts local features from a registered pair and processes them with a point transformer-based network to predict a misalignment class. We generalize prior work that study binary alignment classification of registration errors, by recasting it as multinomial misalignment classification. To achieve this, we introduce a custom regression-by-classification loss function that combines the cross-entropy and Wasserstein losses, and demonstrate that it outperforms both direct regression and prior binary classification. FACT successfully classifies point-cloud pairs registered with both the classical ICP and GeoTransformer, while other choices, such as standard point-cloud-quality metrics and registration residuals are shown to be poor choices for predicting misalignment. On a synthetically perturbed point-cloud task introduced by the CorAl method, we show that FACT achieves substantially better performance than CorAl. Finally, we demonstrate how FACT can assist experts in correcting misaligned point-cloud maps. Our code is available at https://github.com/LudvigDillen/FACT_for_PCMC.

View on arXivView PDF

Code Implementations(1)

MIT

[SCIA 2025] FACT: Multinomial Misalignment Classification for Point Cloud Registration

161Python, Jupyter NotebookAug 7, 20241 years agoMIT
alignment-quality-predictionpoint-cloud-misalignment-classificationpoint-cloud-registrationregression-by-classification

Similar Papers

Cite this paper

@article{dilln2025fact,
  title  = {FACT: Multinomial Misalignment Classification for Point Cloud Registration},
  author = {Ludvig Dillén and Per-Erik Forssén and Johan Edstedt},
  year   = {2025},
  eprint = {2504.06627},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.06627v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.06627.svg)](https://codeofpaper.com/paper/2504.06627)

Discussion