An Information-Theoretic Regularizer for Lossy Neural Image Compression
원문 초록
Lossy image compression networks aim to minimize the latent entropy of images while adhering to specific distortion constraints. However, optimizing the neural network can be challenging due to its nature of learning quantized latent representations. In this paper, our key finding is that minimizing the latent entropy is, to some extent, equivalent to maximizing the conditional source entropy, an insight that is deeply rooted in information-theoretic equalities. Building on this insight, we propose a novel structural regularization method for the neural image compression task by incorporating the negative conditional source entropy into the training objective, such that both the optimization efficacy and the model's generalization ability can be promoted. The proposed information-theoretic regularizer is interpretable, plug-and-play, and imposes no inference overheads. Extensive experiments demonstrate its superiority in regularizing the models and further squeezing bits from the latent representation across various compression structures and unseen domains.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Perception-Oriented Latent Coding for High-Performance Compressed Domain Semantic Inference
NIC-RobustBench: A Comprehensive Open-Source Toolkit for Neural Image Compression and Robustness Analysis
DiffO: Single-step Diffusion for Image Compression at Ultra-Low Bitrates
ABC: Adaptive BayesNet Structure Learning for Computational Scalable Multi-task Image Compression
Flexible Mixed Precision Quantization for Learned Image Compression
Structured Pruning and Quantization for Learned Image Compression
토론
이 논문과 연결된 포럼 글이 아직 없습니다.