TL;DR
AQMP is an innovative image compression method that adaptively refines quadtree blocks and employs hyperparameter optimization to achieve higher compression ratios with maintained quality.
Contribution
It introduces a novel adaptive quadtree refinement combined with matching pursuit and hyperparameter optimization, outperforming traditional fixed-block methods.
Findings
Achieves up to 4x higher compression than JPEG at similar SSIM.
Offers significant parallelization opportunities during compression.
Provides a publicly available implementation for reproducibility.
Abstract
We present AQMP, a novel image codec combining Adaptive Quadtree Refinement with Matching Pursuit. Unlike conventional Matching Pursuit methods that operate on fixed-size sub-images, AQMP dynamically adapts block sizes to local image structure, allocating finer partitions where the image is complex and coarser ones where it is smooth. This adaptivity yields superior compression ratios compared to fixed-size block Matching Pursuit at equivalent image quality, while offering significant parallelization opportunities at both the tree-leaf level and during compression of individual nodes. The algorithm is governed by user-specified accuracy and sparsity parameters alongside a small set of additional hyperparameters. To navigate the trade-off between compression efficiency and visual quality, we perform multi-objective hyperparameter optimization using the Tree-Structured Parzen Estimator,…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
