UVA / UNC / JHU Perceptually Guided Simplification of Lit, Textured Meshes Nathaniel WilliamsUNC David LuebkeUVA Jonathan D. CohenJHU Michael KelleyUVA.

Slides:



Advertisements
Similar presentations
Geometry Clipmaps: Terrain Rendering Using Nested Regular Grids
Advertisements

Hongzhi Wu 1,2, Li-Yi Wei 1, Xi Wang 1, and Baining Guo 1 Microsoft Research Asia 1 Fudan University 2 Silhouette Texture.
Contrast-Aware Halftoning Hua Li and David Mould April 22,
Breaking the Frame David Luebke University of Virginia.
Detail to attention: Exploiting Visual Tasks for Selective Rendering Kirsten Cater 1, Alan Chalmers 1 and Greg Ward 2 1 University of Bristol, UK 2 Anyhere.
Introduction to Massive Model Visualization Patrick Cozzi Analytical Graphics, Inc.
View-Dependent Simplification of Arbitrary Polygonal Environments David Luebke.
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
Measuring Simplification Error Jonathan Cohen Computer Science Department Johns Hopkins University
Current Trends in Image Quality Perception Mason Macklem Simon Fraser University
Smooth view-dependent LOD control and its application to terrain rendering Hugues Hoppe Microsoft Research IEEE Visualization 1998.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
New quadric metric for simplifying meshes with appearance attributes Hugues Hoppe Microsoft Research IEEE Visualization 1999 Hugues Hoppe Microsoft Research.
Haptic Rendering using Simplification Comp259 Sung-Eui Yoon.
View-Dependent Refinement of Progressive Meshes Hugues Hoppe Microsoft Research SIGGRAPH 97.
Adaptive Streaming and Rendering of Large Terrains using Strip Masks Joachim Pouderoux and Jean-Eudes Marvie IPARLA Project (LaBRI – INRIA Futurs) University.
1 Displaced Subdivision Surfaces Aaron Lee Princeton University Henry Moreton Nvidia Hugues Hoppe Microsoft Research.
Simplification of Arbitrary Polyhedral Meshes Shaun D. Ramsey* Martin Bertram Charles Hansen University of Utah University of Kaiserslautern University.
Visibility-Guided Simplification Eugene Zhang and Greg Turk GVU Center, College of Computing Georgia Institute of Technology.
Efficient Fitting and Rendering of Large Scattered Data Sets Using Subdivision Surfaces Vincent Scheib 1, Jörg Haber 2, Ming C. Lin 1, Hans-Peter Seidel.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Dynamic View-Dependent Simplification for Polygonal.
Surface Light Fields for 3D Photography Daniel Wood Daniel Azuma Wyvern Aldinger Brian Curless Tom Duchamp David Salesin Werner Stuetzle.
3D Model Simplification (GATE-540)
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Originally presented at: ACM SIGGRAPH 2003 Symposium on Interactive 3D Graphics Interruptible Rendering Joint work with: David Luebke * Benjamin Watson†
Input: Original intensity image. Target intensity image (i.e. a value sketch). Using Value Images to Adjust Intensity in 3D Renderings and Photographs.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Level of Detail David Luebke University of Virginia.
Dynamic Meshing Using Adaptively Sampled Distance Fields
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
Jonathan M Chye Technical Supervisor : Mr Matthew Bett 2010.
Computer Graphics Research at Virginia David Luebke Department of Computer Science.
Level of Detail & Visibility: A Brief Overview David Luebke University of Virginia.
Progressive Mesh in DirectX Seung ho Lee Hyun taek Kwon.
DPL10/16/2015 CS 551/651: Simplification Continued David Luebke
Level of Detail: Choosing and Generating LODs David Luebke University of Virginia.
David Luebke University of Virginia …and other cool graphics stuff.
Levels of Detail COMP 770 3/25/09. Problem Models can be very detailed Look great when close up Last week we explored one way of attacking this problem.
Stylization and Abstraction of Photographs Doug Decarlo and Anthony Santella.
Real-Time Rendering & Game Technology CS 446/651 David Luebke.
Characteristic Point Maps Hongzhi Wu Julie Dorsey Holly Rushmeier (presented by Patrick Paczkowski) Computer Graphics Lab Yale University.
Polygonal Simplification Techniques
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
View-dependent Adaptive Tessellation of Spline Surfaces
Level of Detail Management for Games David Luebke University of Virginia Introduction, Overview.
Radiometric Compensation in a Projector-Camera System Based on the Properties of the Human Visual System Dong WANG, Imari SATO, Takahiro OKABE, and Yoichi.
- Laboratoire d'InfoRmatique en Image et Systèmes d'information
Surround-Adaptive Local Contrast Enhancement for Preserved Detail Perception in HDR Images Geun-Young Lee 1, Sung-Hak Lee 1, Hyuk-Ju Kwon 1, Tae-Wuk Bae.
LODManager A framework for rendering multiresolution models in real-time applications J. Gumbau O. Ripollés M. Chover.
ALGORITHMS FOR POLYGON REDUCTION Author: Ing. Roman Schulz FIT VUT, 2008.
Level of Detail: Generating LODs David Luebke University of Virginia.
Electronic Visualization Laboratory University of Illinois at Chicago “Time-Critical Multiresolution Volume Rendering using 3D Texture Mapping Hardware”
DPL2/10/2016 CS 551/651: Final Review David Luebke
David Luebke2/12/2016 CS 551 / 645: Introductory Computer Graphics David Luebke
Rendering Large Models (in real time)
Render methods. Contents Levels of rendering Wireframe Plain shadow Gouraud Phong Comparison Gouraud-Phong.
Efficient Implementation of Real-Time View-Dependent Multiresolution Meshing Renato Pajarola, Member, IEEE Computer Society Christopher DeCoro, Student.
DPL3/9/2016 CS 551/651: Simplification Continued David Luebke
DPL3/10/2016 CS 551/651: Simplification Continued David Luebke
Advanced Computer Graphics (Spring 2013) Mesh representation, overview of mesh simplification Many slides courtesy Szymon Rusinkiewicz.
Level of Detail: Generating LODs David Luebke University of Virginia.
Real-Time Rendering & Game Technology CS 446/651 David Luebke.
1 Real-Time High-Quality View-dependent Texture Mapping using Per-Pixel Visibility Damien Porquet Jean-Michel Dischler Djamchid Ghazanfarpour MSI Laboratory,
User-Guided Simplification
Level of Detail: A Brief Overview
CS475 3D Game Development Level Of Detail Nodes (LOD)
Meshes.
Chap 10. Geometric Level of Detail
Run-Time LOD Run-time algorithms may use static or dynamic LOD models:
Lark Kwon Choi, Alan Conrad Bovik
Presentation transcript:

UVA / UNC / JHU Perceptually Guided Simplification of Lit, Textured Meshes Nathaniel WilliamsUNC David LuebkeUVA Jonathan D. CohenJHU Michael KelleyUVA Brenden SchubertUVA

UVA / UNC / JHU Motivation: large datasets Scanning Monticello Project In 10 hours we collected 185,000,000 point samples with a scanning laser rangefinder

UVA / UNC / JHU Solution: level of detail Simplify complex models to achieve interactivity 25+ years of active research [Clark 1976]

UVA / UNC / JHU The key issues How should we simplify the data? How should we regulate the level of detail? How should we evaluate the results?

UVA / UNC / JHU Our approach: Perceptually guided simplification Regulate level of detail with a low-level model of human vision Budget-based simplification Unified framework for LOD selection sensitive to ♦ Silhouettes ♦ Texture ♦ Dynamic lighting No parameters to tweak

UVA / UNC / JHU Previous work: Perceptually based graphics Human in the loop ♦ User-guided simplification Li & Watson 2001 Kho & Garland 2003 Pojar & Schmalstieg 2003 ♦ Level of detail evaluation Watson et al O’Sullivan & Dingliana 2001

UVA / UNC / JHU Previous work: Perceptually based graphics Automatic metrics ♦ Global illumination Ramasubramanian et al ♦ LOD frequency content Reddy 1996, 2001 ♦ Image-driven simplification Lindstrom & Turk 2000 ♦ Luebke & Hallen 2001 Focus on “imperceptible simplification” Limited to Gouraud-shaded models with per- vertex color

UVA / UNC / JHU Perceptual model: The contrast sensitivity function Model is based on contrast gratings Spatial Frequency (cycles/degree) Contrast Courtesy of Izumi Ohzawa

UVA / UNC / JHU Perceptual model: The contrast sensitivity function Predicts the threshold perceptibility of a stimulus given its size and contrast Figure courtesy of Martin Reddy

UVA / UNC / JHU Perceptual model: The contrast sensitivity function Following Luebke & Hallen 2001, we liken local simplification operations to a worst-case contrast grating We calculate ♦ Maximum Michelson contrast ♦ Minimum spatial frequency

UVA / UNC / JHU Maximum Michelson contrast Y min Y max

UVA / UNC / JHU Minimum spatial frequency Ф r

UVA / UNC / JHU Texture deviation Distance between corresponding 3D points through P mesh M i mesh M i+1 2D texture domain (i+1) st edge collapse XiXiXiXi X i+1 x P

UVA / UNC / JHU Texture deviation Improved bound on the size of features altered by simplification

UVA / UNC / JHU The Multi-Triangulation Directed acyclic graph ♦ Nodes Edge collapse operations ♦ Arcs Node dependencies Mesh triangles Triangles are explicitly represented ♦ Good for preprocessing

UVA / UNC / JHU Preprocessing Augment each Multi-Triangulation node with additional information ♦ Parametric texture deviation ♦ Minimum bounding sphere ♦ Texture luminance Y min and Y max ♦ Normal cone for silhouette test ♦ Normal cone for illumination test

UVA / UNC / JHU Run-time simplification Simplification to a triangle budget Dual-queue approach ♦ ROAM [Duchaineau et al. 1997] ♦ Start with cut from previous frame ♦ Exploit temporal coherence Calculate perceptual error of nodes given the current viewing frustum

UVA / UNC / JHU Silhouette contrast We determine a node’s silhouette status with the normal cone ♦ Luebke & Erikson 1997 We conservatively assume that silhouette nodes have maximal contrast

UVA / UNC / JHU Illumination contrast Diffuse Specular

UVA / UNC / JHU Demonstration Show Video

UVA / UNC / JHU Evaluation Perceptually motivated image metric ♦ ltdiff [Lindstrom 2000] Comparison to a Multi-Triangulation based implementation of Appearance Preserving Simplification ♦ Cohen et al. 1998

UVA / UNC / JHU Results 500,000 triangle armadillo with per-vertex normals

UVA / UNC / JHU Results: 98% simplified Screen-space Error: 3,689 Perceptually guided Error: 3,123 Error Low High

UVA / UNC / JHU Results: memory usage 500,000 triangle armadillo Memory Original model13.6 MB Multi-Triangulation66.3 MB Perceptually Guided74.9 MB

UVA / UNC / JHU Discussion: Pros Unified framework for interactive rendering ♦ Based on perceptual metric (CSF) ♦ Sensitive to texture, illumination, and silhouettes ♦ Parameter-free No tweaking required!

UVA / UNC / JHU Discussion: Cons View-dependent LOD is costly ♦ Increased memory requirements ♦ Higher CPU load ♦ Less well suited for current GPUs Summary: high fidelity, automatic simplification…for a price

UVA / UNC / JHU Future work Improved perceptual models ♦ Supra-threshold contrast sensitivity ♦ Visual masking using texture content ♦ Eccentricity & velocity MIP-map filtering ♦ Critical for terrain models User studies

UVA / UNC / JHU Acknowledgements People ♦ Peter Lindstrom ♦ Martin Reddy Funding ♦ National Science Foundation Images and models: ♦ Stanford 3-D Scanning Repository for the Bunny ♦ Caltech for the Armadillo ♦ Martin Reddy for CSF plot ♦ Campbell-Robson Chart by Izumi Ohzawa

UVA / UNC / JHU The End