{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T04:39:33Z","timestamp":1780375173705,"version":"3.54.1"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100007214","name":"Velux Stiftung","doi-asserted-by":"publisher","award":["1350"],"award-info":[{"award-number":["1350"]}],"id":[{"id":"10.13039\/100007214","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["956585-PRIME"],"award-info":[{"award-number":["956585-PRIME"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>Multiple importance sampling (MIS) is an indispensable tool in light-transport simulation. It enables robust Monte Carlo integration by combining samples from several techniques. However, it is well understood that such a combination is not always more efficient than using a single sampling technique. Thus a major criticism of complex combined estimators, such as bidirectional path tracing, is that they can be significantly less efficient on common scenes than simpler algorithms like forward path tracing. We propose a general method to improve MIS efficiency: By cheaply estimating the efficiencies of various technique and sample-count combinations, we can pick the best one. The key ingredient is a numerically robust and efficient scheme that uses the samples of one MIS combination to compute the efficiency of multiple other combinations. For example, we can run forward path tracing and use its samples to decide which subset of VCM to enable, and at what sampling rates. The sample count for each technique can be controlled per-pixel or globally. Applied to VCM, our approach enables robust rendering of complex scenes with caustics, without compromising efficiency on simpler scenes.<\/jats:p>","DOI":"10.1145\/3528223.3530126","type":"journal-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T21:06:27Z","timestamp":1658523987000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Efficiency-aware multiple importance sampling for bidirectional rendering algorithms"],"prefix":"10.1145","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5325-3744","authenticated-orcid":false,"given":"Pascal","family":"Grittmann","sequence":"first","affiliation":[{"name":"Saarland University, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0306-757X","authenticated-orcid":false,"given":"\u00d6mercan","family":"Yazici","sequence":"additional","affiliation":[{"name":"Saarland University, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9655-2138","authenticated-orcid":false,"given":"Iliyan","family":"Georgiev","sequence":"additional","affiliation":[{"name":"Autodesk, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2189-2429","authenticated-orcid":false,"given":"Philipp","family":"Slusallek","sequence":"additional","affiliation":[{"name":"Saarland University, Germany and DFKI, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Attila T. \u00c1fra. 2019. Intel\u00ae Open Image Denoise. https:\/\/www.openimagedenoise.org\/."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366211"},{"key":"e_1_2_2_3_1","volume-title":"Correlation-Aware Multiple Importance Sampling for Bidirectional Rendering Algorithms. Comput. Graph. Forum (EG 2021) 40, 2","author":"Grittmann Pascal","year":"2021","unstructured":"Pascal Grittmann, Iliyan Georgiev, and Philipp Slusallek. 2021. Correlation-Aware Multiple Importance Sampling for Bidirectional Rendering Algorithms. Comput. Graph. Forum (EG 2021) 40, 2 (2021), 231--238."},{"key":"e_1_2_2_4_1","volume-title":"Variance-Aware Multiple Importance Sampling. ACM Trans. Graph. (SIGGRAPH Asia 2019) 38, 6 (Nov","author":"Grittmann Pascal","year":"2019","unstructured":"Pascal Grittmann, Iliyan Georgiev, Philipp Slusallek, and Jaroslav K\u0159iv\u00e1nek. 2019. Variance-Aware Multiple Importance Sampling. ACM Trans. Graph. (SIGGRAPH Asia 2019) 38, 6 (Nov. 2019), 9 pages."},{"key":"e_1_2_2_5_1","volume-title":"Efficient Caustic Rendering with Lightweight Photon Mapping. Comput. Graph. Forum (EGSR '18)","author":"Grittmann Pascal","year":"2018","unstructured":"Pascal Grittmann, Ars\u00e8ne P\u00e9rard-Gayot, Philipp Slusallek, and Jaroslav K\u0159iv\u00e1nek. 2018. Efficient Caustic Rendering with Lightweight Photon Mapping. Comput. Graph. Forum (EGSR '18) 37, 4 (2018), 133--142."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","unstructured":"Pascal Grittmann \u00d6mercan Yazici Iliyan Georgiev and Philipp Slusallek. 2022. Implementation of Efficiency-Aware Multiple Importance Sampling for Bidirectional Rendering Algorithms. 10.5281\/zenodo.6514204","DOI":"10.5281\/zenodo.6514204"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601138"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366210"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670473.2670496"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1411.3954"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9430-0_31"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-7484-5_3"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355089.3356565"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.t01-1-00703"},{"key":"e_1_2_2_15_1","volume-title":"Optimal Multiple Importance Sampling. ACM Trans. Graph. (SIGGRAPH 2019) 38, 4 (July","author":"Kondapaneni Ivo","year":"2019","unstructured":"Ivo Kondapaneni, Petr V\u00e9voda, Pascal Grittmann, Tom\u00e1\u0161 Sk\u0159ivan, Philipp Slusallek, and Jaroslav K\u0159iv\u00e1nek. 2019. Optimal Multiple Importance Sampling. ACM Trans. Graph. (SIGGRAPH 2019) 38, 4 (July 2019), 14 pages."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3214834.3214872"},{"key":"e_1_2_2_17_1","volume-title":"Willems","author":"Lafortune Eric P.","year":"1993","unstructured":"Eric P. Lafortune and Yves D. Willems. 1993. Bi-Directional Path Tracing. 93 (Dec. 1993), 145--153."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12220"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3305366.3328091"},{"key":"e_1_2_2_20_1","volume-title":"Eurographics","volume":"20","author":"Murray David","year":"2020","unstructured":"David Murray, Sofiane Benzait, Romain Pacanowski, and Xavier Granier. 2020. On Learning the Best Balancing Strategy. In Eurographics 2020, Vol. 20. 1--4."},{"key":"e_1_2_2_21_1","volume-title":"Resampling-aware Weighting Functions for Bidirectional Path Tracing Using Multiple Light Sub-Paths. ACM Trans. Graph. (SIGGRAPH 2020) 39, 2","author":"Nabata Kosuke","year":"2020","unstructured":"Kosuke Nabata, Kei Iwasaki, and Yoshinori Dobashi. 2020. Resampling-aware Weighting Functions for Bidirectional Path Tracing Using Multiple Light Sub-Paths. ACM Trans. Graph. (SIGGRAPH 2020) 39, 2 (2020), 1--11."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2000.10473909"},{"key":"e_1_2_2_23_1","volume-title":"Representativity for robust and adaptive multiple importance sampling","author":"Pajot Anthony","year":"2010","unstructured":"Anthony Pajot, Loic Barthe, Mathias Paulin, and Pierre Poulin. 2010. Representativity for robust and adaptive multiple importance sampling. IEEE transactions on visualization and computer graphics 17, 8 (2010), 1108--1121."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2858834.2858843"},{"key":"e_1_2_2_25_1","volume-title":"Variance-Aware Path Guiding. ACM Transactions on Graphics (Proceedings of SIGGRAPH 2020)","author":"Rath Alexander","year":"2020","unstructured":"Alexander Rath, Pascal Grittmann, Sebastian Herholz, Petr V\u00e9voda, Philipp Slusallek, and Jaroslav K\u0159iv\u00e1nek. 2020. Variance-Aware Path Guiding. ACM Transactions on Graphics (Proceedings of SIGGRAPH 2020) 39, 4 (July 2020), 12 pages."},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392421"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.3390\/e24020191"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-017-1398-1"},{"key":"e_1_2_2_29_1","volume-title":"Computer Graphics Forum","author":"Sbert Mateu","unstructured":"Mateu Sbert, Vlastimil Havran, and L\u00e1szl\u00f3 Szirmay-Kalos. 2016. Variance Analysis of Multi-sample and One-sample Multiple Importance Sampling. In Computer Graphics Forum, Vol. 35. Wiley Online Library, 451--460."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13634-018-0531-2"},{"key":"e_1_2_2_31_1","unstructured":"Mateu Sbert Vlastimil Havran and L\u00e1szl\u00f3 Szirmay-Kalos. 2019. Optimal Deterministic Mixture Sampling.. In Eurographics (Short Papers). 73--76."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-018-1522-x"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2018.2880455"},{"key":"e_1_2_2_34_1","unstructured":"Martin \u0160ik and Jaroslav K\u0159iv\u00e1nek. 2019. Implementing One-Click Caustics in Corona Renderer. (2019)."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2980179.2982411"},{"key":"e_1_2_2_36_1","volume-title":"Robust Monte Carlo methods for light transport simulation","author":"Veach Eric","unstructured":"Eric Veach. 1997. Robust Monte Carlo methods for light transport simulation. Stanford University PhD thesis."},{"key":"e_1_2_2_37_1","volume-title":"Photorealistic Rendering Techniques","author":"Veach Eric","unstructured":"Eric Veach and Leonidas Guibas. 1995a. Bidirectional estimators for light transport. In Photorealistic Rendering Techniques. Springer, 145--167."},{"key":"e_1_2_2_38_1","volume-title":"Optimally Combining Sampling Techniques for Monte Carlo Rendering. In SIGGRAPH '95","author":"Veach Eric","year":"1995","unstructured":"Eric Veach and Leonidas J Guibas. 1995b. Optimally Combining Sampling Techniques for Monte Carlo Rendering. In SIGGRAPH '95. ACM, 419--428."},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258775"},{"key":"e_1_2_2_40_1","volume-title":"On-line Learning of Parametric Mixture Models for Light Transport Simulation. ACM Trans. Graph. (Proceedings of SIGGRAPH 2014)","author":"Vorba Ji\u0159\u00ed","year":"2014","unstructured":"Ji\u0159\u00ed Vorba, Ond\u0159ej Karl\u00edk, Martin \u0160ik, Tobias Ritschel, and Jaroslav K\u0159iv\u00e1nek. 2014. On-line Learning of Parametric Mixture Models for Light Transport Simulation. ACM Trans. Graph. (Proceedings of SIGGRAPH 2014) 33, 4 (2014), 11 pages."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12592"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528223.3530126","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3528223.3530126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:26Z","timestamp":1750186946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528223.3530126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.1145\/3528223.3530126"],"URL":"https:\/\/doi.org\/10.1145\/3528223.3530126","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"2022-07-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}