FastLSM: Fast Lattice Shape Matching for Robust Real-Time Deformation

Slides:



Advertisements
Similar presentations
Image Segmentation with Level Sets Group reading
Advertisements

Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
Multilevel Streaming for Out-of-Core Surface Reconstruction
Surface Compression with Geometric Bandelets Gabriel Peyré Stéphane Mallat.
CSE554Extrinsic DeformationsSlide 1 CSE 554 Lecture 10: Extrinsic Deformations Fall 2014.
Cubic Curves CSE167: Computer Graphics Instructor: Steve Rotenberg UCSD, Fall 2006.
Extended Gaussian Images
Accelerating Spatially Varying Gaussian Filters Jongmin Baek and David E. Jacobs Stanford University.
Low Complexity Keypoint Recognition and Pose Estimation Vincent Lepetit.
Computing 3D Geometry Directly From Range Images Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
1cs533d-winter-2005 Notes  Please read O'Brien and Hodgins, "Graphical modeling and animation of brittle fracture", SIGGRAPH '99 O'Brien, Bargteil and.
Error Analysis for Material Point Method and a case study from Gas Dynamics Le-Thuy Tran and Martin Berzins Thanks to DOE for funding from
Real-time Embedded Face Recognition for Smart Home Fei Zuo, Student Member, IEEE, Peter H. N. de With, Senior Member, IEEE.
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
Spectral bases for 3D shapes representation. Spectral bases – reminder Last week we spoke of Fourier analysis  1D sine/cosine bases for signals:
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 23: Physical Simulation 2 Ravi Ramamoorthi Most slides.
A Study of Approaches for Object Recognition
1cs533d-winter-2005 Notes. 2 Simplifications of Elasticity.
Niloy J. Mitra1, Natasha Gelfand1, Helmut Pottmann2, Leonidas J
1cs426-winter-2008 Notes  Collision notes part 1 (primitive operations) should be up on the weekend.
Non-Euclidean Embedding
Goal: Fast and Robust Velocity Estimation P1P1 P2P2 P3P3 P4P4 Our Approach: Alignment Probability ●Spatial Distance ●Color Distance (if available) ●Probability.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Physically Based Animation.
Lecture VII Rigid Body Dynamics CS274: Computer Animation and Simulation.
FastLSM: Fast Lattice Shape Matching for Robust Real-Time Deformation Alec RiversDoug James Cornell University.
Computer Graphics Group Tobias Weyand Mesh-Based Inverse Kinematics Sumner et al 2005 presented by Tobias Weyand.
UT DALLAS Erik Jonsson School of Engineering & Computer Science FEARLESS engineering Stable Real-Time Deformations Authors: Matthias Muller, Julie Dorsey,
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
A Method for Registration of 3D Surfaces ICP Algorithm
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
1 G Lect 6W Polynomial example Orthogonal polynomials Statistical power for regression G Multiple Regression Week 6 (Wednesday)
CS559: Computer Graphics Lecture 24: Shape Modeling Li Zhang Spring 2010.
Semi-regular 3D mesh progressive compression and transmission based on an adaptive wavelet decomposition 21 st January 2009 Wavelet Applications in Industrial.
Visual SLAM Visual SLAM SPL Seminar (Fri) Young Ki Baik Computer Vision Lab.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
AS-RIGID-AS-POSSIBLE SHAPE MANIPULATION
Efficient Raytracing of Deforming Point-Sampled Surfaces Mark Pauly Leonidas J. Guibas Bart Adams Philip Dutré Richard Keiser Markus Gross.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
Hierarchical Error-Driven Approximation of Implicit Surfaces from Polygonal Meshes Takashi Kanai Yutaka Ohtake Kiwamu Kase University of Tokyo RIKEN, VCAD.
Skuller: A volumetric shape registration algorithm for modeling skull deformities Yusuf Sahillioğlu 1 and Ladislav Kavan 2 Medical Image Analysis 2015.
Flexible Automatic Motion Blending with Registration Curves
CS274 Spring 01 Lecture 7 Copyright © Mark Meyer Lecture VII Rigid Body Dynamics CS274: Computer Animation and Simulation.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Advisor : Ku-Yaw Chang Speaker : Ren-Li Shen /6/12.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
CS559: Computer Graphics Lecture 33: Shape Modeling Li Zhang Spring 2008.
Slide 1Lecture Fall ‘00 Surface Modeling Types: Polygon surfaces Curved surfaces Volumes Generating models: Interactive Procedural.
UNC Chapel Hill David A. O’Brien Automatic Simplification of Particle System Dynamics David O’Brien Susan Fisher Ming C. Lin Department of Computer Science.
1 The Method of Precomputing Triangle Clusters for Quick BVH Builder and Accelerated Ray Tracing Kirill Garanzha Department of Software for Computers Bauman.
Interactive Rendering of Translucent Deformable Objects Tom Mertens 1, Jan Kautz 2, Philippe Bekaert 1, Hans-Peter Seidel 2, Frank Van Reeth
Particle Animation and Rendering Using Data Parallel Computation Karl Sims Optomystic Thinking Machines Corporation Presentation ©2001 Brenden Schubert.
A novel approach to visualizing dark matter simulations
Dense-Region Based Compact Data Cube
Scale Invariant Feature Transform (SIFT)
Lecture Rigid Body Dynamics.
Le-Thuy Tran and Martin Berzins
Morphing and Shape Processing
You can check broken videos in this slide here :
Object Recognition in the Dynamic Link Architecture
Domain-Modeling Techniques
Online Graph-Based Tracking
Real-time Procedural Volumetric Fire
Find the velocity of a particle with the given position function
CSE 554 Lecture 10: Extrinsic Deformations
Computer Animation Algorithms and Techniques
CENG 789 – Digital Geometry Processing 11- Least-Squares Solutions
Simplification of Articulated Mesh
Presentation transcript:

FastLSM: Fast Lattice Shape Matching for Robust Real-Time Deformation Alec R. Rivers and Doug L. James Cornell University Presenter: 이성호

Prior work: Meshless Deformations Based on Shape Matching

Best fit Rigid Transformation Q: What can be precomputed?

Best fit Rigid Transformation Q: Which is the generalized one, between R and A? Q: Prove the solution of A

Extracting Rotation

Particles position and velocities update

Linear shape matching

Linear shape matching

Quadratic shape matching

Best fit quadratic transformation Q: Could it be precomputed Apq and/or Aqq, and what dimensions they are?

Cluster Based Deformation

FastLSM

Approach

Assumptions Construct regular lattice of cubic cells containing mesh [James et al. 2004]

Computational cost

Naive sum

Bar-plate-cube sum

Constant-time sum

Center of mass

Rotations

Goal positions Q: Prove this. (Recall in [Mueller et al. 2005], p6)

Pseudocode

Fast polar decomposition Cold start (V=I) 1.9 Jacobi sweeps/solution 2500ns/decomposition Warm start (V=V from the last timestep) 0.4 Jacobi sweeps/solution 450ns/decomposition (Refer to p5)

Damping From [Mueller et al. 2006] Apply damping per-region basis (See demo)

Fracture Break by distance [Terzopoulos and Fleischer 1988]

Hardware-accelerated rendering

Per-vertex normals Precompute per each vertex

Constant memory restirction Construct triangle batches

Statistics

Conclusion and Discussion Lattice Shape Matching Fast summation algorithm Allows large deformation Maintaining speed and simplicity Orientation sensitive smoothing Not physically accurate But reasonably plausible and fast Future works Try different particle frameworks Tetrahedral, irregular samplings Adaptive particle resolution