{"publisher":"ACM","scopus_import":"1","oa_version":"None","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2019-11-12T13:05:40Z","title":"Optimal multiple importance sampling","quality_controlled":"1","status":"public","month":"07","article_processing_charge":"No","date_updated":"2023-08-30T07:21:25Z","type":"journal_article","day":"01","department":[{"_id":"ChWo"}],"abstract":[{"lang":"eng","text":"Multiple Importance Sampling (MIS) is a key technique for achieving robustness of Monte Carlo estimators in computer graphics and other fields. We derive optimal weighting functions for MIS that provably minimize the variance of an MIS estimator, given a set of sampling techniques. We show that the resulting variance reduction over the balance heuristic can be higher than predicted by the variance bounds derived by Veach and Guibas, who assumed only non-negative weights in their proof. We theoretically analyze the variance of the optimal MIS weights and show the relation to the variance of the balance heuristic. Furthermore, we establish a connection between the new weighting functions and control variates as previously applied to mixture sampling. We apply the new optimal weights to integration problems in light transport and show that they allow for new design considerations when choosing the appropriate sampling techniques for a given integration problem."}],"date_published":"2019-07-01T00:00:00Z","publication_status":"published","issue":"4","year":"2019","intvolume":"        38","volume":38,"project":[{"grant_number":"642841","_id":"2508E324-B435-11E9-9278-68D0E5697425","name":"Distributed 3D Object Design","call_identifier":"H2020"}],"isi":1,"external_id":{"isi":["000475740600011"]},"publication_identifier":{"issn":["0730-0301"]},"author":[{"last_name":"Kondapaneni","first_name":"Ivo","full_name":"Kondapaneni, Ivo"},{"full_name":"Vevoda, Petr","last_name":"Vevoda","first_name":"Petr"},{"first_name":"Pascal","last_name":"Grittmann","full_name":"Grittmann, Pascal"},{"last_name":"Skrivan","first_name":"Tomas","full_name":"Skrivan, Tomas","id":"486A5A46-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Slusallek","first_name":"Philipp","full_name":"Slusallek, Philipp"},{"full_name":"Křivánek, Jaroslav","first_name":"Jaroslav","last_name":"Křivánek"}],"publication":"ACM Transactions on Graphics","doi":"10.1145/3306346.3323009","article_number":"37","_id":"7002","language":[{"iso":"eng"}],"article_type":"original","citation":{"mla":"Kondapaneni, Ivo, et al. “Optimal Multiple Importance Sampling.” <i>ACM Transactions on Graphics</i>, vol. 38, no. 4, 37, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3306346.3323009\">10.1145/3306346.3323009</a>.","ieee":"I. Kondapaneni, P. Vevoda, P. Grittmann, T. Skrivan, P. Slusallek, and J. Křivánek, “Optimal multiple importance sampling,” <i>ACM Transactions on Graphics</i>, vol. 38, no. 4. ACM, 2019.","ista":"Kondapaneni I, Vevoda P, Grittmann P, Skrivan T, Slusallek P, Křivánek J. 2019. Optimal multiple importance sampling. ACM Transactions on Graphics. 38(4), 37.","apa":"Kondapaneni, I., Vevoda, P., Grittmann, P., Skrivan, T., Slusallek, P., &#38; Křivánek, J. (2019). Optimal multiple importance sampling. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3306346.3323009\">https://doi.org/10.1145/3306346.3323009</a>","chicago":"Kondapaneni, Ivo, Petr Vevoda, Pascal Grittmann, Tomas Skrivan, Philipp Slusallek, and Jaroslav Křivánek. “Optimal Multiple Importance Sampling.” <i>ACM Transactions on Graphics</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3306346.3323009\">https://doi.org/10.1145/3306346.3323009</a>.","ama":"Kondapaneni I, Vevoda P, Grittmann P, Skrivan T, Slusallek P, Křivánek J. Optimal multiple importance sampling. <i>ACM Transactions on Graphics</i>. 2019;38(4). doi:<a href=\"https://doi.org/10.1145/3306346.3323009\">10.1145/3306346.3323009</a>","short":"I. Kondapaneni, P. Vevoda, P. Grittmann, T. Skrivan, P. Slusallek, J. Křivánek, ACM Transactions on Graphics 38 (2019)."},"ec_funded":1}