arXiv:2608.03517cs.CV2026-08

通过比特率调度优化生成式压缩的计算开销,实现超低码率下高效解码。

GVCCTurbo: Rate-Compute Quality Scheduling for Codebook Driven Generative Compression

论文配图:GVCCTurbo: Rate-Compute Quality Scheduling for Codebook Driven Generative Compression
图 1 · 摘自论文原文
  • 以比特率作为调度输入,分离模型重载与码本修正,降低计算冗余。
  • 在720p测试中解码时间减少44%,仅小幅增加LPIPS代价。
  • 适用于视频与图像压缩,兼容未来轻量化生成模型,适合实时应用。

基于码本的生成式压缩利用预训练图像或视频生成器作为零样本视觉先验,仅传输紧凑的码本索引以指导超低码率下的重建。现有编码器将每个有限码率修正绑定于一次新的先验评估,缩短采样器也同时减少了携带目标相关性信息的修正槽位。本文提出GVCCTurbo,一种以比特率(BPP)驱动的调度机制,将昂贵的先验重载与码本修正分离:在协议初始化阶段校准原子数和跳过间隙比后,将目标码本负载比特率映射为轨迹长度与重载周期,使BPP成为调度输入而非采样器长度的固定结果。同一端点预测与有限率控制接口同时覆盖GVCC风格的修正流视频与DDCM风格的扩散图像压缩,保持零训练部署能力,并兼容未来蒸馏后的生成先验。原生1080p曲线将完整零样本编码器定位在超低码率区域。在受控的720p Wan-GVCC实验中,调度器将先验评估次数从20次降至9次,实测解码时间减少约44%,且该收益在整个调度族中共享;在高运动内容上带来轻微的LPIPS代价提升。在该调度族内,均匀跳过(纯跳过)是边界点,而受BPP感知的内部点在比特率仅减少2.9%的情况下,始终实现更高的PSNR,同时保持相近的LPIPS水平。这些结果支持将比特率到计算量的调度作为采样器长度调优的可控延伸,无需让分配点主导所有边界点。

原文摘要 · Abstract (English)

Codebook-driven generative compression uses a pretrained image or video generator as a zero-shot visual prior and transmits compact codebook indices to guide reconstruction at ultra-low bitrate. Current codecs tie each finite-rate correction to a fresh prior evaluation, so shortening the sampler also removes correction slots that carry target-dependent information. We propose GVCCTurbo, a BPP-driven scheduler that separates expensive prior refreshes from codebook corrections: after calibrating an atom-count operating point and skip-gap ratio once per protocol, it maps a target codebook-payload bitrate to a trajectory length and refresh period, making BPP a schedule input instead of a fixed consequence of sampler length. The same endpoint-prediction and finite-rate steering interface covers GVCC-style rectified-flow video and DDCM-style diffusion image compression, preserving zero-training deployment and compatibility with future distilled priors. Native 1080p curves position the complete zero-shot codec in the ultra-low-bitrate regime. In a controlled 720p Wan-GVCC study, the scheduler cuts prior evaluations from 20 to 9 for a $\sim\!44\%$ measured decoding-time reduction shared across the whole schedule family, at a small shared LPIPS cost on high-motion content; within that family, uniform refresh thinning (pure-skip) is a boundary point, and the BPP-aware interior point trades $2.9\%$ fewer codebook-payload bits for consistently higher PSNR at comparable LPIPS. These results support BPP-to-compute scheduling as a controllable extension of sampler-length tuning, without requiring the allocated point to dominate every boundary point.

生成式压缩比特率调度视频编码低码率

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。