Progressive Compression Techniques
- Progressive compression is a method that encodes data as an ordered sequence of refinement units, allowing valid approximations from early truncations of the bitstream.
- It enables multi-stage decoding where initial segments yield coarse reconstructions that are incrementally refined for improved fidelity, semantic specificity, and task performance.
- Applications span learned image and video coding, scientific data retrieval, and model compression, with measurable gains in metrics like PSNR, MSE, and classification accuracy.
Progressive compression denotes a class of compression schemes in which a valid approximation can be reconstructed from an initial prefix of a bitstream or from an initial subset of stored components, and then refined as more information becomes available. In the literature, this appears as “one bitstream, many quality points,” “fine-granularity scalability,” “rateless” coding, “progressive-precision” retrieval, and multi-stage refinement. The underlying objective is not restricted to pixel fidelity: depending on the system, successive refinements may improve perceptual quality, semantic specificity, downstream classification accuracy, source-estimation MSE, rendering fidelity, or model efficiency (Lu et al., 2021, Magri et al., 2023, Hwang et al., 2024, Kim et al., 8 May 2026).
1. Historical development and conceptual scope
Progressive compression has long been associated with partial decoding from a single encoded representation. In learned image compression, the classical formulation is “one bitstream, many quality points,” with transmission stopping when bandwidth or device capability is exhausted (Kim et al., 8 May 2026). Earlier work on triangular meshes already embodied the same principle through irregular multi-resolution analysis, in which a base mesh is progressively refined by topology updates and wavelet-detail coefficients, with adaptive per-vertex quantization used to optimize the rate-distortion compromise (Abderrahim et al., 2013).
A distinct systems interpretation emerged in data management. “Progressive Compressed Records” organizes progressive JPEG scans so that a single dataset can be accessed at multiple fidelities without adding to the total dataset size, reducing training bandwidth and potentially doubling training speed when the workload is I/O-bound (Kuchnik et al., 2019). Scientific computing generalized the idea further: a compressor-agnostic framework represents a field as a partial sum of components, allowing progressive-precision retrieval independently of the underlying compressor or number representation, and even enabling fully lossless recovery when enough components are used (Magri et al., 2023).
The learned-codec literature made progressiveness explicit at the latent level. PLONQ introduced nested quantization and latent ordering to obtain a single embedded bitstream whose truncation yields valid reconstructions at multiple bitrates, and described itself as the first learning-based progressive image coding scheme (Lu et al., 2021). Later work broadened the target beyond human-viewed fidelity. ProgDTD trained CNN-based codecs so that early bottleneck channels carry higher-priority information (Hojjat et al., 2023). PICM-Net treated progressive decoding as a machine-perception problem with fine-granularity scalability and an adaptive decoding controller (Kim et al., 23 Dec 2025). “Coarse-to-Fine” then argued that, for machine vision, intermediate stages should align not merely with rate budgets or sample difficulty but with semantic hierarchies, from broad categories to fine-grained classes (Kim et al., 8 May 2026).
A common misconception is that progressive compression is only a display-oriented preview mechanism. The surveyed work contradicts that narrow reading: the same progressive principle is used for machine classification under varying bandwidth, scientific-data retrieval under changing error bounds, fronthaul adaptation in distributed sensing, on-demand neural rendering, and parameter-efficient model compression (Wang et al., 2023, Sohrabi et al., 2022, Chen et al., 11 Mar 2025, Hwang et al., 2024).
2. Structural principles and progressive carriers
Across domains, progressive compression is implemented by decomposing an object into ordered refinement units. Those units may be scans, components, latent channels, trit-planes, token maps, RVQ stages, or refinement steps in a diffusion chain. What matters is that early units are decodable on their own and later units are conditionally useful given earlier ones.
PLONQ offers a canonical embedded-bitstream construction. It quantizes the same latent tensor at nested levels and transmits conditional refinement indices so that the total code length matches coding the finest level alone, while intermediate refinements are ordered by latent importance using the hyperprior standard deviations as a proxy for (Lu et al., 2021). Trit-plane codecs take another route: each quantized coefficient is expanded into ternary digits, or trits, so that most-significant trits are transmitted first and the bitstream is intrinsically truncatable at fine granularity (Jeon et al., 2023, Kim et al., 23 Dec 2025). In “Efficient Progressive Image Compression with Variance-aware Masking,” the progressive carrier is the element-wise residual between base-quality and top-quality latents, partitioned by a deterministic mask computed from predicted variances, with missing entries replaced by hyperprior means at the decoder (Presta et al., 2024).
Residual representations recur in other modalities. ProGIC uses residual vector quantization, where a sequence of vector quantizers encodes residuals stage by stage and the codewords sum to a coarse-to-fine reconstruction, producing a progressive bitstream by concatenating stage indices (Cao et al., 3 Mar 2026). ProGVC constructs hierarchical multi-scale residual token maps for intra and inter video features, transmitting all intra scales and only a prefix of inter scales to obtain progressively sharper video reconstructions and generative completion of discarded scales (Li et al., 18 Mar 2026). In scientific data, the general framework iteratively compresses the current residual field and stores the resulting components along a new component dimension, while IPComp organizes quantized residuals into bitplanes and supports progressive retrieval of the most significant bitplanes (Magri et al., 2023, Yang et al., 6 Feb 2025). PCGS combines progressive masking, which controls when anchors first appear, with progressive quantization, which progressively reduces quantization step sizes for Gaussian attributes (Chen et al., 11 Mar 2025).
| Domain | Progressive carrier | Representative mechanism |
|---|---|---|
| Learned image compression | Latent levels, channels, trits, residual elements | Nested quantization, tail-drop, trit-plane coding, variance-aware masking |
| Video compression | Multi-scale residual token maps | Coarse-to-fine transmission of intra/inter scales with autoregressive context |
| Scientific data | Residual components or bitplanes | Partial-sum retrieval, bitplane loading, predictive coding |
| 3D geometry and scenes | Mesh detail bands or Gaussian refinements | Multi-resolution wavelets, progressive masking, progressive quantization |
| Models and tokens | Stages, adapters, repeated frames | Progressive teacher updates, gradual weight removal, progressive token supplementation |
This variety suggests that “progressive compression” is best understood as an ordering discipline over refinement variables rather than as a single coding architecture.
3. From visual fidelity to task-aware and semantic progressiveness
Recent work distinguishes several notions of what the early portion of a progressive representation should optimize. Earlier progressive machine codecs were described as adapting to sample-by-sample difficulty, or “easy-to-hard,” but “Coarse-to-Fine” argues that semantic-level scalability is more meaningful for machine vision (Kim et al., 8 May 2026). Its central contribution is a three-level semantic hierarchy over ImageNet-1K—coarse , intermediate , fine —constructed by k-means clustering in CLIP’s normalized text-embedding space rather than by naïve depth cuts of WordNet, which were reported to produce extremely unbalanced clusters. The CLIP-based hierarchy is reported as both visually meaningful and balanced, with intra-cluster Wu–Palmer similarity $0.583$ versus inter-cluster $0.426$ at (Kim et al., 8 May 2026).
The codec maps an image to a -channel latent tensor and partitions channels into prefixes of lengths $128$, $224$, and 0. Decoding only the first 1 channels yields a reconstruction optimized for coarse-level classification; 2 channels add intermediate semantics; all 3 channels support fine-grained recognition. Within each prefix, symbols are ordered by predicted scale 4, largest first. Training uses a multi-stage rate–distortion–task loss,
5
with 6 and cross-entropy terms weighted for coarse, intermediate, and fine scales. The reported effect is that the first 7 channels learn broad distinctions, the next 8 mid-level features, and the final 9 fine-grained details. At approximately 0 bpp, coarse-level top-1 accuracy exceeds all seven baselines by over 1 points, and the overall Wu–Palmer similarity improves by about 2 across ResNet-50, ConvNeXt-Tiny, and MobileNetV3 classifiers (Kim et al., 8 May 2026).
A different task-aware formulation appears in PNC for adaptive image offloading under timing constraints. There the progressive variable is a prefix of 3 latent feature channels, learned by stochastic taildrop so that prefixes remain useful to a fixed EfficientNet-B0 classifier (Wang et al., 2023). On the reported Raspberry Pi 4 to edge-server testbed, PNC degrades gracefully as transmitted bytes decrease, and under tight deadlines and heavy jamming it substantially outperforms Progressive JPEG, WebP, Starfish, and an RNN-based progressive compressor (Wang et al., 2023).
PICM-Net frames machine-oriented progressive compression as fine-granularity scalability over trit-planes, coupled with an adaptive decoding controller that stops once classifier confidence is sufficient (Kim et al., 23 Dec 2025). Its loss,
4
uses cross-entropy of a frozen ResNet-50 as the dominant distortion term, with 5 and 6. The paper also reports that no prioritization strategy dominates across all rates, which tempers strong claims that a single importance-ordering rule is universally optimal (Kim et al., 23 Dec 2025).
ProgDTD occupies an intermediate position. It remains fidelity-oriented, but shows that partial bottleneck prefixes can preserve high ImageNet top-5 accuracy when the model is explicitly trained to sort information by channel index; without that training, truncating channels causes reconstruction failure (Hojjat et al., 2023). Taken together, these results establish that “progressive” no longer refers only to visually smoother previews. It may also mean progressively increasing semantic specificity, classification reliability, or deadline-constrained task utility.
4. Domain-specific realizations beyond standard image coding
Scientific-data compression has developed particularly explicit theories of progressiveness. The general framework for progressive data compression and retrieval represents a field as
7
where each component 8 approximates the current residual under a prescribed tolerance sequence. Because each component is self-contained, a user can request only the first 9 components and reconstruct 0, while compression and decompression time scale with the number and granularity of components (Magri et al., 2023). IPComp specializes this strategy to interpolation-based lossy compression. It uses multi-level bitplane and predictive coding, derives optimized retrieval strategies under user-specified error bounds or retrieval sizes, and reports up to 1 higher compression ratios, 2 faster speed, up to 3 less retrieved data under the same error bound, and up to 4 lower error under the same bitrate than competing progressive compressors (Yang et al., 6 Feb 2025).
Three-dimensional data introduce both topology and geometry as progressive variables. For triangular meshes, adaptive quantization within an irregular multi-resolution Wavemesh framework progressively refines geometry while coding inverse-subdivision connectivity updates, with reported total bit-per-vertex reductions of 5–6 versus original Wavemesh and best improvements below 7 bpv (Abderrahim et al., 2013). For 3D Gaussian Splatting, PCGS enables progressivity by jointly controlling the quantity of anchors and the quality of anchor attributes. On Mip-NeRF360, the first level is reported at about 8 MB with PSNR about 9 dB, and the second cumulative level at about $0.583$0 MB with PSNR about $0.583$1 dB; the paper states that PCGS attains the same fidelity as HAC++ at a smaller size while remaining progressive (Chen et al., 11 Mar 2025).
Distributed estimation places progressiveness inside multi-agent acquisition rather than in a single media file. In the local-CSI framework, each agent learns a progressive linear-combination and uniform-quantization strategy such that if fronthaul permits only $0.583$2 bits, only the first $0.583$3 compressed coefficients are sent. The reported DNN-based local-CSI design outperforms EVD at small $0.583$4 and achieves the same MSE with about $0.583$5 less signaling than BCD for moderate $0.583$6 (Sohrabi et al., 2022).
Progressive compression also appears in model and token representations. Multi-stage progressive compression of conformer transducers uses successive teacher-student KD steps, updating the teacher to the newly distilled student at each stage, and reports compression rates greater than $0.583$7 without significant degradation on LibriSpeech (Rathod et al., 2022). PC-LoRA progressively removes pre-trained weights during fine-tuning until only low-rank adapters remain, reporting parameter/FLOPs compression of $0.583$8 for ViT-B and $0.583$9 for BERT (Hwang et al., 2024). PVC treats every image as a repeated static video and progressively supplements spatial detail across frames while exploiting temporal redundancy for real videos, using $0.426$0 tokens per frame by default (Yang et al., 2024). These systems are not source coders in the narrow sense, but they preserve the central progressive property: later stages add information not extracted earlier.
5. Optimization objectives, entropy models, and decoder design
Modern progressive compressors are typically trained end-to-end across multiple truncation points rather than at a single final rate. ProgDTD approximates the multi-objective problem over all retained-channel counts by sampling a random keep count $0.426$1 during training and minimizing the expected rate-distortion loss for that prefix in both latent and hyperlatent bottlenecks (Hojjat et al., 2023). “Coarse-to-Fine” extends this to a multi-stage rate–distortion–task objective with separate CE terms per semantic level, making intermediate decodes first-class training targets rather than by-products (Kim et al., 8 May 2026). ProGIC similarly optimizes every RVQ stage jointly using weighted reconstruction, LPIPS, GAN, and VQ losses so that each partial sum of codewords is directly decodable (Cao et al., 3 Mar 2026). ProGVC trains a Transformer-based perceptual video codec with a compound loss that combines expected arithmetic-coding length, $0.426$2, LPIPS, GAN, and commitment terms, with explicit weights $0.426$3, $0.426$4, $0.426$5, $0.426$6, and $0.426$7 (Li et al., 18 Mar 2026).
Entropy modeling is equally central. Hyperpriors, channel-wise autoregression, and context fusion dominate the learned image-codec variants. In “Coarse-to-Fine,” Gaussian parameters are predicted from hyper-decoder features and context-model outputs, then refined at higher semantic levels by additive $0.426$8-networks for prefixes $0.426$9 (Kim et al., 8 May 2026). CTC adds a Context-based Rate Reduction module, which applies a 0-tempered softmax to sharpen or flatten trit probabilities before ANS coding, and a Context-based Distortion Reduction module to refine partial latent tensors from decoded trit-planes (Jeon et al., 2023). The variance-aware masking method preserves element-wise scalability without extra signaling because the mask is deterministically reconstructed from predicted variances, and its Rate Enhancement Modules refine entropy parameters using already decoded content (Presta et al., 2024).
Some approaches reinterpret the generative model itself as a progressive coder. In universally quantized diffusion models, the Gaussian diffusion posterior is replaced by a uniform-noise channel with the same mean and variance, so that the negative ELBO coincides exactly with the expected bit-cost of communicating the forward-process samples under the learned reverse model, up to constant overhead (Yang et al., 2024). This construction yields one model for any rate from lossy to lossless and supports tractable entropy coding at each diffusion step. ProGVC uses a masked Transformer to predict token probabilities both for arithmetic coding of transmitted tokens and for MAP prediction of omitted fine-scale tokens at the decoder, explicitly unifying entropy coding and generative completion inside the same autoregressive context model (Li et al., 18 Mar 2026).
Decoder design reflects the same multi-level discipline. Some systems guarantee a valid reconstruction at every truncation point by filling missing variables with conditional means or coarse-scale predictions. Variance-aware masking replaces absent top-latent residuals with hyperprior means (Presta et al., 2024). Trit-plane codecs reconstruct coefficients as posterior means conditioned on already decoded trits (Jeon et al., 2023). ProGVC hallucinates discarded scales by maximum-a-posteriori selection from the same token model that drove entropy coding (Li et al., 18 Mar 2026). This suggests that progressive compression is increasingly inseparable from conditional inference: a truncated code is not merely incomplete data, but a state for a probabilistic decoder.
6. Performance patterns, trade-offs, and open technical issues
Empirical results across the surveyed literature show that progressiveness need not imply severe overhead, but the trade-offs are domain- and objective-dependent. PLONQ reports 1–2 dB gains over SPIHT across 3–4 bpp on the JPEG AI test set and an average Bjøntegaard-5 bitrate of approximately 6 relative to BPG444, while adding only a few percent of progressive overhead over a non-progressive latent-scaling baseline (Lu et al., 2021). CTC reports BD-rate savings of 7 on Kodak, 8 on CLIC, and 9 on JPEG-AI relative to the baseline trit-plane codec, with only marginally higher complexity (Jeon et al., 2023). ProGVC reports up to 0–1 BD-rate savings in DISTS and NIQE while maintaining practical scalability, and ProGIC reports bitrate savings up to 2 on DISTS and 3 on LPIPS compared with MS-ILLM, together with over 4 faster encoding and decoding on GPUs (Li et al., 18 Mar 2026, Cao et al., 3 Mar 2026).
At the same time, progressive ordering constraints can reduce peak-rate fidelity if early units are overly privileged. ProgDTD reports about a 5–6 dB PSNR loss at high bpp because final channels are less optimized, although MS-SSIM remains comparable and partial-channel decoding becomes useful rather than catastrophic (Hojjat et al., 2023). The variance-aware masking method explicitly notes a slight drop at the very highest bitrates, and universally quantized diffusion models trade a small drop in peak PSNR for full progressive decoding and tractable entropy coding (Presta et al., 2024, Yang et al., 2024). These are not contradictions; they reflect the fact that a progressive codec must optimize a family of operating points, not a single terminal one.
Another technical issue is how to define “importance.” Some systems use variance or scale as a proxy for coding benefit, such as PLONQ’s 7-ordering and variance-aware masking’s 8-based selection (Lu et al., 2021, Presta et al., 2024). Others derive semantic or task-conditioned orderings, as in the CLIP-based hierarchies of “Coarse-to-Fine” or the machine-oriented prioritization strategies of PICM-Net (Kim et al., 8 May 2026, Kim et al., 23 Dec 2025). PICM-Net reports that no strategy dominates across all rates, while “Coarse-to-Fine” reports that front-loading channels to coarse semantics with a 9 split yields the best hierarchical accuracy. A plausible implication is that optimal ordering is contingent on the evaluation target: MSE reduction per bit, perceptual realism, semantic correctness, and confidence calibration need not induce the same priority relation.
A further open question concerns stopping rules. PNC stops transmission when sending another block would miss the deadline; PICM-Net uses a learned suitability filter to stop when predicted classification reliability exceeds a threshold; scientific frameworks choose how many components or bitplanes to load based on error or size constraints (Wang et al., 2023, Kim et al., 23 Dec 2025, Yang et al., 6 Feb 2025). This shifts progressive compression from a static coding property to a control problem over bitrate, latency, and utility.
The broad trajectory is therefore clear. Progressive compression began as partial reconstruction from a single stream, but current work turns it into a general framework for ordered representation learning: early information supports coarse decisions or low-cost previews, later information sharpens fidelity or semantics, and the same encoded object can serve multiple resource budgets and downstream objectives without re-encoding or duplicated storage (Kuchnik et al., 2019, Magri et al., 2023, Kim et al., 8 May 2026).