E IGEN D EFORMATION OF 3 D M ODELS Tamal K. Dey, Pawas Ranjan, Yusu Wang [The Ohio State University] (CGI 2012)

Slides:



Advertisements
Similar presentations
Robust Mesh Watermarking
Advertisements

Shapelets Correlated with Surface Normals Produce Surfaces Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Real-Time Dynamic Wrinkles Caroline Larboulette Marie-Paule Cani GRAVIR Lab, Grenoble, France.
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
Machine Learning Lecture 8 Data Processing and Representation
CSE554Extrinsic DeformationsSlide 1 CSE 554 Lecture 9: Extrinsic Deformations Fall 2012.
Face Alignment with Part-Based Modeling
Modeling the Shape of People from 3D Range Scans
Persistent Heat Signature for Pose-oblivious Matching of Incomplete Models Tamal K. Dey, Kuiyu Li, Chuanjiang Luo, Pawas Ranjan, Issam Safa, Yusu Wang.
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
MATHIEU GAUTHIER PIERRE POULIN LIGUM, DEPT. I.R.O. UNIVERSITÉ DE MONTRÉAL GRAPHICS INTERFACE 2009 Preserving Sharp Edges in Geometry Images.
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
3D Skeletons Using Graphics Hardware Jonathan Bilodeau Chris Niski.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
November 4, 2014Computer Vision Lecture 15: Shape Representation II 1Signature Another popular method of representing shape is called the signature. In.
© Janice Regan, CMPT 102, Sept CMPT 102 Introduction to Scientific Computer Programming The software development method algorithms.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
Trajectory Generation How do I get there? This way!
Modeling and Deformation of Arms and Legs Based on Ellipsoidal Sweeping Speaker: Alvin Date:2/16/2004From:PG03.
Distributed Regression: an Efficient Framework for Modeling Sensor Network Data Carlos Guestrin Peter Bodik Romain Thibaux Mark Paskin Samuel Madden.
Correspondence & Symmetry
1 Numerical geometry of non-rigid shapes Spectral Methods Tutorial. Spectral Methods Tutorial 6 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical.
Optimal Bandwidth Selection for MLS Surfaces
Abstract Extracting a matte by previous approaches require the input image to be pre-segmented into three regions (trimap). This pre-segmentation based.
Basic Concepts and Definitions Vector and Function Space. A finite or an infinite dimensional linear vector/function space described with set of non-unique.
CS4670: Computer Vision Kavita Bala Lecture 7: Harris Corner Detection.
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
3D Global Registration. The Problem Given: n scans around an objectGiven: n scans around an object Goal: align them allGoal: align them all First attempt:
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.
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2014.
06 - Boundary Models Overview Edge Tracking Active Contours Conclusion.
CS 551/651 Advanced Computer Graphics Warping and Morphing Spring 2002.
Cs: compressed sensing
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
Mesh Deformation Based on Discrete Differential Geometry Reporter: Zhongping Ji
Finite Element Method.
A Method for Registration of 3D Surfaces ICP Algorithm
Roee Litman, Alexander Bronstein, Michael Bronstein
CSE554Fairing and simplificationSlide 1 CSE 554 Lecture 6: Fairing and Simplification Fall 2012.
AS-RIGID-AS-POSSIBLE SHAPE MANIPULATION
Temporally Coherent Completion of Dynamic Shapes AUTHORS:HAO LI,LINJIE LUO,DANIEL VLASIC PIETER PEERS,JOVAN POPOVIC,MARK PAULY,SZYMON RUSINKIEWICZ Presenter:Zoomin(Zhuming)
Spectral Sequencing Based on Graph Distance Rong Liu, Hao Zhang, Oliver van Kaick {lrong, haoz, cs.sfu.ca {lrong, haoz, cs.sfu.ca.
HEAT TRANSFER FINITE ELEMENT FORMULATION
David Levin Tel-Aviv University Afrigraph 2009 Shape Preserving Deformation David Levin Tel-Aviv University Afrigraph 2009 Based on joint works with Yaron.
Skuller: A volumetric shape registration algorithm for modeling skull deformities Yusuf Sahillioğlu 1 and Ladislav Kavan 2 Medical Image Analysis 2015.
Robust Watermarking of 3D Mesh Models. Introduction in this paper, it proposes an algorithm that extracts 2D image from the 3D model and embed watermark.
Irfan Ullah Department of Information and Communication Engineering Myongji university, Yongin, South Korea Copyright © solarlits.com.
Affine Registration in R m 5. The matching function allows to define tentative correspondences and a RANSAC-like algorithm can be used to estimate the.
Motivation 2 groups of tools for free-from design Images credits go out to the FiberMesh SIGGRAPH presentation and other sources courtesy of Google.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
Rongjie Lai University of Southern California Joint work with: Jian Liang, Alvin Wong, Hongkai Zhao 1 Geometric Understanding of Point Clouds using Laplace-Beltrami.
Acquiring, Stitching and Blending Diffuse Appearance Attributes on 3D Models C. Rocchini, P. Cignoni, C. Montani, R. Scopigno Istituto Scienza e Tecnologia.
CSE 554 Lecture 8: Alignment
Morphing and Shape Processing
Slope and Curvature Density Functions
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
Dynamical Statistical Shape Priors for Level Set Based Tracking
Structure from motion Input: Output: (Tomasi and Kanade)
Domain-Modeling Techniques
Finite Element Surface-Based Stereo 3D Reconstruction
CS Digital Image Processing Lecture 5
CSE 554 Lecture 10: Extrinsic Deformations
Feature space tansformation methods
X.2 Linear Discriminant Analysis: 2-Class
Fourier Transform of Boundaries
Structure from motion Input: Output: (Tomasi and Kanade)
Presentation transcript:

E IGEN D EFORMATION OF 3 D M ODELS Tamal K. Dey, Pawas Ranjan, Yusu Wang [The Ohio State University] (CGI 2012)

Problem Perform deformations without asking the user for extra structures (like cages, skeletons etc)

Previous Work Skeleton based [YBS03], [DQ04], [BP07],... Cage based [FKR05], [JMGDS07], [LLC08],... Constrained vertices and energy minimization [SA07], [YZXSB04], [ZHSLBG05],etc.

Cage-less deformation Skeleton and cage based methods very fast, but need extra structures Energy based methods do not require extra structures, but are usually slow Need to perform fast deformations without asking the user for extra structures like skeletons or cages

The Laplace-Beltrami operator A popular operator defined for surfaces – Isometry invariant – Robust against noise and sampling – Changes smoothly with changes in shape Its eigenvectors form an orthonormal basis for functions defined on the surface

Eigen-skeleton Treat x, y and z coordinates as functions Reconstruct them using the eigenvectors, ignoring high frequencies

Eigen-skeleton for deformation User specifies a shape along with: – A region on the shape – Deformation desired on that region We: – Create the eigen-skeleton – Apply the deformation to the entire region – Smooth out the skeleton – Add details to get the deformed shape

Eigen-skeleton for deformation

Choice of number of eigenvectors Need to be able to capture the feature to be deformed Use the size of region of interest to choose the number of eigenvectors to use Smaller features need more eigenvectors

Skeleton energy Let be the top m eigenvectors We wish to find new weights for the deformed shape

Skeleton energy Taking partial derivatives and re-arranging the terms, we get the following linear system

Skeleton energy Solving for the unknown weights A i, we get a smooth representation of the deformed skeleton

Recovering Shape Details Using few eigenvectors causes loss of details Once smooth deformed skeleton is obtained, these details need to be added back Use the one-to-one correspondence between the shape and skeleton to recover the details

Algorithm

Results

Arbitrary genus

Comparison

Timing (in seconds)

Conclusion Fast deformations using implicit skeleton No need for user to provide extra structures Software coming very soon! Result not necessarily free of self-intersections Computing the eigenvectors of the Laplace operator can be time-consuming