Abstract

Adaptive sampling is an interesting tool to lower noise, which is one of the main problems of Monte Carlo global illumination algorithms such as the famous and baseline Monte Carlo path tracing. The classic information measure, namely, Shannon entropy has been applied successfully for adaptive sampling in Monte Carlo path tracing. In this paper we investigate the generalized Renyi entropy to establish the refinement criteria to guide both pixel super sampling and pixel subdivision adaptively. Implementation results show that the adaptive sampling based on Renyi entropy outperforms the counterpart based on Shannon entropy consistently

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.