Soft Compression for Lossless Image Coding
- URL: http://arxiv.org/abs/2012.06240v1
- Date: Fri, 11 Dec 2020 10:59:47 GMT
- Title: Soft Compression for Lossless Image Coding
- Authors: Gangtao Xin and Pingyi Fan
- Abstract summary: We propose a new concept, compressible indicator function with regard to image.
It is expected that the bandwidth and storage space needed when transmitting and storing the same kind of images can be greatly reduced by applying soft compression.
- Score: 17.714164324169037
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Soft compression is a lossless image compression method, which is committed
to eliminating coding redundancy and spatial redundancy at the same time by
adopting locations and shapes of codebook to encode an image from the
perspective of information theory and statistical distribution. In this paper,
we propose a new concept, compressible indicator function with regard to image,
which gives a threshold about the average number of bits required to represent
a location and can be used for revealing the performance of soft compression.
We investigate and analyze soft compression for binary image, gray image and
multi-component image by using specific algorithms and compressible indicator
value. It is expected that the bandwidth and storage space needed when
transmitting and storing the same kind of images can be greatly reduced by
applying soft compression.
Related papers
- Implicit Neural Image Field for Biological Microscopy Image Compression [37.0218688308699]
We propose an adaptive compression workflow based on Implicit Neural Representation (INR)
This approach permits application-specific compression objectives, capable of compressing images of any shape and arbitrary pixel-wise decompression.
We demonstrated on a wide range of microscopy images that our workflow not only achieved high, controllable compression ratios but also preserved detailed information critical for downstream analysis.
arXiv Detail & Related papers (2024-05-29T11:51:33Z) - MISC: Ultra-low Bitrate Image Semantic Compression Driven by Large Multimodal Model [78.4051835615796]
This paper proposes a method called Multimodal Image Semantic Compression.
It consists of an LMM encoder for extracting the semantic information of the image, a map encoder to locate the region corresponding to the semantic, an image encoder generates an extremely compressed bitstream, and a decoder reconstructs the image based on the above information.
It can achieve optimal consistency and perception results while saving perceptual 50%, which has strong potential applications in the next generation of storage and communication.
arXiv Detail & Related papers (2024-02-26T17:11:11Z) - Extreme Image Compression using Fine-tuned VQGANs [43.43014096929809]
We introduce vector quantization (VQ)-based generative models into the image compression domain.
The codebook learned by the VQGAN model yields a strong expressive capacity.
The proposed framework outperforms state-of-the-art codecs in terms of perceptual quality-oriented metrics.
arXiv Detail & Related papers (2023-07-17T06:14:19Z) - Deep Lossy Plus Residual Coding for Lossless and Near-lossless Image
Compression [85.93207826513192]
We propose a unified and powerful deep lossy plus residual (DLPR) coding framework for both lossless and near-lossless image compression.
We solve the joint lossy and residual compression problem in the approach of VAEs.
In the near-lossless mode, we quantize the original residuals to satisfy a given $ell_infty$ error bound.
arXiv Detail & Related papers (2022-09-11T12:11:56Z) - Analysis of the Effect of Low-Overhead Lossy Image Compression on the
Performance of Visual Crowd Counting for Smart City Applications [78.55896581882595]
Lossy image compression techniques can reduce the quality of the images, leading to accuracy degradation.
In this paper, we analyze the effect of applying low-overhead lossy image compression methods on the accuracy of visual crowd counting.
arXiv Detail & Related papers (2022-07-20T19:20:03Z) - Joint Image Compression and Denoising via Latent-Space Scalability [36.5211475555805]
We present a learnt image compression framework where image denoising and compression are performed jointly.
The proposed is compared against established compression and denoising benchmarks, and the experiments reveal considerable savings of up to 80%.
arXiv Detail & Related papers (2022-05-04T03:29:50Z) - Learning Scalable $\ell_\infty$-constrained Near-lossless Image
Compression via Joint Lossy Image and Residual Compression [118.89112502350177]
We propose a novel framework for learning $ell_infty$-constrained near-lossless image compression.
We derive the probability model of the quantized residual by quantizing the learned probability model of the original residual.
arXiv Detail & Related papers (2021-03-31T11:53:36Z) - Modeling Lost Information in Lossy Image Compression [72.69327382643549]
Lossy image compression is one of the most commonly used operators for digital images.
We propose a novel invertible framework called Invertible Lossy Compression (ILC) to largely mitigate the information loss problem.
arXiv Detail & Related papers (2020-06-22T04:04:56Z) - Discernible Image Compression [124.08063151879173]
This paper aims to produce compressed images by pursuing both appearance and perceptual consistency.
Based on the encoder-decoder framework, we propose using a pre-trained CNN to extract features of the original and compressed images.
Experiments on benchmarks demonstrate that images compressed by using the proposed method can also be well recognized by subsequent visual recognition and detection models.
arXiv Detail & Related papers (2020-02-17T07:35:08Z)
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.