PRADEE P SEN Pradeep Sen UC Santa Barbara Denoising Your Monte Carlo Renders: Recent Advances in Image-Space Adaptive Sampling and Reconstruction Matthias.

Slides:



Advertisements
Similar presentations
Bayesian Belief Propagation
Advertisements

Final Gathering using Adaptive Multiple Importance Sampling 1. Introduction We propose an efficient final gathering technique using adaptive multiple importance.
A Robust Super Resolution Method for Images of 3D Scenes Pablo L. Sala Department of Computer Science University of Toronto.
Breaking the Frame David Luebke University of Virginia.
Joydeep Biswas, Manuela Veloso
Hilal Tayara ADVANCED INTELLIGENT ROBOTICS 1 Depth Camera Based Indoor Mobile Robot Localization and Navigation.
Light Fields PROPERTIES AND APPLICATIONS. Outline  What are light fields  Acquisition of light fields  from a 3D scene  from a real world scene 
Accelerating Spatially Varying Gaussian Filters Jongmin Baek and David E. Jacobs Stanford University.
High-Quality Parallel Depth-of- Field Using Line Samples Stanley Tzeng, Anjul Patney, Andrew Davidson, Mohamed S. Ebeida, Scott A. Mitchell, John D. Owens.
Advanced Ray Tracing CMSC 435/634. Basic Ray Tracing For each pixel – Compute ray direction – Find closest surface – For each light Compute direct illumination.
5D COVARIA NCE TRACING FOR EFFICIENT DEFOCUS AND MOTION BLUR Laurent Belcour 1 Cyril Soler 2 Kartic Subr 3 Nicolas Holzschuch 2 Frédo Durand 4 1 Grenoble.
Rob Fergus Courant Institute of Mathematical Sciences New York University A Variational Approach to Blind Image Deconvolution.
1 Comp300a: Introduction to Computer Vision L. QUAN.
Image Forgery Detection by Gamma Correction Differences.
CSCE 641 Computer Graphics: Image-based Rendering (cont.) Jinxiang Chai.
Linear View Synthesis Using a Dimensionality Gap Light Field Prior
Frequency Analysis and Sheared Reconstruction for Rendering Motion Blur Kevin Egan Yu-Ting Tseng Nicolas Holzschuch Frédo Durand Ravi Ramamoorthi Columbia.
CIS 681 Distributed Ray Tracing. CIS 681 Anti-Aliasing Graphics as signal processing –Scene description: continuous signal –Sample –digital representation.
CSCE 641: Computer Graphics Image-based Rendering Jinxiang Chai.
Dark Flash Photography Dilip Krishnan Rob Fergus Dept. of Computer Science Courant Institute, New York University.
Basic Ray Tracing CMSC 435/634. Visibility Problem Rendering: converting a model to an image Visibility: deciding which objects (or parts) will appear.
Noise Estimation from a Single Image Ce Liu William T. FreemanRichard Szeliski Sing Bing Kang.
CSCE 441: Computer Graphics Image Filtering Jinxiang Chai.
01/28/05© 2005 University of Wisconsin Last Time Improving Monte Carlo Efficiency.
Automatic Registration of Color Images to 3D Geometry Computer Graphics International 2009 Yunzhen Li and Kok-Lim Low School of Computing National University.
A General Framework for Tracking Multiple People from a Moving Camera
Lecture Exposure/histograms. Exposure - Four Factors A camera is just a box with a hole in it. The correct exposure is determined by four factors: 1.
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.
PRADEE P SEN Pradeep Sen UC Santa Barbara Denoising Your Monte Carlo Renders: Recent Advances in Image-Space Adaptive Sampling and Reconstruction Matthias.
Matthias Zwicker University of Bern Conclusions. Properties of effective filters Exploit auxiliary information from renderer Per-pixel features (normal,
Conclusions 1 STAR documents great progress over last 5-7 years Active area, more than 20 ACM TOG papers since 2010 Recent practical applications.
M. Zwicker Univ. of Bern W. Jarosz Disney Research J. Lehtinen
02/10/03© 2003 University of Wisconsin Last Time Participating Media Assignment 2 –A solution program now exists, so you can preview what your solution.
Computer Science, Software Engineering & Robotics Workshop, FGCU, April 27-28, 2012 Fault Prediction with Particle Filters by David Hatfield mentors: Dr.
Basic Ray Tracing CMSC 435/634. Visibility Problem Rendering: converting a model to an image Visibility: deciding which objects (or parts) will appear.
Fourier Analysis of Stochastic Sampling For Assessing Bias and Variance in Integration Kartic Subr, Jan Kautz University College London.
Real-time Shading with Filtered Importance Sampling Jaroslav Křivánek Czech Technical University in Prague Mark Colbert University of Central Florida.
Why is computer vision difficult?
Fourier Depth of Field Cyril Soler, Kartic Subr, Frédo Durand, Nicolas Holzschuch, François Sillion INRIA, UC Irvine, MIT CSAIL.
SIGGRAPH 2011 ASIA Preview Seminar Rendering: Accuracy and Efficiency Shinichi Yamashita Triaxis Co.,Ltd.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
1 Research Question  Can a vision-based mobile robot  with limited computation and memory,  and rapidly varying camera positions,  operate autonomously.
Orientable Textures for Image- Based Pen-And-Ink Illustration Michael P. Salisbury Michael T. Wong John F. Hughes David A. Salesin SIGGRAPH 1997 Andrea.
A Theory of Monte Carlo Visibility Sampling
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.
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.
Handling Difficult Light Paths (virtual spherical lights) Miloš Hašan UC Berkeley Realistic Rendering with Many-Light Methods.
Extracting Depth and Matte using a Color-Filtered Aperture Yosuke Bando TOSHIBA + The University of Tokyo Bing-Yu Chen National Taiwan University Tomoyuki.
CSCE 641 Computer Graphics: Image-based Rendering (cont.) Jinxiang Chai.
03/04/05© 2005 University of Wisconsin Last Time Tone Reproduction –Histogram method –LCIS and improved filter-based methods.
Texture Synthesis by Image Quilting CS766 Class Project Fall 2004 Eric Robinson.
Global Illumination (3) Path Tracing. Overview Light Transport Notation Path Tracing Photon Mapping.
Noise Filtering in Monte Carlo Rendering
CIS 681 Distributed Ray Tracing. CIS 681 Anti-Aliasing Graphics as signal processing –Scene description: continuous signal –Sample –digital representation.
By: Rachel Yuen, Chad Van De Hey, and Jake Trotman
Basic Ray Tracing CMSC 435/634.
Extended Depth of Field For Long Distance Biometrics
Introduction to Camera
Reconstruction For Rendering distribution Effect
Distributed Ray Tracing
Digital Image Processing
Sampling Theorem told us …
Simple and Robust Iterative Importance Sampling of Virtual Point Lights Iliyan Georgiev Philipp Slusallek.
Homework #3 Environment Lights
Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.
Distributed Ray Tracing
Distributed Ray Tracing
Artistic Rendering Final Project Initial Proposal
Directional Occlusion with Neural Network
Real-time Global Illumination with precomputed probe
Presentation transcript:

PRADEE P SEN Pradeep Sen UC Santa Barbara Denoising Your Monte Carlo Renders: Recent Advances in Image-Space Adaptive Sampling and Reconstruction Matthias Zwicker University of Bern Fabrice Rousselle Disney Research Sung-Eui Yoon KAIST Nima Khademi Kalantari UC Santa Barbara

PRADEE P SEN FILTERING NOISE FROM RANDOM PARAMETERS IN MC RENDERING scene by Luca Cugia

PRADEE P SEN Our key observation MC noise occurs when sample values are functions of random parameters of MC system Desirable scene detail is not a function of these random parameters random parameters

PRADEE P SEN Where varies with respect to, the random values for will produce noise at the output Where is constant with respect to, high frequency content at the output is scene detail Simple illustration x t i – 1/2 1 0 i + 1/2 i – 1/2 i + 1/2

PRADEE P SEN 1,024 samples/pixel16 samples/pixel Example scene by Wojciech Jarosz

PRADEE P SEN Depth of Field (DoF) The same is true for depth of field effects lens image plane scene Color of the ray is not dependent on value of on the lens focal plane Color differences between pixels are scene features, not MC noise

PRADEE P SEN Depth of Field (DoF) The same is true for depth of field effects lens image plane focal plane scene Color of the ray depends on the value of on the lens Color differences between pixels are Monte Carlo noise not scene detail

PRADEE P SEN Depth of Field (DoF) 8 samples/pixel scene by Wojciech Jarosz

PRADEE P SEN Area light sources Glossy reflections Path-tracing This works for other effects Blender distribution scene scene by Luca Cugia models by headus/Rezard

PRADEE P SEN Our key observations MC noise occurs only where sample values are functions of MC random parameters The challenge: how do we identify where this is happening in a general scene from just a few samples?

PRADEE P SEN Our formulation To do this we treat the rendering system as a black box scene function black box implemented by the rendering system f(x,y,u,v) (x,y) (u,v) (x,y) (u,v) sample colors functional dependency? We need a way to estimate this functional dependency

PRADEE P SEN Estimating functional dependency We use mutual information from information theory: Measure of statistical dependence between two random variables

PRADEE P SEN Using mutual information Detects the dependence of the color on the lens position for our simple example 8 samples/pixel dependency of color on lens position (u,v) dark: low statistical dependence bright: high statistical dependence

PRADEE P SEN Our Random Parameter Filter (RPF) Modify bilateral filter using mutual information to control impact of color channels If color is very dependent on random params, it is noise: set (ignore color differences to filter noise) If color is not dependent on random params, set (preserve scene detail)

PRADEE P SEN Results

PRADEE P SEN input rendering (8 samples/pixel) 7.13 secs our result (8 samples/pixel) 4.9 mins Chess scene (DoF + area light) reference (8,192 samples/pixel) 1.2 hrs scene by Wojciech Jarosz

PRADEE P SEN À-Trous filter (8 samples/pixel) Dammertz et al. [2010] our result (8 samples/pixel) Chess scene (DoF + area light) reference (8,192 samples/pixel) scene by Wojciech Jarosz

PRADEE P SEN Toy Gyro scene reference (8,192 samples/pixel) 20 hrs input (8 samples/pixel) 76 secs our result (8 samples/pixel) 15.9 mins scene by Jesper Lloyd

PRADEE P SEN input (8 samples/pixel) 15 secs our result (8 samples/pixel) 1.7 mins Robots scene reference (8,192 samples/pixel) 4 hours scene by Jesper Lloyd

PRADEE P SEN San Miguel scene reference (8,192 samples/pixel) 24.3 hrs input (8 samples/pixel) 1.8 mins our result (8 samples/pixel) 14.8 mins speed up of 100x scene by M. Leal Llaguno

PRADEE P SEN input (8 samples/pixel) 1.8 mins/frame San Miguel scene video (1920 x 1080) scene by M. Leal Llaguno

PRADEE P SEN San Miguel scene video (1920 x 1080) our result (8 samples/pixel) 14.8 mins/frame reference 24.3 hrs/frame [] scene by M. Leal Llaguno

PRADEE P SEN Reflections, 5 years later RPF provides reasonable filter quality at separating noise from scene detail Sample based (not per-pixel), so is expensive at higher sampling rates (slower than later methods) This problem addressed in: Park et al “P-RPF: Pixel-based Random Parameter Filtering for Monte Carlo Rendering” Also, RPF does not minimize the error w.r.t. ground truth directly

PRADEE P SEN The papers P. Sen and S. Darabi, “On Filtering the Noise from the Random Parameters in Monte Carlo Rendering,” ACM Transactions on Graphics, Vol. 31, No. 3, May 2012 (presented at SIGGRAPH 2012) P. Sen and S. Darabi, “Implementation of Random Parameter Filtering,” University of New Mexico Tech. Report ECE-TR , Sep. 2011

PRADEE P SEN Source code available! RPF code available here:

PRADEE P SEN Acknowledgments Student: Soheil Darabi Funding: National Science Foundation IIS