Inverse shade trees for non-parametric material representation and editing

被引:135
|
作者
Lawrence, Jason [1 ]
Ben-Artzi, Aner
DeCoro, Christopher
Matusik, Wojciech
Pfister, Hanspeter
Ramamoorthi, Ravi
Rusinkiewicz, Szymon
机构
[1] Princeton Univ, Princeton, NJ 08544 USA
[2] Columbia Univ, New York, NY 10027 USA
[3] MERL, Cambridge, MA USA
来源
ACM TRANSACTIONS ON GRAPHICS | 2006年 / 25卷 / 03期
关键词
light reflection models; non-parametric; data-driven; matrix factorization; SVBRDF; BRDF;
D O I
10.1145/1141911.1141949
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Recent progress in the measurement of surface reflectance has created a demand for non-parametric appearance representations that are accurate, compact, and easy to use for rendering. Another crucial goal, which has so far received little attention, is editability: for practical use, we must be able to change both the directional and spatial behavior of surface reflectance ( e. g., making one material shinier, another more anisotropic, and changing the spatial "texture maps" indicating where each material appears). We introduce an Inverse Shade Tree framework that provides a general approach to estimating the "leaves" of a user-specified shade tree from high-dimensional measured datasets of appearance. These leaves are sampled 1- and 2-dimensional functions that capture both the directional behavior of individual materials and their spatial mixing patterns. In order to compute these shade trees automatically, we map the problem to matrix factorization and introduce a flexible new algorithm that allows for constraints such as non-negativity, sparsity, and energy conservation. Although we cannot infer every type of shade tree, we demonstrate the ability to reduce multi-gigabyte measured datasets of the Spatially-Varying Bidirectional Reflectance Distribution Function (SVBRDF) into a compact representation that may be edited in real time.
引用
收藏
页码:735 / 745
页数:11
相关论文
共 50 条
  • [1] A Non-parametric Factor Representation and Editing for Measured Anisotropic Spectral BRDFs
    Iwasaki, Kei
    Dobashi, Yoshinori
    PROCEEDINGS OF THE 50TH GRAPHICS INTERFACE CONFERENCE, GI 2024, 2024,
  • [2] Non-Parametric Filtering for Geometric Detail Extraction and Material Representation
    Liao, Zicheng
    Rock, Jason
    Wang, Yang
    Forsyth, David
    2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2013, : 963 - 970
  • [3] Non-parametric modeling and editing for captured SVBRDF
    Hu, Yong
    Qi, Yue
    Wang, Shan
    COMPUTERS & GRAPHICS-UK, 2014, 39 : 74 - 88
  • [4] Non-parametric Representation Learning with Kernels
    Esser, Pascal
    Fleissner, Maximilian
    Ghoshdastidar, Debarghya
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 11, 2024, : 11910 - 11918
  • [5] LATENTPATCH: A NON-PARAMETRIC APPROACH FOR FACE GENERATION AND EDITING
    Samuth, Benjamin
    Rabin, Julien
    Tschumperle, David
    Jurie, Frederic
    2023 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, ICIP, 2023, : 1790 - 1794
  • [6] To be parametric or non-parametric, that is the question Parametric and non-parametric statistical tests
    Van Buren, Eric
    Herring, Amy H.
    BJOG-AN INTERNATIONAL JOURNAL OF OBSTETRICS AND GYNAECOLOGY, 2020, 127 (05) : 549 - 550
  • [7] Non-parametric correction of estimated gene trees using TRACTION
    Sarah Christensen
    Erin K. Molloy
    Pranjal Vachaspati
    Ananya Yammanuru
    Tandy Warnow
    Algorithms for Molecular Biology, 15
  • [8] Density Estimation Trees as fast non-parametric modelling tools
    Anderlini, Lucio
    17TH INTERNATIONAL WORKSHOP ON ADVANCED COMPUTING AND ANALYSIS TECHNIQUES IN PHYSICS RESEARCH (ACAT2016), 2016, 762
  • [9] TWO-CLASS Trees for Non-Parametric Regression Analysis
    Siciliano, Roberta
    Aria, Massimo
    CLASSIFICATION AND MULTIVARIATE ANALYSIS FOR COMPLEX DATA STRUCTURES, 2011, : 63 - 71
  • [10] Non-parametric correction of estimated gene trees using TRACTION
    Christensen, Sarah
    Molloy, Erin K.
    Vachaspati, Pranjal
    Yammanuru, Ananya
    Warnow, Tandy
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2020, 15 (01)