Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2897839.2927416acmconferencesArticle/Chapter ViewAbstractPublication PagessiggraphConference Proceedingsconference-collections
invited-talk

Estimating local Beckmann roughness for complex BSDFs

Published: 24 July 2016 Publication History

Abstract

Many light transport related techniques require an analysis of the blur width of light scattering at a path vertex, for instance a Beckmann roughness. Such use cases are for instance analysis of expected variance (and potential biased countermeasures in production rendering), radiance caching or directionally dependent virtual point light sources, or determination of step sizes in the path space Metropolis light transport framework: recent advanced mutation strategies for Metropolis Light Transport [Veach 1997], such as Manifold Exploration [Jakob 2013] and Half Vector Space Light Transport [Kaplanyan et al. 2014] employ local curvature of the BSDFs (such as an average Beckmann roughness) at all interactions along the path in order to determine an optimal mutation step size. A single average Beckmann roughness, however, can be a bad fit for complex measured materials (such as [Matusik et al. 2003]) and, moreover, such curvature is completely undefined for layered materials as it depends on the active scattering layer. We propose a robust estimation of local curvature for BSDFs of any complexity by using local Beckmann approximations, taking into account additional factors such as both incident and outgoing direction.

Supplementary Material

MP4 File (a66.mp4)

References

[1]
Hanika, J., Droske, M., and Fascione, L. 2015. Manifold next event estimation. Computer Graphics Forum (Proceedings of Eurographics Symposium on Rendering) 34, 4 (June), 87--97.
[2]
Holzschuch, N., and Pacanowski, R. 2015. A physically accurate reflectance model combining reflection and diffraction. Research Report RR-8807, INRIA, Nov.
[3]
Jakob, W. 2013. Light transport on path-space manifolds. PhD thesis, Cornell University.
[4]
Kaplanyan, A., Hanika, J., and Dachsbacher, C. 2014. The natural-constraint representation of the path space for efficient light transport simulation. Transactions on Graphics (Proceedings of SIGGRAPH) 33, 4 (August), 1--13.
[5]
Matusik, W., Pfister, H., Brand, M., and McMillan, L. 2003. A data-driven reflectance model. ACM Transactions on Graphics 22, 3 (July), 759--769.
[6]
Veach, E. 1997. Robust Monte Carlo Methods for Light Transport Simulation. PhD thesis, Stanford University.

Cited By

View all
  • (2021)Optimised Path Space RegularisationComputer Graphics Forum10.1111/cgf.1434740:4(139-151)Online publication date: 15-Jul-2021

Index Terms

  1. Estimating local Beckmann roughness for complex BSDFs

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SIGGRAPH '16: ACM SIGGRAPH 2016 Talks
      July 2016
      158 pages
      ISBN:9781450342827
      DOI:10.1145/2897839
      Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 24 July 2016

      Check for updates

      Author Tags

      1. global illumination
      2. half vector space
      3. light transport

      Qualifiers

      • Invited-talk

      Funding Sources

      Conference

      SIGGRAPH '16
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 1,822 of 8,601 submissions, 21%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 06 Oct 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2021)Optimised Path Space RegularisationComputer Graphics Forum10.1111/cgf.1434740:4(139-151)Online publication date: 15-Jul-2021

      View Options

      Get Access

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media