HiDE: Hierarchical Dictionary-Based Entropy Modeling for Learned Image Compression

• URL: http://arxiv.org/abs/2603.06766v1
• Date: Fri, 06 Mar 2026 15:15:07 GMT
• Title: HiDE: Hierarchical Dictionary-Based Entropy Modeling for Learned Image Compression
• Abstract summary: We propose HiDE, a Hierarchical Dictionary-based Entropy modeling framework for learned image compression.<n>We show that HiDE achieves 18.5%, 21.99%, and 24.01% BD-rate savings over VTM-12.1 on the Kodak, CLIC, and Tecnick datasets.
• Score: 10.435646730519222
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Learned image compression (LIC) has achieved remarkable coding efficiency, where entropy modeling plays a pivotal role in minimizing bitrate through informative priors. Existing methods predominantly exploit internal contexts within the input image, yet the rich external priors embedded in large-scale training data remain largely underutilized. Recent advances in dictionary-based entropy models have demonstrated that incorporating external priors can substantially enhance compression performance. However, current approaches organize heterogeneous external priors within a single-level dictionary, resulting in imbalanced utilization and limited representational capacity. Moreover, effective entropy modeling requires not only expressive priors but also a parameter estimation network capable of interpreting them. To address these challenges, we propose HiDE, a Hierarchical Dictionary-based Entropy modeling framework for learned image compression. HiDE decomposes external priors into global structural and local detail dictionaries with cascaded retrieval, enabling structured and efficient utilization of external information. Moreover, a context-aware parameter estimator with parallel multi-receptive-field design is introduced to adaptively exploit heterogeneous contexts for accurate conditional probability estimation. Experimental results show that HiDE achieves 18.5%, 21.99%, and 24.01% BD-rate savings over VTM-12.1 on the Kodak, CLIC, and Tecnick datasets, respectively.

Related papers

• PDE-Constrained Optimization for Neural Image Segmentation with Physics Priors [0.0]
  Images of microscopy images constitutes an ill-posed inverse problem due to measurement noise, weak object boundaries, and limited labeled data.<n>In this work, image segmentation is formulated as a PDE-constrained optimization problem that integrates physically motivated priors into deep learning models.<n>Experiments are conducted on the LIVECell dataset, a high-quality, manually annotated collection of phase-contrast microscopy images.
  arXiv  Detail & Related papers  (2026-02-01T07:28:14Z)
• Visual Autoregressive Modelling for Monocular Depth Estimation [69.01449528371916]
  We propose a monocular depth estimation method based on visual autoregressive ( VAR) priors.<n>Our method adapts a large-scale text-to-image VAR model and introduces a scale-wise conditional upsampling mechanism.<n>We report state-of-the-art performance in indoor benchmarks under constrained training conditions, and strong performance when applied to outdoor datasets.
  arXiv  Detail & Related papers  (2025-12-27T17:08:03Z)
• Unlocking Out-of-Distribution Generalization in Dynamics through Physics-Guided Augmentation [46.40087254928057]
  We present SPARK, a physics-guided quantitative augmentation plugin.<n>Experiments on diverse benchmarks demonstrate that SPARK significantly outperforms state-of-the-art baselines.
  arXiv  Detail & Related papers  (2025-10-28T09:30:35Z)
• Knowledge-Informed Neural Network for Complex-Valued SAR Image Recognition [51.03674130115878]
  We introduce the Knowledge-Informed Neural Network (KINN), a lightweight framework built upon a novel "compression-aggregation-compression" architecture.<n>KINN establishes a state-of-the-art in parameter-efficient recognition, offering exceptional generalization in data-scarce and out-of-distribution scenarios.
  arXiv  Detail & Related papers  (2025-10-23T07:12:26Z)
• Entropy-Based Block Pruning for Efficient Large Language Models [81.18339597023187]
  We propose an entropy-based pruning strategy to enhance efficiency while maintaining performance.<n> Empirical analysis reveals that the entropy of hidden representations decreases in the early blocks but progressively increases across most subsequent blocks.
  arXiv  Detail & Related papers  (2025-04-04T03:42:34Z)
• Learned Image Compression with Dictionary-based Entropy Model [32.966391277632646]
  Entropy model plays a key role in learned image compression.<n>Most existing methods employed hyper-prior and auto-regressive architectures to form their entropy models.<n>We propose a novel entropy model named Dictionary-based Cross Attention Entropy model.
  arXiv  Detail & Related papers  (2025-04-01T07:43:10Z)
• SEE: Sememe Entanglement Encoding for Transformer-bases Models Compression [20.824040486029354]
  Transformer-based large language models exhibit groundbreaking capabilities, but their storage and computational costs are high, limiting their application in resource-constrained scenarios.<n>An effective approach is to eliminate redundant model parameters and computational costs while incorporating efficient expert-derived knowledge structures to achieve a balance between compression and performance.
  arXiv  Detail & Related papers  (2024-12-15T12:01:43Z)
• Structural Entropy Guided Probabilistic Coding [52.01765333755793]
  We propose a novel structural entropy-guided probabilistic coding model, named SEPC.<n>We incorporate the relationship between latent variables into the optimization by proposing a structural entropy regularization loss.<n> Experimental results across 12 natural language understanding tasks, including both classification and regression tasks, demonstrate the superior performance of SEPC.
  arXiv  Detail & Related papers  (2024-12-12T00:37:53Z)
• Dynamic Kernel-Based Adaptive Spatial Aggregation for Learned Image Compression [63.56922682378755]
  We focus on extending spatial aggregation capability and propose a dynamic kernel-based transform coding. The proposed adaptive aggregation generates kernel offsets to capture valid information in the content-conditioned range to help transform. Experimental results demonstrate that our method achieves superior rate-distortion performance on three benchmarks compared to the state-of-the-art learning-based methods.
  arXiv  Detail & Related papers  (2023-08-17T01:34:51Z)
• Entroformer: A Transformer-based Entropy Model for Learned Image Compression [17.51693464943102]
  We propose a novel transformer-based entropy model, termed Entroformer, to capture long-range dependencies in probability distribution estimation. The experiments show that the Entroformer achieves state-of-the-art performance on image compression while being time-efficient.
  arXiv  Detail & Related papers  (2022-02-11T08:03:31Z)
• Learning Context-Based Non-local Entropy Modeling for Image Compression [140.64888994506313]
  In this paper, we propose a non-local operation for context modeling by employing the global similarity within the context. The entropy model is further adopted as the rate loss in a joint rate-distortion optimization. Considering that the width of the transforms is essential in training low distortion models, we finally produce a U-Net block in the transforms to increase the width with manageable memory consumption and time complexity.
  arXiv  Detail & Related papers  (2020-05-10T13:28:18Z)

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.