Demo Data from VLDB 2026 / reviewers in the wild / expert
Laki Iinbor
dblp:435/6963
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0001-7499-6416ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Image and video processing · 50% Rendering · 50% | |
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing
image representation |
1.0 | 1 | 2026 | Soft Anisotropic Diagrams for Differentiable Image Representation · ACM Trans. Graph. 2026 |
Rendering
neural rendering |
1.0 | 1 | 2026 | Soft Anisotropic Diagrams for Differentiable Image Representation · ACM Trans. Graph. 2026 |
Methods — techniques the papers use, named apart from their topics
top-k propagation · 2.0jump flooding · 2.0densification and pruning · 2.0adam optimization · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Soft Anisotropic Diagrams for Differentiable Image RepresentationabstractWe 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 persite 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. 28s for Image-GS), and delivers 4–19× 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. You can find the code here: https://luckyiyi.github.io/SAD. Laki Iinbor, Zhiyang Dou, Wojciech Matusik |
ACM Trans. Graph. | 1 |