arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2207.07684cs.GR
收藏

基于可微代理的节点图优化

Node Graph Optimization Using Differentiable Proxies

Yiwei Hu, Paul Guerrero, Miloš Hašan, Holly Rushmeier, Valentin Deschaintre

摘要:

基于图形的程序材料在内容生产行业中无处不在。程序模型允许使用参数控制创建照片级真实感材料,以便灵活编辑外观。然而,设计特定材料在构建模型和微调参数方面是一个耗时的过程。先前的工作[Hu et al. 2022; Shi et al. 2020]介绍了用于匹配目标材料样本的材料图优化框架。然而,这些以前的方法仅限于优化图中的可微函数。在本文中,我们提出了一个完全可微的框架,使端到端的梯度为基础的优化材料图,即使一些功能的图形是不可微的。我们利用可微代理,一个不可微的黑盒函数的可微近似。我们使用我们的框架来匹配输出材料的结构和外观到目标材料,通过多阶段可微分优化。微分代理提供了一个更普遍的优化解决方案,材料外观匹配比以前的工作。

英文摘要:

Graph-based procedural materials are ubiquitous in content production industries. Procedural models allow the creation of photorealistic materials with parametric control for flexible editing of appearance. However, designing a specific material is a time-consuming process in terms of building a model and fine-tuning parameters. Previous work [Hu et al. 2022; Shi et al. 2020] introduced material graph optimization frameworks for matching target material samples. However, these previous methods were limited to optimizing differentiable functions in the graphs. In this paper, we propose a fully differentiable framework which enables end-to-end gradient based optimization of material graphs, even if some functions of the graph are non-differentiable. We leverage the Differentiable Proxy, a differentiable approximator of a non-differentiable black-box function. We use our framework to match structure and appearance of an output material to a target material, through a multi-stage differentiable optimization. Differentiable Proxies offer a more general optimization solution to material appearance matching than previous work.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑