Breaking the Frame David Luebke University of Virginia.

Slides:



Advertisements
Similar presentations
Accelerating Real-Time Shading with Reverse Reprojection Caching Diego Nehab 1 Pedro V. Sander 2 Jason Lawrence 3 Natalya Tatarchuk 4 John R. Isidoro 4.
Advertisements

Sven Woop Computer Graphics Lab Saarland University
Interactive Rendering using the Render Cache Bruce Walter, George Drettakis iMAGIS*-GRAVIR/IMAG-INRIA Steven Parker University of Utah *iMAGIS is a joint.
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.
High-Resolution Three- Dimensional Sensing of Fast Deforming Objects Philip Fong Florian Buron Stanford University This work supported by:
GI 2006, Québec, June 9th 2006 Implementing the Render Cache and the Edge-and-Point Image on Graphics Hardware Edgar Velázquez-Armendáriz Eugene Lee Bruce.
Reusing Pixels for Interactive Global Illumination Bruce Walter Cornell University.
Render Cache John Tran CS851 - Interactive Ray Tracing February 5, 2003.
Week 10 - Monday.  What did we talk about last time?  Global illumination  Shadows  Projection shadows  Soft shadows.
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.
Anton S. Kaplanyan Karlsruhe Institute of Technology, Germany Path Space Regularization Framework.
David Luebke1/19/99 CS 551/651: Advanced Computer Graphics David Luebke
Splatting Josh Anon Advanced Graphics 1/29/02. Types of Rendering Algorithms Backward mapping Image plane mapped into data Ray casting Forward mapping.
Efficient Image-Based Methods for Rendering Soft Shadows
3D Graphics Processor Architecture Victor Moya. PhD Project Research on architecture improvements for future Graphic Processor Units (GPUs). Research.
Enhancing and Optimizing the Render Cache Bruce Walter Cornell Program of Computer Graphics George Drettakis REVES/INRIA Sophia-Antipolis Donald P. Greenberg.
High Dynamic Range Imaging: Spatially Varying Pixel Exposures Shree K. Nayar, Tomoo Mitsunaga CPSC 643 Presentation # 2 Brien Flewelling March 4 th, 2009.
Visualization Enhancements of Dense Particle Data Sets James L. Bigler School of Computing University of Utah November 8, 2004.
Vertices and Fragments III Mohan Sridharan Based on slides created by Edward Angel 1 CS4395: Computer Graphics.
CSCE 641: Computer Graphics Image-based Rendering Jinxiang Chai.
Originally presented at: ACM SIGGRAPH 2003 Symposium on Interactive 3D Graphics Interruptible Rendering Joint work with: David Luebke * Benjamin Watson†
Erdem Alpay Ala Nawaiseh. Why Shadows? Real world has shadows More control of the game’s feel  dramatic effects  spooky effects Without shadows the.
Image Processing 고려대학교 컴퓨터 그래픽스 연구실 cgvr.korea.ac.kr.
Ray Tracing Primer Ref: SIGGRAPH HyperGraphHyperGraph.
Interactive Ray Tracing: From bad joke to old news David Luebke University of Virginia.
© Copyright Khronos Group, Page 1 Harnessing the Horsepower of OpenGL ES Hardware Acceleration Rob Simpson, Bitboys Oy.
Chapter 10: Computer Graphics
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 10: Computer Graphics Computer Science: An Overview Tenth Edition.
Dynamically Reparameterized Light Fields Aaron Isaksen, Leonard McMillan (MIT), Steven Gortler (Harvard) Siggraph 2000 Presented by Orion Sky Lawlor cs497yzy.
Interactive Time-Dependent Tone Mapping Using Programmable Graphics Hardware Nolan GoodnightGreg HumphreysCliff WoolleyRui Wang University of Virginia.
Cg Programming Mapping Computational Concepts to GPUs.
Reconstructing 3D mesh from video image sequences supervisor : Mgr. Martin Samuelčik by Martin Bujňák specifications Master thesis
Image-based rendering Michael F. Cohen Microsoft Research.
Interactive Ray Tracing CS 851 David Luebke University of Virginia.
Efficient Rendering of Local Subsurface Scattering Tom Mertens 1, Jan Kautz 2, Philippe Bekaert 1, Frank Van Reeth 1, Hans-Peter Seidel
Image Processing and Sampling
Stream Processing Main References: “Comparing Reyes and OpenGL on a Stream Architecture”, 2002 “Polygon Rendering on a Stream Architecture”, 2000 Department.
Tone Mapping on GPUs Cliff Woolley University of Virginia Slides courtesy Nolan Goodnight.
All-Frequency Shadows Using Non-linear Wavelet Lighting Approximation Ren Ng Stanford Ravi Ramamoorthi Columbia SIGGRAPH 2003 Pat Hanrahan Stanford.
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.
Rendering Fake Soft Shadows with Smoothies Eric Chan Massachusetts Institute of Technology.
Department of Computer Science 1 Beyond CUDA/GPUs and Future Graphics Architectures Karu Sankaralingam University of Wisconsin-Madison Adapted from “Toward.
David Luebke11/26/2015 CS 551 / 645: Introductory Computer Graphics David Luebke
03/15/03© 2005 University of Wisconsin Where We’ve Been Photo-realistic rendering –Accurate modeling and rendering of light transport and surface reflectance.
04/23/03© 2003 University of Wisconsin Where We’ve Been Photo-realistic rendering –Accurate modeling and rendering of light transport and surface reflectance.
- Laboratoire d'InfoRmatique en Image et Systèmes d'information
Subject Name: Computer Graphics Subject Code: Textbook: “Computer Graphics”, C Version By Hearn and Baker Credits: 6 1.
Partitioning Screen Space 2 Rui Wang. Architectural Implications of Hardware- Accelerated Bucket Rendering on the PC (97’) Dynamic Load Balancing for.
Ray Tracing II. HW1 Part A due October 10 Camera module Object module –Read from a file –Sphere and Light only Ray tracer module: –No shading. No reflection.
02/12/03© 2003 University of Wisconsin Last Time Intro to Monte-Carlo methods Probability.
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.
Compact, Fast and Robust Grids for Ray Tracing Ares Lagae & Philip Dutré 19 th Eurographics Symposium on Rendering EGSR 2008Wednesday, June 25th.
High Resolution Surface Reconstruction from Overlapping Multiple-Views
Thank you for the introduction
DPL2/10/2016 CS 551/651: Final Review David Luebke
CS559: Computer Graphics Lecture 36: Raytracing Li Zhang Spring 2008 Many Slides are from Hua Zhong at CUM, Paul Debevec at USC.
David Luebke 3/17/2016 Advanced Computer Graphics Antialiasing David Luebke
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.
Deep Predictive Model for Autonomous Driving
Combining Edges and Points for Interactive High-Quality Rendering
Image Processing and Sampling
Reconstruction For Rendering distribution Effect
Sampling and Antialiasing
Hybrid Ray Tracing of Massive Models
Real-time Rendering Shadow Maps
Visibility Computations
UMBC Graphics for Games
Accelerating Real-Time Shading with Reverse Reprojection Caching
Presentation transcript:

Breaking the Frame David Luebke University of Virginia

Graphics Hardware 2005: Evolution or Revolution? Frameless Rendering Technique: [Bishop et al Implementation & Video[Parker et al. 1999]Video Codec: huffYUV [dll] [inf]dllinf

Graphics Hardware 2005: Evolution or Revolution? Overview: What We’re Doing Spatio-temporally adaptive frameless sampling –Prioritize sampling towards regions of greater change Spatial change: edges Temporal change: motion Reconstruction of resulting samples –A “deep buffer” stores samples in time & space –Reconstruct image at front edge of time: apply filter kernel with varying width in space and time

Graphics Hardware 2005: Evolution or Revolution? Static scenes/regions –Old samples useful, use them to sharpen/antialias –Temporal width should dominate Dynamic scenes/regions –New samples useful, old samples stale –Emphasize new samples even if image is less sharp –Spatial width should dominate Temporally Adaptive Reconstruction

“Traditional” frameless Adaptive frameless Adaptive Frameless Rendering [Dayal et al., EGSR05] Video Preview

Graphics Hardware 2005: Evolution or Revolution? Summary Better than traditional frameless rendering Better than traditional framed rendering! –Frameless = ungridded temporal sampling  lower latency –Samples when and where needed  better images at low sampling rates –Antialiases static regions by incorporating old samples  lower error even than 10x sampling rate Still in simulation

Discussion: Asynchronous Graphics What if reconstruction was part of display? –Imagine display as systolic array of pixels –Input: stream of samples, not sequence of images Enables asynchronous parallel graphics –Parallel graphics frameworks share common constraint: must ultimately combine all results into a single frame –Breaking the frame also breaks underlying assumption and constraint in parallel graphics! See SIGGRAPH Panel “The Ultimate Display” –Punchline: Refreshing every pixel every time = Bad Idea

The End Acknowledgements: OpenRT Interactive Raytracing Project BART ray tracing benchmark Stanford 3D Scanning Repository National Science Foundation awards , , and

Graphics Hardware 2005: Evolution or Revolution? SamplerReconstructor Controller Deep Buffer Ray Tracer Adaptive Filter Bank Deep Buffer samples variation, gradients image locations samples tiling, view, gradients SamplerReconstructor Controller Deep Buffer Ray Tracer Adaptive Filter Bank Deep Buffer samples variation, gradients image locations samples tiling, view, gradients System overview

static scenedynamic scene Temporally Adaptive Reconstruction

static scenedynamic scene Comparison: Traditional Frameless

Graphics Hardware 2005: Evolution or Revolution? Discussion: Coherence What about coherence? –Frameless rendering implicitly gives up spatial coherence, which is big win for fast ray tracers Partially ameliorate with tiled structure, gradient rays Might need to organize “random” samples around memory –But we gain temporal coherence! Fewer samples: needn’t resample everywhere every frame Can we design a parallel architecture around this temporal coherence?

Graphics Hardware 2005: Evolution or Revolution? Comparison: Render Cache Probably most closely related approach –Sampling based on (framed) priority image Biased toward old & undersampled regions –Killing off old samples also biases towards age –Semantic “hints” age some samples quicker (e.g. specular surfaces) –Temporal response by aging samples if new one detects variance Error diffusion dither to place samples within image –Image-space reconstruction via (non-adaptive) filtering 7x7 “prefilter” followed by 3x3 Gaussian Depth culling helps with occlusions –See [Walter et al 1999]

Graphics Hardware 2005: Evolution or Revolution? Evaluation: Mostly Dynamic

Graphics Hardware 2005: Evolution or Revolution? Evaluation: Mostly Static