By Topic

Adaptive sampling with Renyi entropy in Monte Carlo path tracing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Qing Xu ; Sch. of Inf., Tianjin Univ. ; Ruijuan Hu ; Lianping Xing ; Yuan Xu

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

Published in:

Signal Processing and Information Technology, 2005. Proceedings of the Fifth IEEE International Symposium on

Date of Conference:

21-21 Dec. 2005