Function Representation & Spherical Harmonics. Function approximation G(x)... function to represent B 1 (x), B 2 (x), … B n (x) … basis functions G(x)

Slides:



Advertisements
Similar presentations
Normal Mapping for Precomputed Radiance Transfer
Advertisements

Local, Deformable Precomputed Radiance Transfer
LAPLACE TRANSFORMS.
Leo Lam © Signals and Systems EE235. Courtesy of Phillip Leo Lam ©
Spherical Harmonic Lighting Jaroslav Křivánek. Overview Function approximation Function approximation Spherical harmonics Spherical harmonics Some other.
1 Radiance Workshop 2004 – Fribourg, Switzerland Radiance Caching for Efficient Global Illumination Computation J. Křivánek P. Gautron S. Pattanaik K.
A Novel Hemispherical Basis for Accurate and Efficient Rendering P. Gautron J. Křivánek S. Pattanaik K. Bouatouch Eurographics Symposium on Rendering 2004.
A Mike Day Paper Exercise
Leo Lam © Signals and Systems EE235 Leo Lam.
Environment Mapping CSE 781 – Roger Crawfis
Data Modeling and Parameter Estimation Nov 9, 2005 PSCI 702.
MRA basic concepts Jyun-Ming Chen Spring Introduction MRA (multi- resolution analysis) –Construct a hierarchy of approximations to functions in.
TOPIC TECHNIQUES OF INTEGRATION. 1. Integration by parts 2. Integration by trigonometric substitution 3. Integration by miscellaneous substitution 4.
Lighting affects appearance. What is the Question ? (based on work of Basri and Jacobs, ICCV 2001) Given an object described by its normal at each.
Computer graphics & visualization Pre-Computed Radiance Transfer PRT.
Lecture 9 Second Order Linear Differential Equations:
An Efficient Representation for Irradiance Environment Maps Ravi Ramamoorthi Pat Hanrahan Stanford University.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Basic Image Processing January 26, 30 and February 1.
Ground State of the He Atom – 1s State First order perturbation theory Neglecting nuclear motion 1 - electron electron 2 r 1 - distance of 1 to nucleus.
10.1 – Exponents Notation that represents repeated multiplication of the same factor. where a is the base (or factor) and n is the exponent. Examples:
EXAMPLE 1 Identify polynomial functions 4 Decide whether the function is a polynomial function. If so, write it in standard form and state its degree,
Polynomials and Polynomial Functions Section 5.3.
EXAMPLE 1 Identify polynomial functions
Function approximation: Fourier, Chebyshev, Lagrange
1 The Spectral Method. 2 Definition where (e m,e n )=δ m,n e n = basis of a Hilbert space (.,.): scalar product in this space In L 2 space where f * :
THE LAPLACE TRANSFORM LEARNING GOALS Definition The transform maps a function of time into a function of a complex variable Two important singularity functions.
Mathematics for Computer Graphics (Appendix A) Won-Ki Jeong.
Orthogonal Functions Numerical Methods in Geophysics Function Approximation The Problem we are trying to approximate a function f(x) by another function.
Chapter 9 Function Approximation
TEMPLATE BASED SHAPE DESCRIPTOR Raif Rustamov Department of Mathematics and Computer Science Drew University, Madison, NJ, USA.
Efficient Irradiance Normal Mapping Ralf Habel, Michael Wimmer Institute of Computer Graphics and Algorithms Vienna University of Technology.
1.2 – Evaluate and Simplify Algebraic Expressions A numerical expression consists of numbers, operations, and grouping symbols. An expression formed by.
3. 3 Separation of Variables We seek a solution of the form Cartesian coordinatesCylindrical coordinates Spherical coordinates Not always possible! Usually.
Inverse Matrices and Systems
AN ORTHOGONAL PROJECTION
Real-Time Rendering Digital Image Synthesis Yung-Yu Chuang 01/03/2006 with slides by Ravi Ramamoorthi and Robin Green.
An Efficient Representation for Irradiance Environment Maps Ravi Ramamoorthi Pat Hanrahan Stanford University SIGGRAPH 2001 Stanford University SIGGRAPH.
Fourier TheoryModern Seismology – Data processing and inversion 1 Fourier Series and Transforms Orthogonal functions Fourier Series Discrete Fourier Series.
Real-Time Relighting Digital Image Synthesis Yung-Yu Chuang 1/10/2008 with slides by Ravi Ramamoorthi, Robin Green and Milos Hasan.
6. Introduction to Spectral method. Finite difference method – approximate a function locally using lower order interpolating polynomials. Spectral method.
Lighting affects appearance. How do we represent light? (1) Ideal distant point source: - No cast shadows - Light distant - Three parameters - Example:
Leo Lam © Signals and Systems EE235. Leo Lam © Today’s menu Happy May! Chocolates! Fourier Series Vote!
Signal Processing and Representation Theory Lecture 3.
4.3 Introduction to Polynomials
Quick survey about PRT Valentin JANIAUT KAIST (Korea Advanced Institute of Science and Technology)
Scientific Computing General Least Squares. Polynomial Least Squares Polynomial Least Squares: We assume that the class of functions is the class of all.
Climate Modeling In-Class Discussion: Legendre Polynomials.
THE LAPLACE TRANSFORM LEARNING GOALS Definition
Copyright © 2011 Pearson Education, Inc. Slide Techniques For Calculating Limits Rules for Limits 1.Constant rule If k is a constant real number,
Rodrigues Formula :Laguerre Polynomials ( n! changes scale ) 3. Laguerre Functions Laguerre ODE C encircles x but no other singularities Schlaefli integral.
Runge Kutta schemes Taylor series method Numeric solutions of ordinary differential equations.
Continuous-time Fourier Series Prof. Siripong Potisuk.
Working Group « Pre-Filtering »
2.3 - Calculating Limits Using The Limit Laws
Real-time environment map lighting
Finite element methods
5.1 Combining Functions Perform arithmetic operations on functions
Chapter 9 Function Approximation
Evaluate Polynomial Functions
Zeros of a Polynomial Function
Numerical Integration:
Chapter 3 Section 6.
Chapter 3 Section 6.
2-6: Combinations of Functions
6-1: Operations on Functions (+ – x ÷)
2-6: Combinations of Functions
Introduction CSE 541.
Approximation of Functions
Approximation of Functions
Presentation transcript:

Function Representation & Spherical Harmonics

Function approximation G(x)... function to represent B 1 (x), B 2 (x), … B n (x) … basis functions G(x) is a linear combination of basis functions Storing a finite number of coefficients c i gives an approximation of G(x)

Examples of basis functions Tent function (linear interpolation)Associated Legendre polynomials

Function approximation Linear combination – sum of scaled basis functions

Function approximation Linear combination – sum of scaled basis functions

Finding the coefficients How to find coefficients c i ? – Minimize an error measure What error measure? – L 2 error Approximated function Original function

Finding the coefficients Minimizing E L 2 leads to Where

Finding the coefficients Matrix does not depend on G(x) – Computed just once for a given basis

Finding the coefficients Given a basis {B i (x)} 1. Compute matrix B 2. Compute its inverse B -1 Given a function G(x) to approximate 1. Compute dot products 2. … (next slide)

Finding the coefficients 2. Compute coefficients as

Orthonormal basis Orthonormal basis means If basis is orthonormal then

Orthonormal basis If the basis is orthonormal, computation of approximation coefficients simplifies to We want orthonormal basis functions

Orthonormal basis Projection: How “similar” is the given basis function to the function we’re approximating Original functionBasis functions Coefficients

Another reason for orthonormal basis functions f(x) = fifi B i (x) g(x) = gigi B i (x)  f(x)g(x)dx = fifi gigi Intergral of product = dot product of coefficients

Application to GI Illumination integral L o = ∫ L i (  i ) BRDF (  i ) cos  i d  i

Spherical Harmonics

Spherical harmonics Spherical function approximation Domain I = unit sphere S – directions in 3D Approximated function: G(θ,φ) Basis functions: Y i (θ,φ)= Y l,m (θ,φ) – indexing: i = l (l+1) + m

The SH Functions

Spherical harmonics K … normalization constant P … Associated Legendre polynomial – Orthonormal polynomial basis on (0,1) In general: Y l,m (θ,φ) = K. Ψ(φ). P l,m (cos θ) – Y l,m (θ,φ) is separable in θ and φ

Function approximation with SH n…approximation order There are n 2 harmonics for order n

Function approximation with SH Spherical harmonics are orthonormal Function projection – Computing the SH coefficients – Usually evaluated by numerical integration Low number of coefficients  low-frequency signal

Function approximation with SH

Product integral with SH Simplified indexing – Y i = Y l,m – i = l (l+1) + m Two functions represented by SH