用可学习的自适应点构建图像表示,实现高效渲染与训练。
Soft Anisotropic Diagrams for Differentiable Image Representation

- 以可微分的自适应点定义图像,通过软加权距离融合像素颜色。
- 在Kodak数据集上达46.0 dB PSNR,编码时间仅2.2秒,训练速度提升4-19倍。
- 适合需要快速随机访问和端到端优化的图像重建与生成任务。
我们提出软各向异性图(SAD),一种基于图像平面中自适应点集显式且可微分的图像表示。每个点定义一个各向异性度量和加权距离评分,像素颜色通过小范围局部top-K点的softmax融合计算。通过可学习的温度参数,形成软各向异性加权Voronoi分区(即Apollonius图),在保留有效梯度的同时实现内容对齐的清晰边界和明确归属。该方法通过维护每查询的top-K映射近似相同着色分数下的最近邻,支持GPU友好、固定大小的局部计算。更新机制采用受跳洪水启发的top-K传播方案,并引入随机注入以实现概率性全局覆盖。训练采用面向GPU的流水线,包含梯度加权初始化、Adam优化及通过密化与剪枝实现的自适应预算控制。在标准基准测试中,SAD在匹配比特率下持续优于Image-GS和Instant-NGP;在Kodak数据集上,达到46.0 dB PSNR,编码时间为2.2秒(相比Image-GS的28秒),端到端训练速度比当前最优基线快4至19倍。我们展示了SAD在可微分流程中的无缝集成能力,以及其快速随机访问与紧凑存储的优势。
原文摘要 · Abstract (English)
We introduce Soft Anisotropic Diagrams (SAD), an explicit and differentiable image representation parameterized by a set of adaptive sites in the image plane. In SAD, each site specifies an anisotropic metric and an additively weighted distance score, and we compute pixel colors as a softmax blend over a small per-pixel top-K subset of sites. We induce a soft anisotropic additively weighted Voronoi partition (i.e., an Apollonius diagram) with learnable per-site temperatures, preserving informative gradients while allowing clear, content-aligned boundaries and explicit ownership. Such a formulation enables efficient rendering by maintaining a per-query top-K map that approximates nearest neighbors under the same shading score, allowing GPU-friendly, fixed-size local computation. We update this list using our top-K propagation scheme inspired by jump flooding, augmented with stochastic injection to provide probabilistic global coverage. Training follows a GPU-first pipeline with gradient-weighted initialization, Adam optimization, and adaptive budget control through densification and pruning. Across standard benchmarks, SAD consistently outperforms Image-GS and Instant-NGP at matched bitrate. On Kodak, SAD reaches 46.0 dB PSNR with 2.2 s encoding time (vs. 28 s for Image-GS), and delivers 4-19 times end-to-end training speedups over state-of-the-art baselines. We demonstrate the effectiveness of SAD by showcasing the seamless integration with differentiable pipelines for forward and inverse problems, efficiency of fast random access, and compact storage.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。