{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T02:40:12Z","timestamp":1774924812419,"version":"3.50.1"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"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":[[2011,10]]},"abstract":"<jats:p>We present a new adaptive photon tracing algorithm which can handle illumination settings that are considered difficult for photon tracing approaches such as outdoor scenes, close-ups of a small part of an illuminated region, and illumination coming through a small gap. The key contribution in our algorithm is the use of visibility of photon path as the importance function which ensures that our sampling algorithm focuses on paths that are visible from the given viewpoint. Our sampling algorithm builds on two recent developments in Markov chain Monte Carlo methods: adaptive Markov chain sampling and replica exchange. Using these techniques, each photon path is adaptively mutated and it explores the sampling space efficiently without being stuck at a local peak of the importance function. We have implemented this sampling approach in the progressive photon mapping algorithm which provides visibility information in a natural way when a photon path contributes to a measurement point. We demonstrate that the final algorithm is strikingly simple, yet effective at sampling photons under lighting conditions that would be difficult for existing Monte Carlo ray tracing-based methods.<\/jats:p>","DOI":"10.1145\/2019627.2019633","type":"journal-article","created":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T12:23:05Z","timestamp":1319545385000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["Robust adaptive photon tracing using photon path visibility"],"prefix":"10.1145","volume":"30","author":[{"given":"Toshiya","family":"Hachisuka","sequence":"first","affiliation":[{"name":"University of California, San Diego, CA"}]},{"given":"Henrik Wann","family":"Jensen","sequence":"additional","affiliation":[{"name":"University of California, San Diego, CA"}]}],"member":"320","published-online":{"date-parts":[[2011,10,22]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Andrieu C. and Robert C. P. 2001. Controlled mcmc for optimal sampling. Tech. rep. 0125 Cahiers de Math\u00e9matiques du Ceremade Universit\u00e9Paris-Dauphine.  Andrieu C. and Robert C. P. 2001. Controlled mcmc for optimal sampling. Tech. rep. 0125 Cahiers de Math\u00e9matiques du Ceremade Universit\u00e9Paris-Dauphine."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-008-9110-y"},{"key":"e_1_2_1_3_1","unstructured":"Arvo J. 1986. Backward ray tracing. In ACM SIGGRAPH Course Notes Developments in Ray Tracing 259--263.  Arvo J. 1986. Backward ray tracing. In ACM SIGGRAPH Course Notes Developments in Ray Tracing 259--263."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073330"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of Compugraphics Conference. 128--137","author":"Dutr\u00e9 P."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2383654.2383673"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/3318737"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1661412.1618487"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409060.1409083"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2010.01713.x"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129183101001912"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/275458.275461"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/15886.15902"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Kelemen C. Szirmay-Kalos L. Antal G. and Csonka F. 2002. A simple and robust mutation strategy for the metropolis light transport algorithm. Comput. Graph. Forum. 531--540.  Kelemen C. Szirmay-Kalos L. Antal G. and Csonka F. 2002. A simple and robust mutation strategy for the metropolis light transport algorithm. Comput. Graph. Forum. 531--540.","DOI":"10.1111\/1467-8659.t01-1-00703"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01540.x"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of Compugraphics Conference. H. P. Santo, Ed., 145--153","author":"Lafortune E. P."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1034625254"},{"key":"e_1_2_1_18_1","unstructured":"Rosenthal J. S. Brooks S. Gelman A. Jones G. and l. Meng X. 2008. Optimal proposal distributions and adaptive MCMC. In MCMC Handbook.  Rosenthal J. S. Brooks S. Gelman A. Jones G. and l. Meng X. 2008. Optimal proposal distributions and adaptive MCMC. In MCMC Handbook."},{"key":"e_1_2_1_19_1","unstructured":"Segovia B. Iehl J.-C. and Peroche B. 2007. Coherent metropolis light transport with multiple-try mutations. Tech. rep. RR-LIRIS-2007-015.  Segovia B. Iehl J.-C. and Peroche B. 2007. Coherent metropolis light transport with multiple-try mutations. Tech. rep. RR-LIRIS-2007-015."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.57.2607"},{"key":"e_1_2_1_21_1","unstructured":"Veach E. 1998. Robust monte carlo methods for light transport simulation. Ph.D. thesis Stanford CA. J. Guibas.   Veach E. 1998. Robust monte carlo methods for light transport simulation. Ph.D. thesis Stanford CA. J. Guibas."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/218380.218498"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258775"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2019627.2019633","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2019627.2019633","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:42Z","timestamp":1750273662000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2019627.2019633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.1145\/2019627.2019633"],"URL":"https:\/\/doi.org\/10.1145\/2019627.2019633","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]},"assertion":[{"value":"2010-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}