Lossy Image Compression with Stochastic Quantization
Anton Kozyriev, Vladimir Norkin

TL;DR
This paper introduces a stochastic quantization method for lossy image compression that reframes color quantization as a transportation problem, improving scalability and efficiency for large images.
Contribution
It proposes a novel stochastic transportation approach to color quantization, enhancing scalability and performance over traditional algorithms like K-Means.
Findings
Demonstrates improved compression quality on ImageNet images.
Shows increased computational efficiency and scalability.
Outperforms traditional color quantization methods.
Abstract
Lossy image compression algorithms play a crucial role in various domains, including graphics, and image processing. As image information density increases, so do the resources required for processing and transmission. One of the most prominent approaches to address this challenge is color quantization, proposed by Orchard et al. (1991). This technique optimally maps each pixel of an image to a color from a limited palette, maintaining image resolution while significantly reducing information content. Color quantization can be interpreted as a clustering problem (Krishna et al. (1997), Wan (2019)), where image pixels are represented in a three-dimensional space, with each axis corresponding to the intensity of an RGB channel. However, scaling of traditional algorithms like K-Means can be challenging for large data, such as modern images with millions of colors. This paper reframes color…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
