Abstract | ||
---|---|---|
Monte Carlo is the only choice of physically correct method to compute the problem of global illumination in the field of realistic image synthesis. Adaptive sampling is an appealing tool to eliminate noise, which is one of the main problems of Monte Carlo based global illumination algorithms. In this paper, we investigate the use of entropy in the domain of information theory to measure pixel quality and to do adaptive sampling. Especially we explore the nonextensive Tsallis entropy, in which a real number q is introduced as the entropic index that presents the degree of nonextensivity, to evaluate pixel quality. By utilizing the least-squares design, an entropic index q can be obtained systematically to run adaptive sampling effectively. Implementation results show that the Tsallis entropy driven adaptive sampling significantly outperforms the existing methods. To our knowledge, this may be the first try on the systematic choice of an appropriate entropic index to Tsallis entropy in the engineering fields. © 2007 IEEE. |
Year | DOI | Venue |
---|---|---|
2007 | 10.1109/CADCG.2007.4407879 | CAD/Graphics |
Keywords | Field | DocType |
entropy,least square,monte carlo methods,information theory,tsallis entropy,monte carlo,indexation,global illumination | Information theory,Mathematical optimization,Monte Carlo method,Computer science,Adaptive sampling,Image synthesis,Tsallis entropy,Pixel,Global illumination,Real number | Conference |
Volume | Issue | ISSN |
null | null | null |
ISBN | Citations | PageRank |
978-1-4244-1579-3 | 1 | 0.35 |
References | Authors | |
10 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Qing Xu | 1 | 48 | 12.40 |
Miquel Feixas | 2 | 637 | 45.61 |
Mateu Sbert | 3 | 1108 | 123.95 |
Sun Jizhou | 4 | 253 | 47.07 |