Papers for

image compression engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Task aware compression improves classification by matching distributions

The Hidden Perception Constraint in Task-Aware Compression

Abstract: With the recent advancements of neural compressors, explicitly incorporating perception constraints into the design of compression schemes has gained significant attention. Traditionally, these perception constraints ensure that the distribution of the reconstruction does not significantly deviate from the distribution of the source, thus attesting to the perceptual quality of the reconstruction. In this work, we uncover several perception constraints that are naturally present in task-aware compression. In particular, we consider a problem where the primary task is reconstruction and the secondary task is classification (i.e., a statistical test). We study this problem at varying levels of domain information available to us and discuss how to utilize the naturally emerging perception constraints to design rate-minimal compression schemes that also maximize the utility of our secondary task. We show that in this setting, if the decision boundaries of the classifier are ill-defined (mismatch) for our source distribution, then matching onto a target distribution enhances our classification accuracy.

Mon 28 SeptInformation TheoryMachine Learning
The gist
Compression schemes often aim to keep data looking and sounding natural so people think they are good quality. This paper looks at compression designed not just to keep things looking good but also to help computers classify information accurately. The authors find that when the classification rules don't fit the original data well, changing the compressed data to look like a better suited target helps classification work better. This means the way data is compressed can secretly influence how well computers understand it afterward.
Open → 2609.35684v1

Implicit neural image coding achieves fast encoding and ultra-fast decoding

PIC: Revisiting INR for Image Coding with Fast Encoding and Sub-Millisecond Decoding

Abstract: Implicit neural representation (INR) has achieved remarkable progress in novel view synthesis and image/video coding in recent years.Compared to conventional end-to-end image codecs, INR-based compressors demonstrate significant advantages in decoding complexity. However, their practical application has been hindered by the inferior encoding speed and underutilized decoding efficiency.In this work, we propose a feedforward INR image coding architecture, Practical INR Image Codec (PIC), that computes all the necessary information for INR network in a single forward pass, achieving an encoding speed of 20 FPS. Additionally, we implement a highly optimized decoder that reaches 2000 FPS decoding speed, significantly surpassing JPEG's performance at comparable rate-distortion (RD) performance. To the best of our knowledge, this work presents the first learning-based image codec that simultaneously outperforms or is comparable with JPEG in both RD performance and decoding speed while maintaining practical encoding speed. Code is available at https://github.com/actcwlf/PIC.

Tue 8 SeptComputer Vision and Pattern Recognition
The gist
Encoding images for storage or transmission usually takes a long time with some newer techniques, even if decoding is fast. The authors revisited a way of representing images called Implicit Neural Representation (INR), and built a new system that can encode images quickly in one pass and decode them extremely fast — even faster than older popular formats like JPEG while giving similar quality. This means images can be compressed and viewed with less delay, which can be useful for many applications.
Open → 2609.09020v1