Iterative Differential Entropy Minimization (IDEM) method for fine rigid pairwise 3D Point Cloud Registration: A Focus on the Metric

2026-01-14 · Emmanuele Barberi, Felice Sfravara, Filippo Cucinotta arxiv

Point cloud registration is a central theme in computer vision, with alignment algorithms continuously improving for greater robustness. Commonly used methods evaluate Euclidean distances between point clouds and minimize an objective function, such as Root Mean Square Error (RMSE). However, these approaches are most effective when the point clouds are well-prealigned and issues such as differences in density, noise, holes, and limited overlap can compromise the results. Traditional methods, such as Iterative Closest Point (ICP), require choosing one point cloud as fixed, since Euclidean distances lack commutativity. When only one point cloud has issues, adjustments can be made, but in real scenarios, both point clouds may be affected, often necessitating preprocessing. The authors introduce a novel differential entropy-based metric, designed to serve as the objective function within an optimization framework for fine rigid pairwise 3D point cloud registration, denoted as Iterative Differential Entropy Minimization (IDEM). This metric does not depend on the choice of a fixed point cloud and, during transformations, reveals a clear minimum corresponding to the best alignment. Multiple case studies are conducted, and the results are compared with those obtained using RMSE, Chamfer distance, and Hausdorff distance. The proposed metric proves effective even with density differences, noise, holes, and partial overlap, where RMSE does not always yield optimal alignment.

📄 PDF Abstract BibTeX arXiv:2601.09601

Code (0)

등록된 구현이 없습니다.

Tasks

Point Cloud Registration Point Clouds

BUDS: Balancing Utility and Differential Privacy by Shuffling

2020-06-07 · Poushali Sengupta, Sudipta Paul, Subhankar Mishra

Balancing utility and differential privacy by shuffling or \textit{BUDS} is an approach towards crowd-sourced, statistical databases, with strong privacy and utility balance using differential privacy theory. Here, a nov…

Attribute

Cross-Entropy Loss and Low-Rank Features Have Responsibility for Adversarial Examples

2019-01-24 · Kamil Nar, Orhan Ocal, S. Shankar Sastry, Kannan Ramchandran

State-of-the-art neural networks are vulnerable to adversarial examples; they can easily misclassify inputs that are imperceptibly different than their training and test data. In this work, we establish that the use of c…

Binary Classification

Confinement strategies in a simple SIR model

2020-04-20

We propose a simple SIR model in order to investigate the impact of various confinement strategies on a most virulent epidemic. Our approach is motivated by the current COVID-19 pandemic. The main hypothesis is the exist…

model

Differentially Private Two-Stage Empirical Risk Minimization with Applications to Individualized Treatment Rule

2026-02-13 · Joowon Lee, Guanhua Chen arxiv

Differential privacy provides a formal framework for releasing statistical estimators that limit how much any single observation can influence the output, by injecting calibrated random noise. We study differentially pri…

Causal Inference

Entropy Minimization vs. Diversity Maximization for Domain Adaptation

2020-02-05 · Xiaofu Wu, Suofei hang, Quan Zhou, Zhen Yang 외

Entropy minimization has been widely used in unsupervised domain adaptation (UDA). However, existing works reveal that entropy minimization only may result into collapsed trivial solutions. In this paper, we propose to a…

Diversity Domain Adaptation Unsupervised Domain Adaptation