TY - GEN
T1 - Inverse shade trees for non-parametric material representation and editing
AU - Lawrence, Jason
AU - Ben-Artzi, Aner
AU - DeCoro, Christopher
AU - Matusik, Wojciech
AU - Pfister, Hanspeter
AU - Ramamoorthi, Ravi
AU - Rusinkiewicz, Szymon
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
KW - BRDF
KW - SVBRDF
KW - data-driven
KW - light reflection models
KW - matrix factorization
KW - non-parametric
UR - http://www.scopus.com/inward/record.url?scp=71949086421&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=71949086421&partnerID=8YFLogxK
U2 - 10.1145/1179352.1141949
DO - 10.1145/1179352.1141949
M3 - Conference contribution
AN - SCOPUS:71949086421
SN - 1595933646
SN - 9781595933645
T3 - ACM SIGGRAPH 2006 Papers, SIGGRAPH '06
SP - 735
EP - 745
BT - ACM SIGGRAPH 2006 Papers, SIGGRAPH '06
T2 - ACM SIGGRAPH 2006 Papers, SIGGRAPH '06
Y2 - 30 July 2006 through 3 August 2006
ER -