Pith. sign in

REVIEW 1 cited by

Point Cloud Compression via Constrained Optimal Transport

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.08236 v1 pith:EY4MS2JJ submitted 2024-03-13 cs.CV eess.IV

classification cs.CVeess.IV
keywords cloudoptimalpointcompressioncot-pccreconstructedtransportbitrate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents a novel point cloud compression method COT-PCC by formulating the task as a constrained optimal transport (COT) problem. COT-PCC takes the bitrate of compressed features as an extra constraint of optimal transport (OT) which learns the distribution transformation between original and reconstructed points. Specifically, the formulated COT is implemented with a generative adversarial network (GAN) and a bitrate loss for training. The discriminator measures the Wasserstein distance between input and reconstructed points, and a generator calculates the optimal mapping between distributions of input and reconstructed point cloud. Moreover, we introduce a learnable sampling module for downsampling in the compression procedure. Extensive results on both sparse and dense point cloud datasets demonstrate that COT-PCC outperforms state-of-the-art methods in terms of both CD and PSNR metrics. Source codes are available at \url{https://github.com/cognaclee/PCC-COT}.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. AdaDPCC: Adaptive Rate Control and Rate-Distortion-Complexity Optimization for Dynamic Point Cloud Compression

    cs.MM 2025-08 conditional novelty 6.0 of 10

    AdaDPCC uses multiple slimmable coding routes with a learned rate controller to compress dynamic point clouds, cutting average bitrate and coding time versus state-of-the-art methods.

Pith tools