Sign inGet started
Paper · arXiv

Tree-VQ: Progressive Image Compression from Pretrained Vector Quantizers

Progressive image compression requires a single embedded representation whose received prefixes can be decoded without re-encoding the source. Modern vector-quantized (VQ) image models provide strong discrete endpoint representations, but conventional flat codeword indices do not define meaningful intermediate states for a neural decoder. We present Tree-VQ, a post-hoc conversion of a pretrained flat VQ tokenizer into a fine-grained, arbitrary-prefix progressive representation while preserving its encoder assignments and every learned leaf vector. The key idea is to organize the original codebook into a balanced binary hierarchy, associate explicit representations with internal nodes, and...

AuthorsMingming Ma, Xinkun Wang, Tianyi Xu et al.
Primary categorycs.CV
Published3 September 2026
Last updated at source6 October 2026
cs.CV
Embed this entry
<iframe src="https://silytics.si/embed/item/afe0e3a2-6d1a-42d1-90b2-d5adca1754f4" 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.