Saved in:
Bibliographic Details
Main Authors: Li, Zezeng, Wang, Weimin, Wang, Ziliang, Lei, Na
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2403.08236
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911795734642688
author Li, Zezeng
Wang, Weimin
Wang, Ziliang
Lei, Na
author_facet Li, Zezeng
Wang, Weimin
Wang, Ziliang
Lei, Na
contents 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}.
format Preprint
id arxiv_https___arxiv_org_abs_2403_08236
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Point Cloud Compression via Constrained Optimal Transport
Li, Zezeng
Wang, Weimin
Wang, Ziliang
Lei, Na
Computer Vision and Pattern Recognition
Image and Video Processing
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}.
title Point Cloud Compression via Constrained Optimal Transport
topic Computer Vision and Pattern Recognition
Image and Video Processing
url https://arxiv.org/abs/2403.08236