Frequency Analysis and Sheared Reconstruction for Rendering Motion Blur Kevin Egan Yu-Ting Tseng Nicolas Holzschuch Frédo Durand Ravi Ramamoorthi Columbia.

Slides:



Advertisements
Similar presentations
Stupid OpenGL Shader Tricks
Advertisements

Anisotropic Noise Alex Goldberg Matthias ZwickerFrédo Durand University of California, San DiegoMIT CSAIL PixelActive Inc.
Sampling and Reconstruction
Multidimensional Lightcuts Bruce Walter Adam Arbree Kavita Bala Donald P. Greenberg Program of Computer Graphics, Cornell University.
11/11/02 IDR Workshop Dealing With Location Uncertainty in Images Hasan F. Ates Princeton University 11/11/02.
Ray Tracing CMSC 635. Basic idea How many intersections?  Pixels  ~10 3 to ~10 7  Rays per Pixel  1 to ~10  Primitives  ~10 to ~10 7  Every ray.
Chunhui Yao 1 Bin Wang 1 Bin Chan 2 Junhai Yong 1 Jean-Claude Paul 3,1 1 Tsinghua University, China 2 The University of Hong Kong, China 3 INRIA, France.
Spherical Convolution in Computer Graphics and Vision Ravi Ramamoorthi Columbia Vision and Graphics Center Columbia University SIAM Imaging Science Conference:
Light Fields PROPERTIES AND APPLICATIONS. Outline  What are light fields  Acquisition of light fields  from a 3D scene  from a real world scene 
MIT EECS 6.837, Durand and Cutler Sampling, Aliasing, & Mipmaps.
Scalability with many lights II (row-column sampling, visibity clustering) Miloš Hašan.
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.
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi Some slides.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lectures 18, 19: Monte Carlo Integration Ravi Ramamoorthi Acknowledgements.
1 MURI review meeting 09/21/2004 Dynamic Scene Modeling Video and Image Processing Lab University of California, Berkeley Christian Frueh Avideh Zakhor.
Efficient Image-Based Methods for Rendering Soft Shadows
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 17: Frequency Analysis and Signal Processing for Rendering Ravi Ramamoorthi
University of British Columbia CPSC 414 Computer Graphics © Tamara Munzner 1 Sampling Week 7, Fri 17 Oct 2003 p1 demos sampling.
Linear View Synthesis Using a Dimensionality Gap Light Field Prior
A Theory of Locally Low Dimensional Light Transport Dhruv Mahajan (Columbia University) Ira Kemelmacher-Shlizerman (Weizmann Institute) Ravi Ramamoorthi.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
CIS 681 Distributed Ray Tracing. CIS 681 Anti-Aliasing Graphics as signal processing –Scene description: continuous signal –Sample –digital representation.
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.
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 3 Ravi Ramamoorthi
Titre.
© 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.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Ray Tracing Primer Ref: SIGGRAPH HyperGraphHyperGraph.
Antialiasing with Line Samples Thouis R. Jones, Ronald N. Perry MERL - Mitsubishi Electric Research Laboratory.
Introduction to Computational Photography. Computational Photography Digital Camera What is Computational Photography? Second breakthrough by IT First.
Computer Graphics An Introduction. What’s this course all about? 06/10/2015 Lecture 1 2 We will cover… Graphics programming and algorithms Graphics data.
Project Raytracing. Content Goals Idea of Raytracing Ray Casting – Therory – Practice Raytracing – Theory – Light model – Practice Output images Conclusion.
Matthias Zwicker University of Bern Conclusions. Properties of effective filters Exploit auxiliary information from renderer Per-pixel features (normal,
PRADEE P SEN Pradeep Sen UC Santa Barbara Denoising Your Monte Carlo Renders: Recent Advances in Image-Space Adaptive Sampling and Reconstruction Matthias.
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.
A Frequency Analysis of Light Transport Fr é do Durand – MIT CSAIL With Nicolas Holzschuch, Cyril Soler, Eric Chan & Francois Sillion Artis Gravir/Imag-Inria.
All-Frequency Shadows Using Non-linear Wavelet Lighting Approximation Ren Ng Stanford Ravi Ramamoorthi Columbia SIGGRAPH 2003 Pat Hanrahan Stanford.
Fourier Depth of Field Cyril Soler, Kartic Subr, Frédo Durand, Nicolas Holzschuch, François Sillion INRIA, UC Irvine, MIT CSAIL.
Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.
SIGGRAPH 2011 ASIA Preview Seminar Rendering: Accuracy and Efficiency Shinichi Yamashita Triaxis Co.,Ltd.
CSE 681 DISTRIBUTED RAY TRACING some implementation notes.
- Laboratoire d'InfoRmatique en Image et Systèmes d'information
H M V Amortized Supersampling Dec. 18, 2009, Pacifico Yokohama, Japan L EI Y ANG H, D IEGO N EHAB M, P EDRO V. S ANDER H, P ITCHAYA S ITTHI - AMORN V,
University of Montreal & iMAGIS A Light Hierarchy for Fast Rendering of Scenes with Many Lights E. Paquette, P. Poulin, and G. Drettakis.
Pixmotor: A Pixel Motion Integrator Ivan Neulander Rhythm & Hues.
A Theory of Monte Carlo Visibility Sampling
Ray Tracing Fall, Introduction Simple idea  Forward Mapping  Natural phenomenon infinite number of rays from light source to object to viewer.
2D Sampling Goal: Represent a 2D function by a finite set of points.
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
Thank you for the introduction
Painterly Rendering for Animation Introduction speaks of focus and detail –Small brush strokes focus and provide detail –Large strokes are abstract and.
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.
1cs426-winter-2008 Notes. 2 Atop operation  Image 1 “atop” image 2  Assume independence of sub-pixel structure So for each final pixel, a fraction alpha.
CIS 681 Distributed Ray Tracing. CIS 681 Anti-Aliasing Graphics as signal processing –Scene description: continuous signal –Sample –digital representation.
Basic Ray Tracing CMSC 435/634.
Advanced Computer Graphics
Reconstruction For Rendering distribution Effect
Distributed Ray Tracing
Sampling and Antialiasing
Antialiasing Dr. Scott Schaefer.
(c) 2002 University of Wisconsin
Distributed Ray Tracing
Distributed Ray Tracing
Distributed Ray Tracing
Presentation transcript:

Frequency Analysis and Sheared Reconstruction for Rendering Motion Blur Kevin Egan Yu-Ting Tseng Nicolas Holzschuch Frédo Durand Ravi Ramamoorthi Columbia University Grenoble University MIT CSAIL University of California, Berkeley

Overview  Introduction Overview of Frequency Analysis Sampling and Sheared Filter Implementation Results

Motion Blur Objects move while camera shutter is open – Image is “blurred” over time Expensive for special effects Necessary to remove “strobing” in animations

Garfield: A Tail of Two Kitties Rhythm & Hues Studios Twentieth Century-Fox Film Corporation

The Incredibles Pixar Animation Studios Walt Disney Pictures

A Simple Approach For each pixel – Sample many different moments in time t = 1.00 t = 0.75 t = 0.50 t = 0.25 t = 0.00 t  [0.0, 1.0]

A Simple Approach The simple approach is expensive Can we do better?

Observation Motion blur is expensive Motion blur removes spatial complexity

Standard Method Use axis-aligned pixel filter at each pixel Requires many samples SPACE TIME space-time samples axis-aligned filter

Our Method Use a different filter shape at each pixel Filter sheared in space-time Fewer samples and faster renders SPACE TIME space-time samples sheared filter

Previous Work Plenoptic Sampling Chai et al., 2000 Sheared reconstruction filter in space-angle A Frequency Analysis of Light Transport Durand et al., 2005 Analysis of transport, reflection and occlusion We extend both to space-time

Previous Work Multidimensional Adaptive Sampling Hachisuka et al., 2008 Anisotropic reconstruction based on contrast Our method based on local freq estimates Spatial Anti-Aliasing for Animation Sequences with Spatio-Temporal Filtering Shinya, 1993 Sheared filter across multiple images We use speed bounds, derive sampling rates

Overview Introduction  Overview of Frequency Analysis Sampling and Sheared Filter Implementation Results

Space-Time Analysis Goals Uniform motion leads to sparse freq content Analyze shutter filter’s effect on freq content Design a filter customized to freq content

Basic Example Object not moving x y SPACE f(x, y)f(x, t) Space-time graph TIME

Basic Example x y t x f(x, t) Low velocity, t  [ 0.0, 1.0 ] f(x, y)

Basic Example x y t x f(x, t) High velocity, t  [ 0.0, 1.0 ] f(x, y)

Shear in Space-Time x y t x f(x, t) Object moving with low velocity f(x, y) shear

Large Shear in Space-Time x y t x Object moving with high velocity f(x, y)f(x, t)

Shear in Space-Time Object moving away from camera x y t x f(x, y)f(x, t)

Camera Shutter Filter Applying shutter blurs across time x y t x f(x, y)f(x, t)

Basic Example – Fourier Domain Fourier spectrum, zero velocity t x f(x, t)F(Ω x, Ω t ) texture bandwidth ΩtΩt ΩxΩx

Basic Example – Fourier Domain Low velocity, small shear in both domains f(x, t)F(Ω x, Ω t ) t x slope = -speed ΩtΩt ΩxΩx

Basic Example – Fourier Domain Large shear f(x, t)F(Ω x, Ω t ) t x ΩtΩt ΩxΩx

Basic Example – Fourier Domain Non-linear motion, wedge shaped spectra f(x, t) ΩtΩt ΩxΩx F(Ω x, Ω t ) t x shutter bandlimits in time -min speed -max speed shutter applies blur across time indirectly bandlimits in space

Main Insights Common case = double wedge spectra Shutter indirectly removes spatial freqs Moving reflections and shadows in paper ΩtΩt ΩxΩx double wedge spectrummoving reflection

Overview Introduction and Simple Example Overview of Frequency Analysis  Sampling and Sheared Filter Implementation Results

Sampling and Filtering Goals Minimal sampling rates to prevent aliasing Derive shape of new reconstruction filter

Sampling in Fourier Domain ΩtΩt ΩxΩx t x Sampling produces replicas in Fourier domain Sparse sampling produces dense replicas Fourier DomainSpace-Time Domain

Standard Reconstruction Filtering Standard filter, dense sampling (slow) ΩtΩt no aliasing ΩxΩx Fourier Domain replicas

Standard Reconstruction Filter Standard filter, sparse sampling (fast) ΩtΩt aliasing ΩxΩx Fourier Domain

Sheared Reconstruction Filter Our sheared filter, sparse sampling (fast) ΩtΩt ΩxΩx No aliasing! Fourier Domain

Sheared Reconstruction Filter Compact shape in Fourier = wide space-time t x Space-Time Domain ΩtΩt ΩxΩx Fourier Domain

Main Insights Sheared filter allows for many fewer samples Paper derives sampling rates – for constant velocity same cost as a static image

Overview Introduction Overview of Frequency Analysis Sampling and Sheared Filter  Implementation Results

Our Method 1. Compute bounds for signal speeds 2. Compute filter shapes and sampling rates 3. Render samples and reconstruct image

Car Example staticmotion blurred

Implementation: Stage 1 Sparse sampling to compute velocity bounds max speedmin speed

Implementation: Stage 2 Calculate filter widths and sampling rates filter width max speed min speed

Implementation: Stage 2 Uniform velocities, wide filter, low samples filter width max speed min speed

Implementation: Stage 2 Static surface, small filter, low samples filter width max speed min speed

Implementation: Stage 2 Varying velocities, small filter, high samples filter width max speed min speed

Implementation: Stage 2 Then compute sampling densities samples per pixel Uniform velocities = low sample count

Implementation: Stage 2 Then compute sampling densities samples per pixel Varying velocities = high sample count

Implementation: Stage 3 Render sample locations in space-time Apply wide sheared filters to nearby samples t x sheared filter overlaps samples in multiple pixels pixels

Implementation: Stage 3 Filters stretched along direction of motion Preserve frequencies orthogonal to motion filter shapes

Overview Introduction Overview of Frequency Analysis Sheared Filter Implementation  Results

Car Scene Stratified Sampling 4 samples per pixel Our Method, 4 samples per pixel

Car Scene Stratified Sampling 4 samples per pixel Our Method, 4 samples per pixel

Car Scene Inset MDAS 4 samples / pix Our Method 4 samples / pix Ground Truth

Car Scene Inset MDAS 4 samples / pix Our Method 4 samples / pix Ground Truth

Ballerina Video

Ballerina Stills

Ballerina Inset Stratified 16 samples / pix 4 min 2 sec Our Method 8 samples / pix 3 min 57 sec Stratified 64 samples / pix 14 min 25 sec Equal TimeEqual Quality

Teapot Scene Our Method 8 samples / pix motion blurred reflection

Limitations Currently filter along line segments Initial sampling may miss motion Need to calculate speed and bandlimits Multiple texture / reflection / shadow signals

Conclusion Derivation of filter shape and sampling rates conservative min/max bounds for speed packing spectra as tightly as possible Implementation of sheared filter No explicit representation for spectrum Easily added to existing rendering pipelines Faster render times Space-time Fourier theory for rendering Double wedge shape using min/max bounds Analysis of shutter filter

Acknowledgements Funding Agencies ONR, NSF, Microsoft, Sloan Foundation, INRIA, LJK Equipment and Licenses Pixar, Intel, NVIDIA

Questions? t x sampling rate

Previous Work Distributed Ray Tracing, Cook et al., 1984 Sampling across image, time and lens The Reyes Image Rendering Architecture, Cook et al., 1987 Separate shading from visibility

Implementation: Stage 3 t x Narrow filter, low sample count filter width

Implementation: Stage 3 t x Wide filter, low sample count filter width

Implementation: Stage 3 t x Narrow filter, high sample count filter width