02/18/05© 2005 University of Wisconsin Last Time Radiosity –Converting the LTE into the radiosity equation –Solving with Gauss-Seidel relaxation –Form.

Slides:



Advertisements
Similar presentations
1GR2-00 GR2 Advanced Computer Graphics AGR Lecture 17 Radiosity - Conclusion Non-PhotoRealistic Rendering.
Advertisements

1GR2-00 GR2 Advanced Computer Graphics AGR Lecture 16 Radiosity - continued.
SI31 Advanced Computer Graphics AGR
Computer Vision Radiometry. Bahadir K. Gunturk2 Radiometry Radiometry is the part of image formation concerned with the relation among the amounts of.
An Efficient Progressive Refinement Strategy for Hierarchical Radiosity Nicolas Holzschuch, François Sillion and George Drettakis iMAGIS/IMAG, Grenoble.
Computer graphics & visualization Global Illumination Effects.
Presented by Konstantinos Georgiadis. Abstract This method extends the Hierarchical Radiosity approach for environments whose geometry and surface attributes.
Radiosity Mel Slater Department of Computer Science University College London
Illumination Models Radiosity Chapter 14 Section 14.7 Some of the material in these slides may have been adapted from University of Virginia, MIT, Colby.
MATH 685/ CSI 700/ OR 682 Lecture Notes
Global Illumination: Radiosity
17.1 Si31_2001 SI31 Advanced Computer Graphics AGR Lecture 17 Radiosity - Conclusion Non-PhotoRealistic Rendering.
Radiosity A Fascinating Presentation by Alex Danilevky.
16.1 si31_01 SI31 Advanced Computer Graphics AGR Lecture 16 Radiosity - continued.
Everything on Global Illumination Xavier Granier - IMAGER/UBC.
1 7M836 Animation & Rendering Global illumination, radiosity Arjan Kok
CSCE 641 Computer Graphics: Radiosity Jinxiang Chai.
Recent Advances in Radiosity Philippe Bekaert Department of Computer Science K.U.Leuven.
The Radiosity Method Donald Fong February 10, 2004.
Paper by Alexander Keller
CSCE 641 Computer Graphics: Radiosity Jinxiang Chai.
1 Dr. Scott Schaefer Radiosity. 2/38 Radiosity 3/38 Radiosity Physically based model for light interaction View independent lighting Accounts for indirect.
CSCE 441 Computer Graphics: Radiosity Jinxiang Chai.
CSE 872 Dr. Charles B. Owen Advanced Computer Graphics1 Radiosity What we can do with scan line conversion and ray tracing What we can’t do Radiosity.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Stochastic Radiosity K. H. Ko School of Mechatronics Gwangju Institute.
COMPUTER GRAPHICS CS 482 – FALL 2014 AUGUST 27, 2014 FIXED-FUNCTION 3D GRAPHICS MESH SPECIFICATION LIGHTING SPECIFICATION REFLECTION SHADING HIERARCHICAL.
Today More raytracing stuff –Soft shadows and anti-aliasing More rendering methods –The text book is good on this –I’ll be using images from the CDROM.
02/25/05© 2005 University of Wisconsin Last Time Meshing Volume Scattering Radiometry (Adsorption and Emission)
Radiosity 김 성 남. Contents Definition/Goal Basic Radiosity Method Progressive Radiosity Method Mesh substructuring Hierarchical Radiosity Ray.
-Global Illumination Techniques
01/29/03© 2003 University of Wisconsin Last Time Radiosity.
David Luebke 1 10/12/2015 CS 551/651: Advanced Computer Graphics Advanced Ray Tracing Radiosity.
02/16/05© 2005 University of Wisconsin Last Time Re-using paths –Irradiance Caching –Photon Mapping.
CS447/ Realistic Rendering -- Radiosity Methods-- Introduction to 2D and 3D Computer Graphics.
Volume radiosity Michal Roušal University of West Bohemia, Plzeň Czech republic.
02/05/03© 2003 University of Wisconsin Last Time Importance Better Form Factors Meshing.
Towards a Taxonomy of Global Illumination Algorithms Philip Dutré Program of Computer Graphics Cornell University.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Stochastic Radiosity K. H. Ko School of Mechatronics Gwangju Institute.
Graphics Lecture 13: Slide 1 Interactive Computer Graphics Lecture 13: Radiosity - Principles.
111/17/ :21 Graphics II Global Rendering and Radiosity Session 9.
Radisoity Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts Director, Arts Technology Center University of New.
Radiosity Jian Huang, CS594, Fall 2002 This set of slides reference the text book and slides used at Ohio State.
DPL11/27/2015 CS 551/651: Radiosity David Luebke
CPSC 641 Computer Graphics: Radiosity Jinxiang Chai.
Graphics Graphics Korea University cgvr.korea.ac.kr 1 Surface Rendering Methods 고려대학교 컴퓨터 그래픽스 연구실.
Graphics Graphics Korea University cgvr.korea.ac.kr 1 7. Speed-up Techniques Presented by SooKyun Kim.
Lecture 21 MA471 Fall 03. Recall Jacobi Smoothing We recall that the relaxed Jacobi scheme: Smooths out the highest frequency modes fastest.
Pure Path Tracing: the Good and the Bad Path tracing concentrates on important paths only –Those that hit the eye –Those from bright emitters/reflectors.
Radiosity 1. 2 Introduction Ray tracing best with many highly specular surfaces ­Not real scenes Rendering equation describes general shading problem.
02/12/03© 2003 University of Wisconsin Last Time Intro to Monte-Carlo methods Probability.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Stochastic Path Tracing Algorithms K. H. Ko School of Mechatronics Gwangju.
Fast Global Illumination Including Specular Effects Xavier Granier 1 George Drettakis 1 Bruce J. Walter 2 1 iMAGIS -GRAVIR/IMAG-INRIA iMAGIS is a joint.
Image-Based Rendering Geometry and light interaction may be difficult and expensive to model –Think of how hard radiosity is –Imagine the complexity of.
Controlling Memory Consumption of Hierarchical Radiosity with Clustering iMAGIS -GRAVIR/IMAG-INRIA iMAGIS is a joint project of CNRS/INRIA/UJF/INPG Xavier.
Global Illumination (2) Radiosity (3). Classic Radiosity Algorithm Mesh Surfaces into Elements Compute Form Factors Between Elements Solve Linear System.
02/07/03© 2003 University of Wisconsin Last Time Finite element approach Two-pass approaches.
02/9/05© 2005 University of Wisconsin Last Time Lights Next assignment – Implement Kubelka-Munk as a BSDF.
01/27/03© 2002 University of Wisconsin Last Time Radiometry A lot of confusion about Irradiance and BRDFs –Clarrified (I hope) today Radiance.
Graphics Lecture 14: Slide 1 Interactive Computer Graphics Lecture 14: Radiosity - Computational Issues.
CS552: Computer Graphics Lecture 33: Illumination and Shading.
02/23/05© 2005 University of Wisconsin Last Time Radiosity –Progressive Radiosity –Assorted optimizations.
Radiosity Part II Form Factors
CSc4820/6820 Computer Graphics Algorithms Ying Zhu Georgia State University Radiosity.
© 2003 University of Wisconsin
Radiosity Dr. Scott Schaefer.
CSCE 441 Computer Graphics: Radiosity
© 2003 University of Wisconsin
Problems with Gauss-Seidel
Radiosity Sung-Eui Yoon (윤성의) CS580: Course URL:
Advanced Computer Graphics: Radiosity
Presentation transcript:

02/18/05© 2005 University of Wisconsin Last Time Radiosity –Converting the LTE into the radiosity equation –Solving with Gauss-Seidel relaxation –Form factor computations

02/18/05© 2005 University of Wisconsin Today Progressive Radiosity Assorted optimizations

02/18/05© 2005 University of Wisconsin Problems with Gauss-Seidel All the form factors are required before any image can be generated –So you wait a long time to see anything Reducing the number of form factors requires reducing the number of patches, which severely impacts quality We desire a progressive solution, that starts with a rough approximation and refines it –This also opens the possibility of computing some pieces (the bits you can see) before others

02/18/05© 2005 University of Wisconsin Radiosity Eqn to Energy Eqn The radiosity equation is in terms of power per unit area Rewrite this equation in terms of energy values per patch (instead of per unit area) Note that the form factor is now from j to i

02/18/05© 2005 University of Wisconsin Relaxation and Residuals Relaxation methods start with an initial guess,  (0), and perform a sequence of relaxation steps, each resulting in a new  (k) The residual is defined as At each step, relaxation methods zero one element of the residual (e.g. Gauss-Seidel zeros each one in turn) Note the residual is zero when the equation is solved

02/18/05© 2005 University of Wisconsin Southwell Relaxation Southwell relaxation zeros the largest residual at each step We can update the radiosity for the patch i in a single step! But we need to update all the other residuals

02/18/05© 2005 University of Wisconsin Updating Residuals Note that only one component of  changed,  i Hence, we only need one element of K for every j, one row in total Using the definition of residuals

02/18/05© 2005 University of Wisconsin Southwell Summary Each patch has two components: energy,  i k, and undistributed energy, r i k Start with some  i 0 and hence r i 0 At each step k+1: –Choose the i with maximum residual –Update  i k+1 and r i k+1 =0 –Update all the r j k+1

02/18/05© 2005 University of Wisconsin Physical Interpretation Assume that all the initial patch energies are 0 Then the initial residuals are the amounts of energy to be emitted by each patch Each step redistributes the residual according to: Recall, the form factor F ij is the amount of power radiated by i that j receives So, each patch gets its own share of the residual that is shot, according to the form factors

02/18/05© 2005 University of Wisconsin Gathering and Shooting Gauss-Seidel “gathers” radiosity from every patch to a specific patch: Southwell “shoots” energy from one patch onto all the other patches The terms gathering and shooting are used commonly in the literature –Eg “do a final gather” means gather radiance to the image plane

02/18/05© 2005 University of Wisconsin Progressive Refinement After any number of iterations, an estimate of each patch’s final energy can be obtained by: These intermediate results can be displayed as the algorithm proceeds, giving faster feedback

02/18/05© 2005 University of Wisconsin Typical Equations Typically work in terms of radiosity, which result in equations similar to those from the previous slides Define radiosity and “un-shot” radiosity On each step, find the highest residual: Compute all the form factors out of patch i Continued…

02/18/05© 2005 University of Wisconsin More Equations Display partial solution by displaying B j

02/18/05© 2005 University of Wisconsin Ambient Correction Progressive radiosity images look dark at first, because shooters hold onto their energy until it’s their turn. An ambient correction can be added to the display only:

02/18/05© 2005 University of Wisconsin The Effect of Patch Size There is a trade-off in patch size: large patches give faster solution, small patches give better results –Doubling the patch resolution increases computation by 16x 4x in each patch, but N 2 computation, so 16x Effect of large patches is most obvious in receiving: patch size indicates largest resolvable illumination feature –Particularly important when? Large patches are not so bad for emitting –What impact will large vs. small patches have?

02/18/05© 2005 University of Wisconsin Shooting to Vertices “Standard” progressive radiosity shoots from points to areas –Point is middle of shooting patch –Area is the area of a receiving element Better to shoot from area to points: –Area is source patch, point is receiving vertex –Progressive radiosity really needs F ji –Less aliasing under certain circumstances –Radiosity is needed at vertices for display –Greater control over receivers

02/18/05© 2005 University of Wisconsin Ray-casting For Form Factors Aim: compute Cast rays from y to sub-patches, P i k, of P i : –Ray determines (constant) visibility for each sub-patch Then: Not Monte-Carlo, but similar!

02/18/05© 2005 University of Wisconsin Delta Form Factors We need to compute  F k Several possibilities –Assume constant, evaluated using angles and radius for a point at the center of the patch (can be very bad) –Use analytic methods, point-polygon (costly) –Use disc approximation Assume sub-patch is a small disc Form factor for point-disc is known

02/18/05© 2005 University of Wisconsin Automated Meshing The patch and element resolution should be decided based on the complexity of the illumination situation It is unreasonable to expect a user to know what is required – they are, after all, using the software to find a solution Automated meshing strategies are desired

02/18/05© 2005 University of Wisconsin Adaptive Subdivision (Progressive Version) Shoot as normal Choose to subdivide after each shot –Look at how the received energy varied over the surface Not all shooting patches require the same subdivision –For instance, lights in different places cast different shadows –Can re-compute subdivision for each shot Distribute radiosity gathered at one resolution to that gathered at another –Need all radiosity at largest patch size for shooting –Need all radiosity at highest level of subdivision for rendering

02/18/05© 2005 University of Wisconsin Which Resolution? Should P be bigger or smaller for each receiving patch? What influences the decision?

02/18/05© 2005 University of Wisconsin Hierarchical Meshing Use different resolution depending on who is emitting and who is receiving Build hierarchy of elements for each patch Record interactions between elements at appropriate levels Essentially replaces blocks in the form factor matrix with average values

02/18/05© 2005 University of Wisconsin Building the Hierarchy Start with “top level” patches Estimate the error incurred by each patch-patch transfer. Use: –Form factor estimate: –Radiosity  Form factor –Importance (more later) If error too large, break one element and recurse –But only recurse for this transfer – don’t re-compute all transfers Like starting with finest resolution, and averaging blocks in the form factor matrix

02/18/05© 2005 University of Wisconsin Hierarchical Solution For each Gauss-Seidel iteration –Gather energy to a patch along all the links –Update radiosity values for each node in the patch hierarchy Push  radiosity down from parents to children – no area weighting Pull radiosity up from children to parents – area weighted Cost proportional to number of links, which is O(N) where N is number of leaves

02/18/05© 2005 University of Wisconsin Brightness-weighted refinement Subdivide based on an estimate of energy transferred Need radiosity estimates, which we don’t know beforehand: –Start with high error threshold, and get approximate solution –Refine hierarchy using radiosity estimates –Repeat with successively lower thresholds –Also called multi-grid methods

02/18/05© 2005 University of Wisconsin Importance For a single image, only the visible surfaces are directly important –Don’t care what’s “down the hall” Surfaces illuminating visible surfaces are also important, and other surfaces illuminating those surfaces… Importance propagates backwards from the “primary” sources of importance –Visible surfaces are typically prime sources of importance

02/18/05© 2005 University of Wisconsin Solving for Importance R i is the inherent importance of a given element When radiosity is gathered, importance is shot Use BIF as error estimate in determining subdivision –Radiosity * Importance * Form Factor: Combine with multi-grid method Note: must use different push-pull operations for importance –Push down area-weighted, pull up non-weighted

02/18/05© 2005 University of Wisconsin Next Time A little more radiosity Volume scattering