APML: Adaptive Probabilistic Matching Loss for Robust 3D Point Cloud Reconstruction
Sasan Sharifipour, Constantino Álvarez Casado, Mohammad Sabokrou, Miguel Bordallo López
Abstract
Training deep learning models for point cloud prediction tasks such as shape completion and generation depends critically on loss functions that measure discrepancies between predicted and ground-truth point sets. Commonly used functions such as Chamfer Distance (CD), HyperCD, and InfoCD rely on nearest-neighbor assignments, which often induce many-to-one correspondences, leading to point congestion in dense regions and poor coverage in sparse regions. These losses also involve non-differentiable operations due to index selection, which may affect gradient-based optimization. Earth Mover Distance (EMD) enforces one-to-one correspondences and captures structural similarity more effectively, but its cubic computational complexity limits its practical use. We propose the Adaptive Probabilistic Matching Loss (APML), a fully differentiable approximation of one-to-one matching that leverages Sinkhorn iterations on a temperature-scaled similarity matrix derived from pairwise distances. We analytically compute the temperature to guarantee a minimum assignment probability, eliminating manual tuning. APML achieves near-quadratic runtime, comparable to Chamfer-based losses, and avoids non-differentiable operations. When integrated into state-of-the-art architectures (PoinTr, PCN, FoldingNet) on ShapeNet benchmarks and on a spatiotemporal Transformer (CSI2PC) that generates 3D human point clouds from WiFi CSI measurements, APM loss yields faster convergence, superior spatial distribution, especially in low-density regions, and improved or on-par quantitative performance without additional hyperparameter search. The code is available at: https://github.com/apm-loss/apml.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f61f2c5b-6be5-4c23-9df1-98c91cf5d98eBuilds on8
- PoinTr: Diverse Point Cloud Completion with Geometry-Aware TransformersXumin Yu, Yongming Rao, Ziyi Wang, Zuyan Liu et al.ICCV 2021 · 592 citations
- SnowflakeNet: Point Cloud Completion by Snowflake Point Deconvolution with Skip-TransformerPeng Xiang, Xin Wen, Yu-Shen Liu, Yan-Pei Cao et al.ICCV 2021 · 318 citations
- Point-set Distances for Learning Representations of 3D Point CloudsTrung Nguyen, Quang-Hieu Pham, Tam Le, Tung Pham et al.ICCV 2021 · 89 citations
- Accurate Point Cloud Registration with Robust Optimal TransportZhengyang Shen, Jean Feydy, Peirong Liu, Ariel Hernán Curiale et al.NeurIPS 2021 · 81 citations
- Hyperbolic Chamfer Distance for Point Cloud CompletionFangzhou Lin, Yun Yue, Songlin Hou, Xuechu Yu et al.ICCV 2023 · 53 citations
Related papers
- Balanced Chamfer Distance as a Comprehensive Metric for Point Cloud CompletionTong Wu, Liang Pan, Junzhe Zhang, Tai Wang et al.NeurIPS 2021 · 104 citations
- InfoCD: A Contrastive Chamfer Distance Loss for Point Cloud CompletionFangzhou Lin, Yun Yue, Ziming Zhang, Songlin Hou et al.NeurIPS 2023 · 49 citations
- Unsupervised Deep Probabilistic Approach for Partial Point Cloud RegistrationGuofeng Mei, Hao Tang, Xiaoshui Huang, Weijie Wang et al.CVPR 2023
- A Computation-Aware Shape Loss Function for Point Cloud CompletionShunran Zhang, Xiubo Zhang, Tsz Nam Chan, Shenghui Zhang et al.AAAI 2024 · 1 citation
- GPS: A Probabilistic Distributional Similarity with Gumbel Priors for Set-to-Set MatchingZiming Zhang, Fangzhou Lin, Haotian Liu, Jose Morales et al.ICLR 2025
