End-to-end optimized image compression with competition of prior distributions
원문 초록
Convolutional autoencoders are now at the forefront of image compression research. To improve their entropy coding, encoder output is typically analyzed with a second autoencoder to generate per-variable parametrized prior probability distributions. We instead propose a compression scheme that uses a single convolutional autoencoder and multiple learned prior distributions working as a competition of experts. Trained prior distributions are stored in a static table of cumulative distribution functions. During inference, this table is used by an entropy coder as a look-up-table to determine the best prior for each spatial location. Our method offers rate-distortion performance comparable to that obtained with a predicted parametrized prior with only a fraction of its entropy coding and decoding complexity.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.