Abstract
A novel method for approximating the radiosity kernel by a discrete set of basis functions is presented. The algorithm is characterized by selecting samples from the geometry definition and iteratively creates a functional model instantiated by a set of Gaussian basis functions. These are supported over the whole environment and thus, surfaces are not considered separately. Together with the implicit clustering algorithm provided by the applied learning scheme, the algorithm accounts ideally for coherence in the global kernel function.
On one hand, this leads to a very sparse representation of the kernel. On the other hand, by avoiding the creation of initial basis functions for separate pairs of surfaces, the method is capable of calculating even huge geometries to a desired accuracy with a proportional amount of computing resources.
Recent results from the field of artificial neural networks (the Growing Cell Structures) are extended for the presented learning algorithm. This work is done in Flatland, but there are no methodical constraints which bound the application to two dimensions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
James T. Kajiya. The rendering equation. In David C. Evans and Russell J. Athay, editors, Computer Graphics (SIGGRAPH ’86 Proceedings), volume 20, pages 143–150, August 1986.
Paul Heckbert. Radiosity in flatland. Computer Graphics Forum (Eurographics ’92), 11(3):181–192, September 1992.
Michael F. Cohen and John R. Wallace. Radiosity and Realistic Image Synthesis. Academic Press Professional, San Diego, CA, 1993.
Francois Sillion and Claude Puech. Radiosity and Global Illumination. Morgan Kaufmann, San Francisco, 1994.
Pat Hanrahan, David Salzman, and Larry Aupperle. A rapid hierarchical radiosity algorithm. In Thomas W. Sederberg, editor, Computer Graphics (SIGGRAPH ’91 Proceedings), volume 25, pages 197–206, July 1991.
Steven J. Gortler, Peter Schröder, Michael F. Cohen, and Pat Hanrahan. Wavelet radiosity. In Computer Graphics Proceedings, Annual Conference Series, 1993, pages 221–230, 1993.
Brian Smits, James Arvo, and Donald Greenberg. A clustering algorithm for radiosity in complex environments. In Andrew Glassner, editor, Proceedings of SIGGRAPH ’94 (Orlando, Florida, July 24–29, 1994), Computer Graphics Proceedings, Annual Conference Series, pages 435–442. ACM SIGGRAPH, ACM Press, July 1994. ISBN 0-89791-667-0.
François Sillion. Clustering and volume scattering for hierarchical radiosity calculations. In Fifth Eurographics Workshop on Rendering, pages 105–117, Darmstadt, Germany, June 1994.
Bernd Fritzke. Growing cell structures — a self-organizing network for unsupervised and supervised learning. Technical Report ICSI TR-93-026, International Computer Science Institute, Berkeley, CA, May 1993.
J. Moody and C. Darken. Fast learning in networks of locally-tuned processing units. Technical Report YALEU/DCS/RR-654, Dept. of Computer Science, Yale University, New Haven, CT, 1989.
J. Hertz, A. Krogh, and R. Palmer. Introduction to the Theory of Neural Computation. Addison-Wesley, 1991.
Bernd Fritzke. Incremental learning of local linear mappings. In Proceedings of the ICANN-95, Paris, France, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag/Wien1996
About this paper
Cite this paper
Bohn, CA. (1996). Efficiently Representing the Radiosity Kernel through Learning. In: Pueyo, X., Schröder, P. (eds) Rendering Techniques ’96. EGSR 1996. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7484-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7484-5_13
Published:
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82883-0
Online ISBN: 978-3-7091-7484-5
eBook Packages: Springer Book Archive