Optimizing Geometry Compression using Quantum Annealing
- URL: http://arxiv.org/abs/2003.13253v1
- Date: Mon, 30 Mar 2020 07:56:34 GMT
- Title: Optimizing Geometry Compression using Quantum Annealing
- Authors: Sebastian Feld, Markus Friedrich, Claudia Linnhoff-Popien
- Abstract summary: We propose a quantum-enabled lossy 3d point cloud compression pipeline based on the constructive solid geometry (CSG) model representation.
Key parts of the pipeline are mapped to NP-complete problems for which an efficient Ising formulation suitable for the execution on a Quantum Annealer exists.
- Score: 8.959391124399925
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The compression of geometry data is an important aspect of
bandwidth-efficient data transfer for distributed 3d computer vision
applications. We propose a quantum-enabled lossy 3d point cloud compression
pipeline based on the constructive solid geometry (CSG) model representation.
Key parts of the pipeline are mapped to NP-complete problems for which an
efficient Ising formulation suitable for the execution on a Quantum Annealer
exists. We describe existing Ising formulations for the maximum clique search
problem and the smallest exact cover problem, both of which are important
building blocks of the proposed compression pipeline. Additionally, we discuss
the properties of the overall pipeline regarding result optimality and
described Ising formulations.
Related papers
- N-BVH: Neural ray queries with bounding volume hierarchies [51.430495562430565]
In 3D computer graphics, the bulk of a scene's memory usage is due to polygons and textures.
We devise N-BVH, a neural compression architecture designed to answer arbitrary ray queries in 3D.
Our method provides faithful approximations of visibility, depth, and appearance attributes.
arXiv Detail & Related papers (2024-05-25T13:54:34Z) - ParaPoint: Learning Global Free-Boundary Surface Parameterization of 3D Point Clouds [52.03819676074455]
ParaPoint is an unsupervised neural learning pipeline for achieving global free-boundary surface parameterization.
This work makes the first attempt to investigate neural point cloud parameterization that pursues both global mappings and free boundaries.
arXiv Detail & Related papers (2024-03-15T14:35:05Z) - 3D Compression Using Neural Fields [90.24458390334203]
We propose a novel NF-based compression algorithm for 3D data.
We demonstrate that our method excels at geometry compression on 3D point clouds as well as meshes.
It is straightforward to extend our compression algorithm to compress both geometry and attribute (e.g. color) of 3D data.
arXiv Detail & Related papers (2023-11-21T21:36:09Z) - Geometric Prior Based Deep Human Point Cloud Geometry Compression [67.49785946369055]
We leverage the human geometric prior in geometry redundancy removal of point clouds.
We can envisage high-resolution human point clouds as a combination of geometric priors and structural deviations.
The proposed framework can operate in a play-and-plug fashion with existing learning based point cloud compression methods.
arXiv Detail & Related papers (2023-05-02T10:35:20Z) - GRASP-Net: Geometric Residual Analysis and Synthesis for Point Cloud
Compression [16.98171403698783]
We propose a heterogeneous approach with deep learning for lossy point cloud geometry compression.
Specifically, a point-based network is applied to convert the erratic local details to latent features residing on the coarse point cloud.
arXiv Detail & Related papers (2022-09-09T17:09:02Z) - Deep Geometry Post-Processing for Decompressed Point Clouds [32.72083309729585]
Point cloud compression plays a crucial role in reducing the huge cost of data storage and transmission.
We propose a novel learning-based post-processing method to enhance the decompressed point clouds.
Experimental results show that the proposed method can significantly improve the quality of the decompressed point clouds.
arXiv Detail & Related papers (2022-04-29T08:57:03Z) - Neural Convolutional Surfaces [59.172308741945336]
This work is concerned with a representation of shapes that disentangles fine, local and possibly repeating geometry, from global, coarse structures.
We show that this approach achieves better neural shape compression than the state of the art, as well as enabling manipulation and transfer of shape details.
arXiv Detail & Related papers (2022-04-05T15:40:11Z) - 3DAC: Learning Attribute Compression for Point Clouds [35.78404985164711]
We study the problem of attribute compression for large-scale unstructured 3D point clouds.
We introduce a deep compression network, termed 3DAC, to explicitly compress the attributes of 3D point clouds.
arXiv Detail & Related papers (2022-03-17T09:42:36Z) - Linear Convergent Decentralized Optimization with Compression [50.44269451541387]
Existing decentralized algorithms with compression mainly focus on compressing DGD-type algorithms.
Motivated by primal-dual algorithms, this paper proposes first underlineLinunderlineEAr convergent.
underlineDecentralized with compression, LEAD.
arXiv Detail & Related papers (2020-07-01T04:35:00Z)
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.