Sign inGet started
Paper · arXiv

ARCHE: Autoregressive Residual Compression with Hyperprior and Excitation

Recent progress in learning-based image compression has demonstrated that end-to-end optimization can substantially outperform traditional codecs by jointly learning compact latent representations and probabilistic entropy models. However, many existing approaches achieve high rate-distortion efficiency at the expense of increased computational cost and limited parallelism. This paper presents ARCHE - Autoregressive Residual Compression with Hyperprior and Excitation, an end-to-end learned image compression framework that balances modeling accuracy and computational efficiency. The proposed architecture unifies hierarchical, spatial, and channel-based priors within a single probabilistic ...

AuthorsSofia Iliopoulou, Dimitris Ampeliotis, Athanassios Skodras
Primary categoryeess.IV
Published10 March 2026
Last updated at source10 March 2026
eess.IVcs.CVcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/95ca0779-4a1e-4e1a-be46-3c1e0cd8bf84" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.