Problems with Gauss-Seidel

Slides:



Advertisements
Similar presentations
1GR2-00 GR2 Advanced Computer Graphics AGR Lecture 16 Radiosity - continued.
Advertisements

SI31 Advanced Computer Graphics AGR
Mutigrid Methods for Solving Differential Equations Ferien Akademie 05 – Veselin Dikov.
Radiosity Mel Slater Department of Computer Science University College London
CS 290H 7 November Introduction to multigrid methods
Geometric (Classical) MultiGrid. Hierarchy of graphs Apply grids in all scales: 2x2, 4x4, …, n 1/2 xn 1/2 Coarsening Interpolate and relax Solve the large.
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.
Steepest Decent and Conjugate Gradients (CG). Solving of the linear equation system.
Part 6 Chapter 22 Boundary-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The McGraw-Hill.
Radiosity A Fascinating Presentation by Alex Danilevky.
1 Systems of Linear Equations Iterative Methods. 2 B. Iterative Methods 1.Jacobi method and Gauss Seidel 2.Relaxation method for iterative methods.
16.1 si31_01 SI31 Advanced Computer Graphics AGR Lecture 16 Radiosity - continued.
1 Systems of Linear Equations Iterative Methods. 2 B. Direct Methods 1.Jacobi method and Gauss Seidel 2.Relaxation method for iterative methods.
1 7M836 Animation & Rendering Global illumination, radiosity Arjan Kok
CSCE 641 Computer Graphics: Radiosity Jinxiang Chai.
Geometric (Classical) MultiGrid. Linear scalar elliptic PDE (Brandt ~1971)  1 dimension Poisson equation  Discretize the continuum x0x0 x1x1 x2x2 xixi.
The Radiosity Method Donald Fong February 10, 2004.
CSCE 641 Computer Graphics: Radiosity Jinxiang Chai.
CSCE 441 Computer Graphics: Radiosity Jinxiang Chai.
Iterative Methods for Solving Linear Systems of Equations ( part of the course given for the 2 nd grade at BGU, ME )
1 Systems of Linear Equations Error Analysis and System Condition.
Normalised Least Mean-Square Adaptive Filtering
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.
Radiosity 김 성 남. Contents Definition/Goal Basic Radiosity Method Progressive Radiosity Method Mesh substructuring Hierarchical Radiosity Ray.
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.
02/18/05© 2005 University of Wisconsin Last Time Radiosity –Converting the LTE into the radiosity equation –Solving with Gauss-Seidel relaxation –Form.
Volume radiosity Michal Roušal University of West Bohemia, Plzeň Czech republic.
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.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 3- Chapter 12 Iterative Methods.
Radiosity Jian Huang, CS594, Fall 2002 This set of slides reference the text book and slides used at Ohio State.
Graphics Graphics Korea University cgvr.korea.ac.kr 1 Surface Rendering Methods 고려대학교 컴퓨터 그래픽스 연구실.
Optical Flow. Distribution of apparent velocities of movement of brightness pattern in an image.
Lecture 21 MA471 Fall 03. Recall Jacobi Smoothing We recall that the relaxed Jacobi scheme: Smooths out the highest frequency modes fastest.
The Art of Programming. The process of breaking problems down into smaller, manageable parts By breaking the problem down, each part becomes more specific.
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.
Introduction to Scientific Computing II
Linear Systems Numerical Methods. 2 Jacobi Iterative Method Choose an initial guess (i.e. all zeros) and Iterate until the equality is satisfied. No guarantee.
02/07/03© 2003 University of Wisconsin Last Time Finite element approach Two-pass approaches.
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.
Explicit Approximation
Solving Systems of Linear Equations: Iterative Methods
بسم الله الرحمن الرحيم.
Gauss-Siedel Method.
Numerical Analysis Lecture12.
Boundary-Value Problems
MultiGrid.
Iterative Methods Good for sparse matrices Jacobi Iteration
Autar Kaw Benjamin Rigsby
Numerical Analysis Lecture 45.
© 2003 University of Wisconsin
CSCE 441 Computer Graphics: Radiosity
Instructor :Dr. Aamer Iqbal Bhatti
Stencil Quiz questions
Numerical Analysis Lecture14.
Stencil Quiz questions
© 2003 University of Wisconsin
Numerical Analysis Lecture13.
6.5 Taylor Series Linearization
OPTICS III, IV: Global Illumination
Radiosity Sung-Eui Yoon (윤성의) CS580: Course URL:
Numerical Computation and Optimization
Programming assignment #1 Solving an elliptic PDE using finite differences Numerical Methods for PDEs Spring 2007 Jim E. Jones.
Advanced Computer Graphics: Radiosity
Presentation transcript:

Problems with Gauss-Seidel All the form factors are required before any image can be generated 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

Radiosity Eqn to Energy Eqn Rewrite this equation in terms of energy values per patch (instead of per unit area)

Relaxation and Residuals Relaxation methods start with an initial guess, (0), and perform a sequence of relaxation steps, each resulting in a new (k) Define , the residual At each step, relaxation methods zero one element of the residual (e.g. Gauss-Seidel zeros each one in turn)

Southwell Relaxation Southwell relaxation zeros the largest residual at each step

Southwell Summary Each patch has two components: energy, ik, and undistributed energy, rik Start with some i0 and hence ri0 At each step k+1: Choose the i with maximum residual Update ik+1 and rik+1 =0 Update all the rjk+1

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: So, each patch gets its own share of the residual that is shot, according to the form factors

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

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

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:

Capturing Detail Finer patches are required around shadow boundaries and fast changes in radiosity Halving the linear dimension of all patches results in 16x more work Fine patches are needed as receivers, but not as emitters Substructuring addresses this

Substructuring Break each patch into smaller elements for the purposes of receiving energy Divide each patch, Pi into mi elements, denoted pq for 1  q<mi. Radiosity for element pq is:

Substructuring (more) Patch radiosity is area weighted radiosity of elements: Substituting, and assuming elements of a patch have equal exitance and reflectance: Using area averaged form factor

Solution Structure Find element to patch form factors (MN) Combine to form patch to patch form factors (N  N) Solve for patch radiosities (no worse than regular Gauss-Seidel) Compute element radiosities

Substructuring and Progressive Refinement Can do progressive refinement with substructuring Shoot energy from patches to elements But, form factor computations are poor, because the form factor from a large patch to a small element is needed Leads to visible errors in images

Adaptive Subdivision Instead of fixing the elements and patches, allow elements to be subdivided based on how the solution proceeds After each Gauss-Seidel step, look at the radiosity gradient, and break elements with high gradients. Then redo the computation with the new elements With progressive radiosity, can subdivide differently for each shot, interpolating and averaging as necessary