Density-aware Chamfer Distance as a Comprehensive Metric for Point Cloud Completion

• URL: http://arxiv.org/abs/2111.12702v1
• Date: Wed, 24 Nov 2021 18:56:27 GMT
• Title: Density-aware Chamfer Distance as a Comprehensive Metric for Point Cloud Completion
• Authors: Tong Wu, Liang Pan, Junzhe Zhang, Tai Wang, Ziwei Liu, Dahua Lin
• Abstract summary: Chamfer Distance (CD) and Earth Mover's Distance (EMD) are two broadly adopted metrics for measuring the similarity between two point sets. We propose a new similarity measure named Density-aware Chamfer Distance (DCD) We show that DCD pays attention to both the overall structure and local details and provides a more reliable evaluation even when CD and contradict each other.
• Score: 90.26652899910019
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Chamfer Distance (CD) and Earth Mover's Distance (EMD) are two broadly adopted metrics for measuring the similarity between two point sets. However, CD is usually insensitive to mismatched local density, and EMD is usually dominated by global distribution while overlooks the fidelity of detailed structures. Besides, their unbounded value range induces a heavy influence from the outliers. These defects prevent them from providing a consistent evaluation. To tackle these problems, we propose a new similarity measure named Density-aware Chamfer Distance (DCD). It is derived from CD and benefits from several desirable properties: 1) it can detect disparity of density distributions and is thus a more intensive measure of similarity compared to CD; 2) it is stricter with detailed structures and significantly more computationally efficient than EMD; 3) the bounded value range encourages a more stable and reasonable evaluation over the whole test set. We adopt DCD to evaluate the point cloud completion task, where experimental results show that DCD pays attention to both the overall structure and local geometric details and provides a more reliable evaluation even when CD and EMD contradict each other. We can also use DCD as the training loss, which outperforms the same model trained with CD loss on all three metrics. In addition, we propose a novel point discriminator module that estimates the priority for another guided down-sampling step, and it achieves noticeable improvements under DCD together with competitive results for both CD and EMD. We hope our work could pave the way for a more comprehensive and practical point cloud similarity evaluation. Our code will be available at: https://github.com/wutong16/Density_aware_Chamfer_Distance .

Related papers

• Explaining and Improving Contrastive Decoding by Extrapolating the Probabilities of a Huge and Hypothetical LM [93.8400683020273]
  Contrastive decoding (CD) improves the next-token distribution of a large expert language model (LM) using a small amateur LM. We propose a new unsupervised decoding method called $mathbfA$symptotic $mathbfP$robability $mathbfD$ecoding (APD) APD explicitly extrapolates the probability curves from the LMs of different sizes to infer the probabilities from an infinitely large LM without inducing more inference costs than CD.
  arXiv  Detail & Related papers  (2024-11-03T15:31:44Z)
• Stable Differentiable Causal Discovery [2.0249250133493195]
  We propose Stable Differentiable Causal Discovery (SDCD) for referring causal relationships as directed acyclic graphs (DAGs) We first derive SDCD and prove its stability and correctness. We then evaluate it with both observational and interventional data and on both small-scale and large-scale settings. We find that SDCD outperforms existing methods in both convergence speed and accuracy and can scale to thousands of variables.
  arXiv  Detail & Related papers  (2023-11-17T01:14:24Z)
• Unleash the Potential of 3D Point Cloud Modeling with A Calibrated Local Geometry-driven Distance Metric [62.365983810610985]
  We propose a novel distance metric called Calibrated Local Geometry Distance (CLGD) CLGD computes the difference between the underlying 3D surfaces calibrated and induced by a set of reference points. As a generic metric, CLGD has the potential to advance 3D point cloud modeling.
  arXiv  Detail & Related papers  (2023-06-01T11:16:20Z)
• Deep Metric Learning for Unsupervised Remote Sensing Change Detection [60.89777029184023]
  Remote Sensing Change Detection (RS-CD) aims to detect relevant changes from Multi-Temporal Remote Sensing Images (MT-RSIs) The performance of existing RS-CD methods is attributed to training on large annotated datasets. This paper proposes an unsupervised CD method based on deep metric learning that can deal with both of these issues.
  arXiv  Detail & Related papers  (2023-03-16T17:52:45Z)
• Targeted Separation and Convergence with Kernel Discrepancies [61.973643031360254]
  kernel-based discrepancy measures are required to (i) separate a target P from other probability measures or (ii) control weak convergence to P. In this article we derive new sufficient and necessary conditions to ensure (i) and (ii) For MMDs on separable metric spaces, we characterize those kernels that separate Bochner embeddable measures and introduce simple conditions for separating all measures with unbounded kernels.
  arXiv  Detail & Related papers  (2022-09-26T16:41:16Z)
• Revisiting Consistency Regularization for Semi-supervised Change Detection in Remote Sensing Images [60.89777029184023]
  We propose a semi-supervised CD model in which we formulate an unsupervised CD loss in addition to the supervised Cross-Entropy (CE) loss. Experiments conducted on two publicly available CD datasets show that the proposed semi-supervised CD method can reach closer to the performance of supervised CD.
  arXiv  Detail & Related papers  (2022-04-18T17:59:01Z)
• CD-split and HPD-split: efficient conformal regions in high dimensions [3.1690891866882236]
  We provide new insights on CD-split by exploring its theoretical properties. We show that CD-split converges to the highest predictive density set and satisfies local variation and conditional validity. We introduce HPD-split, a method of CD-split that requires less tuning, and show that it shares the same theoretical guarantees as CD-split.
  arXiv  Detail & Related papers  (2020-07-24T21:42:34Z)
• Reliable Fidelity and Diversity Metrics for Generative Models [30.941563781926202]
  The most widely used metric for measuring the similarity between real and generated images has been the Fr'echet Inception Distance (FID) score. We show that even the latest version of the precision and recall metrics are not reliable yet. We propose density and coverage metrics that solve the above issues.
  arXiv  Detail & Related papers  (2020-02-23T00:50:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.