{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T23:32:59Z","timestamp":1791070379724,"version":"4.1.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2006,7]]},"abstract":"<jats:p>\n            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\n            <jats:italic>editability:<\/jats:italic>\n            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\n            <jats:italic>Shade Tree<\/jats:italic>\n            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.\n          <\/jats:p>","DOI":"10.1145\/1141911.1141949","type":"journal-article","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T14:14:26Z","timestamp":1153836866000},"page":"735-745","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":169,"title":["Inverse shade trees for non-parametric material representation and editing"],"prefix":"10.1145","volume":"25","author":[{"given":"Jason","family":"Lawrence","sequence":"first","affiliation":[{"name":"Princeton University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aner","family":"Ben-Artzi","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher","family":"DeCoro","sequence":"additional","affiliation":[{"name":"Princeton University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wojciech","family":"Matusik","sequence":"additional","affiliation":[{"name":"MERL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanspeter","family":"Pfister","sequence":"additional","affiliation":[{"name":"MERL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ravi","family":"Ramamoorthi","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Szymon","family":"Rusinkiewicz","sequence":"additional","affiliation":[{"name":"Princeton University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,7]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344814"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566601"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800031.808602"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/300776.300778"},{"key":"e_1_2_2_5_1","volume-title":"Eurographics Workshop on Rendering, 257--266","author":"Furukawa R.","unstructured":"Furukawa , R. , Kawasaki , H. , Ikeuchi , K. , and Sakauchi , M . 2002. Appearance based object modeling using texture database: acquisition, compression and rendering . In Eurographics Workshop on Rendering, 257--266 . Furukawa, R., Kawasaki, H., Ikeuchi, K., and Sakauchi, M. 2002. Appearance based object modeling using texture database: acquisition, compression and rendering. In Eurographics Workshop on Rendering, 257--266."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882342"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1271.1276"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.219"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/237170.237200"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882341"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/311535.311554"},{"key":"e_1_2_2_13_1","volume-title":"Proceedings of Uncertainty in Artificial Intelligence.","author":"Hofmann T.","year":"1999","unstructured":"Hofmann , T. 1999 . Probabilistic latent semantic analysis . In Proceedings of Uncertainty in Artificial Intelligence. Hofmann, T. 1999. Probabilistic latent semantic analysis. In Proceedings of Uncertainty in Artificial Intelligence."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/NNSP.2002.1030067"},{"key":"e_1_2_2_15_1","unstructured":"Jaroszkiewicz R. and McCool M. D. 2003. Fast extraction of BRDFs and material maps from images. In Graphcs Interface.  Jaroszkiewicz R. and McCool M. D. 2003. Fast extraction of BRDFs and material maps from images. In Graphcs Interface."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2383815.2383838"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258801"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015751"},{"key":"e_1_2_2_19_1","volume-title":"Proceedings of Neural Information Processing Systems, 556--562","author":"Lee D.","unstructured":"Lee , D. , and Seung , H. S . 2000. Algorithms for non-negative matrix factorization . In Proceedings of Neural Information Processing Systems, 556--562 . Lee, D., and Seung, H. S. 2000. Algorithms for non-negative matrix factorization. In Proceedings of Neural Information Processing Systems, 556--562."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/636886.636891"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011126920638"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2383815.2383829"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073254"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882343"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383276"},{"key":"e_1_2_2_27_1","unstructured":"Nag 2005. Numerical Algorithms Group C Library.  Nag 2005. Numerical Algorithms Group C Library."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2383654.2383671"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1038\/381607a0"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141950"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6453-2_2"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882344"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015725"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/133994.134078"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141911.1141949","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1141911.1141949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:24Z","timestamp":1750259664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141911.1141949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["10.1145\/1141911.1141949"],"URL":"https:\/\/doi.org\/10.1145\/1141911.1141949","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7]]},"assertion":[{"value":"2006-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}