Andrei Sharf Dan A. Alcantara Thomas Lewiner Chen Greif Alla Sheffer Nina Amenta Daniel Cohen-Or Space-time Surface Reconstruction using Incompressible.

Slides:



Advertisements
Similar presentations
Multi-view Stereo via Volumetric Graph-cuts George Vogiatzis, Philip H. S. Torr Roberto Cipolla.
Advertisements

CISC 489/689 Spring 2009 University of Delaware
Parameterizing a Geometry using the COMSOL Moving Mesh Feature
L1 sparse reconstruction of sharp point set surfaces
As-Rigid-As-Possible Surface Modeling
Multilevel Streaming for Out-of-Core Surface Reconstruction
A Discrete Adjoint-Based Approach for Optimization Problems on 3D Unstructured Meshes Dimitri J. Mavriplis Department of Mechanical Engineering University.
Investigation Into Optical Flow Problem in the Presence of Spatially-varying Motion Blur Mohammad Hossein Daraei June 2014 University.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2013 – 12269: Continuous Solution for Boundary Value Problems.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2014 – 35148: Continuous Solution for Boundary Value Problems.
Algorithm Development for the Full Two-Fluid Plasma System
SGP 2008 A Local/Global Approach to Mesh Parameterization Ligang Liu Lei Zhang Yin Xu Zhejiang University, China Craig Gotsman Technion, Israel Steven.
Closest Point Transform: The Characteristics/Scan Conversion Algorithm Sean Mauch Caltech April, 2003.
Robust Global Registration Natasha Gelfand Niloy Mitra Leonidas Guibas Helmut Pottmann.
Patch-based Image Deconvolution via Joint Modeling of Sparse Priors Chao Jia and Brian L. Evans The University of Texas at Austin 12 Sep
1.  Texturing is a core process for modeling surface details in computer graphics applications › Texture mapping › Surface texture synthesis › Procedural.
Modeling the Shape of People from 3D Range Scans
Lectures on CFD Fundamental Equations
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2011 –47658 Determining ODE from Noisy Data 31 th CIE, Washington.
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
Reverse Engineering Niloy J. Mitra.
New Techniques for Visualisation of Large and Complex Networks with Directed Edges Tim Dwyer 1 Yehuda Koren 2 1 Monash University, Victoria, Australia.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
Silhouettes in Multiview Stereo Ian Simon. Multiview Stereo Problem Input: – a collection of images of a rigid object (or scene) – camera parameters for.
Accurate Non-Iterative O( n ) Solution to the P n P Problem CVLab - Ecole Polytechnique Fédérale de Lausanne Francesc Moreno-Noguer Vincent Lepetit Pascal.
Iterative closest point algorithms
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
Filling Holes in Complex Surfaces using Volumetric Diffusion James Davis, Stephen Marschner, Matt Garr, Marc Levoy Stanford University First International.
University of North Carolina - Chapel Hill Fluid & Rigid Body Interaction Comp Physical Modeling Craig Bennetts April 25, 2006 Comp Physical.
2010/5/171 Overview of graph cuts. 2010/5/172 Outline Introduction S-t Graph cuts Extension to multi-label problems Compare simulated annealing and alpha-
Recovering Articulated Object Models from 3D Range Data Dragomir Anguelov Daphne Koller Hoi-Cheung Pang Praveen Srinivasan Sebastian Thrun Computer Science.
3D Rigid/Nonrigid RegistrationRegistration 1)Known features, correspondences, transformation model – feature basedfeature based 2)Specific motion type,
Xinqiao LiuRate constrained conditional replenishment1 Rate-Constrained Conditional Replenishment with Adaptive Change Detection Xinqiao Liu December 8,
Improved Error Estimate for Extraordinary Catmull-Clark Subdivision Surface Patches Zhangjin Huang, Guoping Wang School of EECS, Peking University, China.
Lecture Objectives: Review discretization methods for advection diffusion equation Accuracy Numerical Stability Unsteady-state CFD Explicit vs. Implicit.
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Automatic Posing of a Meshed Human Model Using Point Clouds Lei Wang Joint work with Tamal K. Dey, Huamin.
Curves and Surfaces (cont’) Amy Zhang. Conversion between Representations  Example: Convert a curve from a cubic B-spline curve to the Bézier form:
Projecting points onto a point cloud Speaker: Jun Chen Mar 22, 2007.
Reconstructing Relief Surfaces George Vogiatzis, Philip Torr, Steven Seitz and Roberto Cipolla BMVC 2004.
Algorithms for a large sparse nonlinear eigenvalue problem Yusaku Yamamoto Dept. of Computational Science & Engineering Nagoya University.
CFD Lab - Department of Engineering - University of Liverpool Ken Badcock & Mark Woodgate Department of Engineering University of Liverpool Liverpool L69.
Enforcing Constraints for Human Body Tracking David Demirdjian Artificial Intelligence Laboratory, MIT.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
Spectral surface reconstruction Reporter: Lincong Fang 24th Sep, 2008.
TEMPLATE DESIGN © We presented a simple and effective orienter for defective raw point sets. By seamlessly combining the.
© Fluent Inc. 11/24/2015J1 Fluids Review TRN Overview of CFD Solution Methodologies.
1 Research Question  Can a vision-based mobile robot  with limited computation and memory,  and rapidly varying camera positions,  operate autonomously.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Temporally Coherent Completion of Dynamic Shapes AUTHORS:HAO LI,LINJIE LUO,DANIEL VLASIC PIETER PEERS,JOVAN POPOVIC,MARK PAULY,SZYMON RUSINKIEWICZ Presenter:Zoomin(Zhuming)
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
HEAT TRANSFER FINITE ELEMENT FORMULATION
Optical Flow. Distribution of apparent velocities of movement of brightness pattern in an image.
Skuller: A volumetric shape registration algorithm for modeling skull deformities Yusuf Sahillioğlu 1 and Ladislav Kavan 2 Medical Image Analysis 2015.
Discretization Methods Chapter 2. Training Manual May 15, 2001 Inventory # Discretization Methods Topics Equations and The Goal Brief overview.
Compact, Fast and Robust Grids for Ray Tracing Ares Lagae & Philip Dutré 19 th Eurographics Symposium on Rendering EGSR 2008Wednesday, June 25th.
Compact, Fast and Robust Grids for Ray Tracing
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
Differential Analysis of Fluid Flow. Navier-Stokes equations Example: incompressible Navier-Stokes equations.
Dynamic Geometry Registration Maks Ovsjanikov Leonidas Guibas Natasha GelfandNiloy J. Mitra Simon Flöry Helmut Pottmann Dynamic Geometry Registration.
Biointelligence Laboratory, Seoul National University
Robust Visual Motion Analysis: Piecewise-Smooth Optical Flow
Wenkun Zhang, Hanming Zhang, Lei Li, Jinlai Ye, Bin Yan, Linyuan Wang
The Lagrange Multiplier Method
Supported by the National Science Foundation.
Objective Numerical methods Finite volume.
Wavelet-based Compression of 3D Mesh Sequences
Energy Resources Engineering Department Stanford University, CA, USA
Boolean Operations for Free-form Models Represented in Geometry Images
Constraints.
Presentation transcript:

Andrei Sharf Dan A. Alcantara Thomas Lewiner Chen Greif Alla Sheffer Nina Amenta Daniel Cohen-Or Space-time Surface Reconstruction using Incompressible Flow

4D Data acquisition - setting Synchronized static cameras 2-16 views Capture rates fps

Persistent self occlusions Low frame rate and resolution Noise 4D Data acquisition - limitations

Motivation Volume is incompressible across time Explicitly modeling of mass field: –Compute inside/outside volume –Include physical assumptions –Object is watertight manifold 2D time mass field

Contribution Incompressible mass flow 4D reconstruction –Global system considers all frames simultaneously –Simple formulation on a grid General un-constrained deformations time

Related work Marker based [Marschner et al. 2000; Guskov et al. 2003; White et al. 2007] Template based [Allen et al. 2002; Anguelov et al. 2004; Zhang et al. 2004; Anguelov et al. 2005, Aguiar et al. 2008; Bradley et al. 2008] Point correspondence and registration [Shinya 2004; Wang et al. 2005, Anuar and Guskov 2004, Pekelny and Gotsman 2008, Chang and Zwicker 2008; Li et al. 2008] Surface based space-time [Wand et al. 2007; Mitra et al. 2007; Suessmuth et al. 2008] Mitra et al Li et al Anuar et al Zhang et al Guskov et al. 2003

FLOW reconstruction In: 3D point cloud frames Out: watertight surface Explicit volume modeling –4D solid on a grid –Characteristic function

3D reconstruction techniques fail Surface reconstruction of individual frames fails

2D example known outside 0 known inside 1 unknown [0-1]

1D representation Domain: space time grid Material: characteristic function x t i values mass amount at each cell Flow: amount of material v t i,j moving from cell x t i to cell x t+1 j v t i,i-1 v t i,i+1 x t+1 i-1 x t+1 i x t+1 i+1 t+1 t v t i,i time xtixti

Higher dimensions generalization Regular 4D grid on top of 3D scan frames Space-time adjacency relationships: 1D2D3D

FLOW physical constraints Mass preservation: material in cell equals to material flowing into and out of the cell time

FLOW physical constraints Spatial continuity: values spatially adjacent to be identical everywhere, except across boundaries space

FLOW Physical Constraints Flow momentum: flow direction should be smooth across time

Constrained Minimization Problem Optimization: Constraints: –Incompressibility constraints –Boundary values

Challenges Sublinear exponent iterative reweighted least squares Huge matrices fine-tuned iterative solver Mass stability boundary constraints, clamping

Sublinear exponent Iteratively Reweighted Least Squares: from previous iteration small close to discontinuities converges with good init and few outliers iteration time

Huge data problem Problem size frames x (2 8 ) 3 grid resolution x 8 variables per cell in time Reduce initial number of unknowns Pre-assignment from visibility hull : inside/outside labels High resolution per-frame surface reconstruction Sharf et al. 07

Lagrange multipliers: Minimization problem

Matrix engineering Iterative, preconditioned with many eigenvalues 1  fast convergence Augmenting approach:  solve with CG  MINRES solver with decreasing tolerance

Mass stability: clamping/back substitution : amount of mass at cell (i,t) : inside, outside clamp if then adjacent back-substitution reduces the system size iteration time

Results (2D) – empty frames completion

Results – hand puppet from 2 views

Results - garments

Results – large deformation

Results 3D+time 20 frames at constant resolution Solver converges in 100 iterations. Time: 1 minute per-frame 3.73 GHz CPU, memory requirements up to 4.5GB

Conclusions and Limitations Meshes representing time-slices of the solid are computed independently Resolution limitation Bounded deformation speed: at each time step material can only move to temporally adjacent cells

Thank you!