COMPASS: High-Efficiency Deep Image Compression with Arbitrary-scale Spatial Scalability

• URL: http://arxiv.org/abs/2309.07926v1
• Date: Mon, 11 Sep 2023 14:05:18 GMT
• Title: COMPASS: High-Efficiency Deep Image Compression with Arbitrary-scale Spatial Scalability
• Authors: Jongmin Park, Jooyoung Lee and Munchurl Kim
• Abstract summary: We propose a novel NN-based spatially scalable image compression method, called Compass, which supports arbitrary-scale spatial scalability. Our proposed Compass has a very flexible structure where the number of layers and their respective scale factors can be arbitrarily determined during inference. Experimental results show that our Compass achieves BD-rate gain of -58.33% and -47.17% at maximum compared to SHVC and the state-of-the-art NN-based spatially scalable image compression method, respectively.
• Score: 28.270200666064163
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently, neural network (NN)-based image compression studies have actively been made and has shown impressive performance in comparison to traditional methods. However, most of the works have focused on non-scalable image compression (single-layer coding) while spatially scalable image compression has drawn less attention although it has many applications. In this paper, we propose a novel NN-based spatially scalable image compression method, called COMPASS, which supports arbitrary-scale spatial scalability. Our proposed COMPASS has a very flexible structure where the number of layers and their respective scale factors can be arbitrarily determined during inference. To reduce the spatial redundancy between adjacent layers for arbitrary scale factors, our COMPASS adopts an inter-layer arbitrary scale prediction method, called LIFF, based on implicit neural representation. We propose a combined RD loss function to effectively train multiple layers. Experimental results show that our COMPASS achieves BD-rate gain of -58.33% and -47.17% at maximum compared to SHVC and the state-of-the-art NN-based spatially scalable image compression method, respectively, for various combinations of scale factors. Our COMPASS also shows comparable or even better coding efficiency than the single-layer coding for various scale factors.

Related papers

• Efficient CNN Compression via Multi-method Low Rank Factorization and Feature Map Similarity [0.0]
  Low-Rank Factorization (LRF) is a widely adopted technique for compressing deep neural networks (DNNs)<n>It faces several challenges, including optimal rank selection, a vast design space, long fine-tuning times, and limited compatibility with different layer types and decomposition methods.<n>This paper presents an end-to-end Design Space Exploration methodology and framework for compressing CNNs.
  arXiv  Detail & Related papers  (2025-09-29T08:44:02Z)
• Explicit Residual-Based Scalable Image Coding for Humans and Machines [0.0]
  scalable image compression methods serve both machine and human vision.<n>In this paper, we enhance the coding efficiency and interpretability of ICMH framework by integrating an explicit residual compression mechanism.<n>We propose two complementary methods: Feature Residual-based Residual-based Coding (FR-ICMH) and Pixel Residual-based Residual-based Coding (PR-ICMH)
  arXiv  Detail & Related papers  (2025-06-24T04:01:53Z)
• Multi-Scale Invertible Neural Network for Wide-Range Variable-Rate Learned Image Compression [90.59962443790593]
  In this paper, we present a variable-rate image compression model based on invertible transform to overcome limitations. Specifically, we design a lightweight multi-scale invertible neural network, which maps the input image into multi-scale latent representations. Experimental results demonstrate that the proposed method achieves state-of-the-art performance compared to existing variable-rate methods.
  arXiv  Detail & Related papers  (2025-03-27T09:08:39Z)
• FD-LSCIC: Frequency Decomposition-based Learned Screen Content Image Compression [67.34466255300339]
  This paper addresses three key challenges in SC image compression: learning compact latent features, adapting quantization step sizes, and the lack of large SC datasets. We introduce an adaptive quantization module that learns scaled uniform noise for each frequency component, enabling flexible control over quantization granularity. We construct a large SC image compression dataset (SDU-SCICD10K), which includes over 10,000 images spanning basic SC images, computer-rendered images, and mixed NS and SC images from both PC and mobile platforms.
  arXiv  Detail & Related papers  (2025-02-21T03:15:16Z)
• Layer- and Timestep-Adaptive Differentiable Token Compression Ratios for Efficient Diffusion Transformers [55.87192133758051]
  Diffusion Transformers (DiTs) have achieved state-of-the-art (SOTA) image generation quality but suffer from high latency and memory inefficiency. We propose DiffCR, a dynamic DiT inference framework with differentiable compression ratios.
  arXiv  Detail & Related papers  (2024-12-22T02:04:17Z)
• DeepHQ: Learned Hierarchical Quantizer for Progressive Deep Image Coding [27.875207681547074]
  progressive image coding (PIC) aims to compress various qualities of images into a single bitstream. Research on neural network (NN)-based PIC is in its early stages. We propose an NN-based progressive coding method that firstly utilizes learned quantization step sizes via learning for each quantization layer.
  arXiv  Detail & Related papers  (2024-08-22T06:32:53Z)
• Multi-scale Unified Network for Image Classification [33.560003528712414]
  CNNs face notable challenges in performance and computational efficiency when dealing with real-world, multi-scale image inputs. We propose Multi-scale Unified Network (MUSN) consisting of multi-scales, a unified network, and scale-invariant constraint. MUSN yields an accuracy increase up to 44.53% and diminishes FLOPs by 7.01-16.13% in multi-scale scenarios.
  arXiv  Detail & Related papers  (2024-03-27T06:40:26Z)
• Transferable Learned Image Compression-Resistant Adversarial Perturbations [66.46470251521947]
  Adversarial attacks can readily disrupt the image classification system, revealing the vulnerability of DNN-based recognition tasks. We introduce a new pipeline that targets image classification models that utilize learned image compressors as pre-processing modules.
  arXiv  Detail & Related papers  (2024-01-06T03:03:28Z)
• Multiscale Augmented Normalizing Flows for Image Compression [17.441496966834933]
  We present a novel concept, which adapts the hierarchical latent space for augmented normalizing flows, an invertible latent variable model. Our best performing model achieved average rate savings of more than 7% over comparable single-scale models.
  arXiv  Detail & Related papers  (2023-05-09T13:42:43Z)
• Effective Invertible Arbitrary Image Rescaling [77.46732646918936]
  Invertible Neural Networks (INN) are able to increase upscaling accuracy significantly by optimizing the downscaling and upscaling cycle jointly. A simple and effective invertible arbitrary rescaling network (IARN) is proposed to achieve arbitrary image rescaling by training only one model in this work. It is shown to achieve a state-of-the-art (SOTA) performance in bidirectional arbitrary rescaling without compromising perceptual quality in LR outputs.
  arXiv  Detail & Related papers  (2022-09-26T22:22:30Z)
• Rank-Enhanced Low-Dimensional Convolution Set for Hyperspectral Image Denoising [50.039949798156826]
  This paper tackles the challenging problem of hyperspectral (HS) image denoising. We propose rank-enhanced low-dimensional convolution set (Re-ConvSet) We then incorporate Re-ConvSet into the widely-used U-Net architecture to construct an HS image denoising method.
  arXiv  Detail & Related papers  (2022-07-09T13:35:12Z)
• Wavelet Feature Maps Compression for Image-to-Image CNNs [3.1542695050861544]
  We propose a novel approach for high-resolution activation maps compression integrated with point-wise convolutions. We achieve compression rates equivalent to 1-4bit activation quantization with relatively small and much more graceful degradation in performance.
  arXiv  Detail & Related papers  (2022-05-24T20:29:19Z)
• Estimating the Resize Parameter in End-to-end Learned Image Compression [50.20567320015102]
  We describe a search-free resizing framework that can further improve the rate-distortion tradeoff of recent learned image compression models. Our results show that our new resizing parameter estimation framework can provide Bjontegaard-Delta rate (BD-rate) improvement of about 10% against leading perceptual quality engines.
  arXiv  Detail & Related papers  (2022-04-26T01:35:02Z)
• Modeling Image Quantization Tradeoffs for Optimal Compression [0.0]
  Lossy compression algorithms target tradeoffs by quantizating high frequency data to increase compression rates. We propose a new method of optimizing quantization tables using Deep Learning and a minimax loss function.
  arXiv  Detail & Related papers  (2021-12-14T07:35:22Z)
• Variable-Rate Deep Image Compression through Spatially-Adaptive Feature Transform [58.60004238261117]
  We propose a versatile deep image compression network based on Spatial Feature Transform (SFT arXiv:1804.02815) Our model covers a wide range of compression rates using a single model, which is controlled by arbitrary pixel-wise quality maps. The proposed framework allows us to perform task-aware image compressions for various tasks.
  arXiv  Detail & Related papers  (2021-08-21T17:30:06Z)
• Asymmetric CNN for image super-resolution [102.96131810686231]
  Deep convolutional neural networks (CNNs) have been widely applied for low-level vision over the past five years. We propose an asymmetric CNN (ACNet) comprising an asymmetric block (AB), a mem?ory enhancement block (MEB) and a high-frequency feature enhancement block (HFFEB) for image super-resolution. Our ACNet can effectively address single image super-resolution (SISR), blind SISR and blind SISR of blind noise problems.
  arXiv  Detail & Related papers  (2021-03-25T07:10:46Z)

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.