CIS 681 Distributed Ray Tracing. CIS 681 Anti-Aliasing Graphics as signal processing –Scene description: continuous signal –Sample –digital representation.

Slides:



Advertisements
Similar presentations
Sampling and Reconstruction
Advertisements

Technische Universität München Fakultät für Informatik Computer Graphics SS 2014 Sampling Rüdiger Westermann Lehrstuhl für Computer Graphik und Visualisierung.
Computer graphics & visualization Global Illumination Effects.
David Luebke 1 4/28/2015 Aliasing & Antialiasing.
Light Fields PROPERTIES AND APPLICATIONS. Outline  What are light fields  Acquisition of light fields  from a 3D scene  from a real world scene 
Eyes for Relighting Extracting environment maps for use in integrating and relighting scenes (Noshino and Nayar)
CS 551 / CS 645 Antialiasing. What is a pixel? A pixel is not… –A box –A disk –A teeny tiny little light A pixel is a point –It has no dimension –It occupies.
Shadow Rendering Techniques A point is in the shadow of a light source if it can not be “seen” by the light source, i.e. the line segment that connects.
Aliasing & Antialiasing
Advanced Ray Tracing CMSC 435/634. Basic Ray Tracing For each pixel – Compute ray direction – Find closest surface – For each light Compute direct illumination.
1 Advanced Ray Tracing Mani Thomas CISC 440/640 Computer Graphics.
CS5520 Image-Based Rendering © Chun-Fa Chang, Spring 2003 Sampling Theorem & Antialiasing April 15, 2003.
University of British Columbia CPSC 414 Computer Graphics © Tamara Munzner 1 Sampling Week 7, Fri 17 Oct 2003 p1 demos sampling.
Basic Ray Tracing CMSC 435/634. Visibility Problem Rendering: converting a model to an image Visibility: deciding which objects (or parts) will appear.
CSC418 Computer Graphics n Aliasing n Texture mapping.
CSC418 Computer Graphics n Raytracing n Shadows n Global Illumination.
Sampling and Antialiasing CMSC 491/635. Abstract Vector Spaces Addition –C = A + B = B + A –(A + B) + C = A + (B + C) –given A, B, A + X = B for only.
Fundamentals of Computer Graphics Part 6 Shading prof.ing.Václav Skala, CSc. University of West Bohemia Plzeň, Czech Republic ©2002 Prepared with Angel,E.:
© Chun-Fa Chang Sampling Theorem & Antialiasing. © Chun-Fa Chang Motivations “ My ray traced images have a lot more pixels than the TV screen. Why do.
Antialiasing CptS 548 Advanced Computer Graphics John C. Hart.
Ray Tracing Primer Ref: SIGGRAPH HyperGraphHyperGraph.
Computer Graphics Inf4/MSc Computer Graphics Lecture 9 Antialiasing, Texture Mapping.
01/28/05© 2005 University of Wisconsin Last Time Improving Monte Carlo Efficiency.
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.
-Global Illumination Techniques
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Distribution Ray Tracing.
Ray Tracing Sang Il Park SEjong University With lots of slides stolen from Jehee Lee, Doug James, Steve Seitz, Shree Nayar, Alexei Efros, Fredo Durand.
CS447/ Realistic Rendering -- Radiosity Methods-- Introduction to 2D and 3D Computer Graphics.
Ray Tracing Jian Huang, CS 594, Fall, 2002 This set of slides are used at Ohio State by Prof. Roger Crawfis.
Filtering Robert Lin April 29, Outline Why filter? Filtering for Graphics Sampling and Reconstruction Convolution The Fourier Transform Overview.
CS 450: COMPUTER GRAPHICS ANTIALIASING SPRING 2015 DR. MICHAEL J. REALE.
Week 6 - Wednesday.  What did we talk about last time?  Light  Material  Sensors.
Basic Ray Tracing CMSC 435/634. Visibility Problem Rendering: converting a model to an image Visibility: deciding which objects (or parts) will appear.
Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.
CMSC 635 Sampling and Antialiasing. Aliasing in images.
04/30/02(c) 2002 University of Wisconsin Last Time Subdivision techniques for modeling We are now all done with modeling, the standard hardware pipeline.
CSE 681 DISTRIBUTED RAY TRACING some implementation notes.
Global Illumination. Local Illumination  the GPU pipeline is designed for local illumination  only the surface data at the visible point is needed to.
Lecture 6 Rasterisation, Antialiasing, Texture Mapping,
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Hybrid Algorithms K. H. Ko School of Mechatronics Gwangju Institute.
Sampling Pixel is an area!! – Square, Rectangular, or Circular? How do we approximate the area? – Why bother? Color of one pixel Image Plane Areas represented.
Ray Tracing Fall, Introduction Simple idea  Forward Mapping  Natural phenomenon infinite number of rays from light source to object to viewer.
Bounding Volume Hierarchy. The space within the scene is divided into a grid. When a ray travels through a scene, it only passes a few boxes within the.
Sampling Theorem & Antialiasing
1Ellen L. Walker 3D Vision Why? The world is 3D Not all useful information is readily available in 2D Why so hard? “Inverse problem”: one image = many.
CSE 681 Introduction to Ray Tracing. CSE 681 Ray Tracing Shoot a ray through each pixel; Find first object intersected by ray. Image plane Eye Compute.
Global Illumination (3) Path Tracing. Overview Light Transport Notation Path Tracing Photon Mapping.
David Luebke 3/17/2016 Advanced Computer Graphics Antialiasing David Luebke
Distributed Ray Tracing. Can you get this with ray tracing?
CS 325 Introduction to Computer Graphics 04 / 07 / 2010 Instructor: Michael Eckmann.
CSL 859: Advanced Computer Graphics Dept of Computer Sc. & Engg. IIT Delhi.
Distributed Ray Tracing. Can you get this with ray tracing?
CS552: Computer Graphics Lecture 33: Illumination and Shading.
Global Illumination (3) Cone Tracing / Distributed Ray Tracing.
CIS 681 Distributed Ray Tracing. CIS 681 Anti-Aliasing Graphics as signal processing –Scene description: continuous signal –Sample –digital representation.
Distributed Ray Tracing
Sampling Theorem & Antialiasing
Sampling and Antialiasing
Jim X. Chen George Mason University
© University of Wisconsin, CS559 Fall 2004
(c) 2002 University of Wisconsin
Distribution Ray Tracing
Path Tracing (some material from University of Wisconsin)
Distributed Ray Tracing
Distributed Ray Tracing
Monte Carlo Rendering Central theme is sampling:
Distributed Ray Tracing
CSC418 Computer Graphics Aliasing Texture mapping.
Distributed Ray Tracing
Distributed Ray Tracing
Presentation transcript:

CIS 681 Distributed Ray Tracing

CIS 681 Anti-Aliasing Graphics as signal processing –Scene description: continuous signal –Sample –digital representation –Reconstruction by monitor

CIS 681 Anti-Aliasing Represent any function as sum of sinusoidals Sampling –Spatial: multiply function by comb function –Frequency: convolve function by comb function Nyquist limit Reconstruction –Spatial: convolve with filter –Frequency: multiply by filter

CIS 681 Typical anti-aliasing Increase sampling frequency –Doesn’t solve problem –Increases frequencies handled (Nyquist limit) Average values after sampling –Doesn’t address problem –Blurs bad results

CIS 681 Ideal sampling and reconstruction Sample at greater than Nyquist frequency Reconstruct using sinc (box) filter Given sampling frequency, remove all frequencies higher than Nyquist limit Filter first, then sample –or do both at the same time

CIS 681 Illumination is Integration Usually referred to as “Kajia’s Rendering Equation” Outgoing intensity of reflected light at a point on a surface in a certain direction is The point’s emission, An integral over the hemisphere above the surface of an illumination function L and a bidirectional reflectance function (BDRF). The shading function may be too complex to compute analytically

CIS 681 Distributed Ray Tracing Anti-Aliasing Gloss Translucency Soft Shadows (Penumbra) Motion Blur Depth of field Sampling to approximate integral

CIS 681 Importance Sampling Sample uniformly and average samples according to distribution function OR Sample according to distribution function and average samples uniformly

CIS 681 Monte Carlo Integration Determine area under the curve Non analytic function so can’t integrate Can tell if point is above or below curve Generate random samples Count fraction below curve Accurate in the limit

CIS 681 Supersampling Multiple samples per pixel Average together using uniform weights (box filter) Average together using a pyrimid filter or a truncated Gaussian filter

CIS 681 Adaptive Supersampling Trace rays at corner of pixels: initial area Trace ray (sample) at center of area If center is ‘different’ from corners, –Subdivide area into 4 sub-areas –Recurse on sub-areas

CIS 681 Poison Distribution Similar to distribution of vision receptors Random with minimum distance between samples

CIS 681 Spectrum analysis of regular sampling low frequency signal high frequency signal Original signal Sampling filter Sampled signal Ideal reconstruction filter Reconstructed signal

CIS 681 low frequency signal high frequency signal Original signal Sampling filter Sampled signal Ideal reconstruction filter Reconstructed signal Spectrum analysis of regular sampling

CIS 681 Jittered Sampling Frequencies above Nyquist limit are converted to noise instead of incorrect patterns

CIS 681 Gloss

CIS 681 Gloss Mirror reflections calculated by tracing rays in the direction of reflection Gloss is calculated by distributing these rays about the mirror direction –The distribution is weighted according to the same distribution function that determines highlights.

CIS 681 Gloss

CIS 681 Translucency

CIS 681 Translucency Analogous to the problem of gloss Distribute the secondary rays about the main direction of the transmitted rays The distribution of transmitted rays is defined by a specular transmittance function

CIS 681 Translucency

CIS 681 Penumbras

CIS 681 Penumbras Consider the light source to be an area, not a point Trace rays to random areas on the surface of the light source distribute rays according to areas of varying intensity of light source (if any) Use the fraction of the light intensity equal to the fraction of rays which indicate an unobscured light source

CIS 681 Penumbras

CIS 681 Motion Blur

CIS 681 Motion Blur Post-process blurring can get some effects, but consider: Two objects moving so that one always obscures the other Can’t render and blur objects separately A spinning top with texture blurred but highlights sharp Can’t post-process blur a rendered object The blades of a fan creating a blurred shadow Must consider the movement of other objects

CIS 681 Temporal Jittered Sampling time Jitter in space Jitter in time

CIS 681 Temporal Jittered Sampling

CIS 681 Pinhole Camera Image plane Perfect focus - low light

CIS 681 Use of lens - more light lens Focal length a = F/n F= n = f-stop

CIS 681 Use of lens - more light Image plane Focal plane lens s d

CIS 681 Circle of Confusion Image plane Focal plane lens s d c = circle of confusion ~= 0.33mm c DrDr DfDf

Depth of Field

CIS 681 Depth of Field Image plane Focal plane lens s d Given pixel, s, d 1. Construct ray from pixel through lens center to point p on focal plane 2. Randomly generate point q on 2D lens 3. Trace ray from q through p p q

CIS 681 Summary Space-time jitter subsample Random on area light source Random on lens Random on refraction direction