Name
Abstract | ||
|---|---|---|
One of the main problems in the radiosity method is how to discretise a scene into mesh elements that allow us to accurately represent illumination. In this paper we present a new refinement criterion for hierarchical radiosity based on the continuous and discrete generalised mutual information measures between two patches or elements. These measures, derived from the generalised entropy of of Harvda-Charvát-Tsallis, express the information transfer within a scene. The results obtained improve on the ones based on kernel smoothness and Shannon mutual information. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-72586-2_14 | International Conference on Computational Science (2) |
Keywords | Field | DocType |
new refinement criterion,radiosity method,generalised entropy,information transfer,hierarchical radiosity,mesh element,generalised-mutual-information-based oracle,main problem,discrete generalised mutual information,kernel smoothness,shannon mutual information,mutual information,kernel smoothing | Kernel (linear algebra),Mathematical optimization,Information transfer,Computer science,Mean squared error,Oracle,Theoretical computer science,Mutual information,Radiosity (computer graphics),Smoothness | Conference |
Volume | ISSN | Citations |
4488 | 0302-9743 | 1 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jaume Rigau | 1 | 143 | 14.11 |
| Miquel Feixas | 2 | 637 | 45.61 |
| Mateu Sbert | 3 | 1108 | 123.95 |