{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T03:24:36Z","timestamp":1782789876122,"version":"3.54.5"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T00:00:00Z","timestamp":1683849600000},"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":["Proc. ACM Comput. Graph. Interact. Tech."],"published-print":{"date-parts":[[2023,5,12]]},"abstract":"<jats:p>In real-time rendering, spatiotemporal reservoir resampling (ReSTIR) is a powerful technique to increase the number of candidate samples for resampled importance sampling. However, reusing spatiotemporal samples is not always efficient when target PDFs for the reused samples are dissimilar to the integrand. Target PDFs are often spatially different for highly detailed scenes due to geometry edges, normal maps, spatially varying materials, and shadow edges. This paper introduces a new method of rejecting spatial reuse based on the similarity of PDF shapes for single-bounce path connections (e.g., direct illumination). While existing rejection methods for ReSTIR do not support arbitrary materials and shadow edges, our PDF similarity takes them into account because target PDFs include BSDFs and shadows. In this paper, we present a rough estimation of PDF shapes using von Mises--Fisher distributions and temporal resampling. We also present a stable combination of our rejection method and the existing rejection method, considering estimation errors due to temporal disocclusions and moving light sources. This combination efficiently reduces the error around shadow edges with temporal continuities. By using our method for a ReSTIR variant that reuses shadow ray visibility for the integrand, we can reduce the number of shadow rays while preserving shadow edges.<\/jats:p>","DOI":"10.1145\/3585501","type":"journal-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:05:34Z","timestamp":1684256734000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Spatial Resampling Using the PDF Similarity"],"prefix":"10.1145","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6612-1812","authenticated-orcid":false,"given":"Yusuke","family":"Tokuyoshi","sequence":"first","affiliation":[{"name":"Advanced Micro Devices, Inc., Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,5,16]]},"reference":[{"key":"e_1_2_3_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1088718"},{"key":"e_1_2_3_2_1","volume-title":"Weighted Importance Sampling Techniques for Monte Carlo Radiosity. In EGWR '00","author":"Bekaert Philippe","unstructured":"Philippe Bekaert, Mateu Sbert, and Yves D. Willems. 2000. Weighted Importance Sampling Techniques for Monte Carlo Radiosity. In EGWR '00. 35--46."},{"key":"e_1_2_3_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392481"},{"key":"e_1_2_3_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3478512.3488613"},{"key":"e_1_2_3_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-7185-8_23"},{"key":"e_1_2_3_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet"},{"key":"e_1_2_3_7_1","doi-asserted-by":"crossref","unstructured":"Carsten Dachsbacher and Marc Stamminger. 2005. Reflective Shadow Maps. In I3D '05. 203--231.","DOI":"10.1145\/1053427.1053460"},{"key":"e_1_2_3_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015778"},{"key":"e_1_2_3_9_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1953.0064"},{"key":"e_1_2_3_10_1","doi-asserted-by":"publisher","unstructured":"Eric Heitz Stephen Hill and Morgan McGuire. 2018. Combining Analytic Direct Illumination and Stochastic Shadows. In I3D '18. Article 2 11 pages. https:\/\/doi.org\/10.1145\/3190834.3190852","DOI":"10.1145\/3190834.3190852"},{"key":"e_1_2_3_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366163"},{"key":"e_1_2_3_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258769"},{"key":"e_1_2_3_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3528223.3530158"},{"key":"e_1_2_3_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3478513.3480499"},{"key":"e_1_2_3_15_1","unstructured":"Amazon Lumberyard. 2017. Amazon Lumberyard Bistro Open Research Content Archive (ORCA). http:\/\/developer.nvidia.com\/orca\/amazon-lumberyard-bistro"},{"key":"e_1_2_3_16_1","unstructured":"Morgan McGuire. 2017. Computer Graphics Archive. https:\/\/casual-effects.com\/data"},{"key":"e_1_2_3_17_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14378"},{"key":"e_1_2_3_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015777"},{"key":"e_1_2_3_19_1","doi-asserted-by":"crossref","first-page":"543","DOI":"10.2307\/2289460","article-title":"A Noniterative Sampling\/Importance Resampling Alternative to the Data Augmentation Algorithm for Creating a Few Imputations When Fractions of Missing Information Are Modest","volume":"82","author":"Rubin Donald B.","year":"1987","unstructured":"Donald B. Rubin. 1987. A Noniterative Sampling\/Importance Resampling Alternative to the Data Augmentation Algorithm for Creating a Few Imputations When Fractions of Missing Information Are Modest: The SIR Algorithm. J. Amer. Statist. Assoc. 82, 398 (1987), 543--546.","journal-title":"The SIR Algorithm. J. Amer. Statist. Assoc."},{"key":"e_1_2_3_20_1","doi-asserted-by":"publisher","unstructured":"Rohan Sawhney Daqi Lin Markus Kettunen Benedikt Bitterli Ravi Ramamoorthi Chris Wyman and Matt Pharr. 2022. Decorrelating ReSTIR Samplers via MCMC Mutations. https:\/\/doi.org\/10.48550\/ARXIV.2211.00166","DOI":"10.48550\/ARXIV.2211.00166"},{"key":"e_1_2_3_21_1","unstructured":"Justin F. Talbot. 2005. Importance Resampling for Global Illumination. Master's thesis. Brigham Young U."},{"key":"e_1_2_3_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12525"},{"key":"e_1_2_3_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141981"},{"key":"e_1_2_3_25_1","unstructured":"Eric Veach. 1998. Robust Monte Carlo Methods for Light Transport Simulation. Ph. D. Dissertation. Stanford U."},{"key":"e_1_2_3_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/218380.218498"},{"key":"e_1_2_3_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1618452.1618479"},{"key":"e_1_2_3_28_1","unstructured":"Mike Winkelmann and Kate Anderson. 2019. Zero-Day Open Research Content Archive (ORCA). https:\/\/developer.nvidia.com\/orca\/beeple-zero-day"},{"key":"e_1_2_3_29_1","doi-asserted-by":"publisher","DOI":"10.2312\/hpg.20211281"}],"container-title":["Proceedings of the ACM on Computer Graphics and Interactive Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3585501","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3585501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:56Z","timestamp":1750178276000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3585501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,12]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5,12]]}},"alternative-id":["10.1145\/3585501"],"URL":"https:\/\/doi.org\/10.1145\/3585501","relation":{},"ISSN":["2577-6193"],"issn-type":[{"value":"2577-6193","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,12]]},"assertion":[{"value":"2023-05-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}