TER - ENSIMAG 2009 3D Regularization of Animated Surfaces Simon Courtemanche Supervisors : Franck Hétroy, Lionel Revéret, Estelle Duveau Team : EVASION.

Slides:



Advertisements
Similar presentations
Coherent Laplacian 3D protrusion segmentation Oxford Brookes Vision Group Queen Mary, University of London, 11/12/2009 Fabio Cuzzolin.
Advertisements

05/11/2005 Carnegie Mellon School of Computer Science Aladdin Lamps 05 Combinatorial and algebraic tools for multigrid Yiannis Koutis Computer Science.
Bicubic G1 interpolation of arbitrary quad meshes using a 4-split
As-Rigid-As-Possible Surface Modeling
2D/3D Shape Manipulation, 3D Printing
Graph-02.
Least-squares Meshes Olga Sorkine and Daniel Cohen-Or Tel-Aviv University SMI 2004.
Leting Wu Xiaowei Ying, Xintao Wu Aidong Lu and Zhi-Hua Zhou PAKDD 2011 Spectral Analysis of k-balanced Signed Graphs 1.
Spectral methods 1 © Alexander & Michael Bronstein,
Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.
High-Pass Quantization for Mesh Encoding Olga Sorkine, Daniel Cohen-Or, Sivan Toledo Eurographics Symposium on Geometry Processing, Aachen 2003.
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain Ryutarou Ohbuchi, Shigeo Takahashi, Takahiko Miyazawa, Akio Mukaiyama.
10/11/2001Random walks and spectral segmentation1 CSE 291 Fall 2001 Marina Meila and Jianbo Shi: Learning Segmentation by Random Walks/A Random Walks View.
ECCV 2002 Removing Shadows From Images G. D. Finlayson 1, S.D. Hordley 1 & M.S. Drew 2 1 School of Information Systems, University of East Anglia, UK 2.
1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts Dhillon, Inderjit S., Yuqiang Guan, and Brian Kulis.
A Sketch-Based Interface for Detail-Preserving Mesh Editing Andrew Nealen Olga Sorkine Marc Alexa Daniel Cohen-Or.
CS CS 175 – Week 2 Processing Point Clouds Local Surface Properties, Moving Least Squares.
A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts
Watermarking 3D Polygonal Meshes 報告者:梁晉坤 指導教授:楊士萱博士 日期:
Video summarization by graph optimization Lu Shi Oct. 7, 2003.
FiberMesh: Designing Freeform Surfaces with 3D Curves
3D Geometry for Computer Graphics
Andrew Nealen, TU Berlin, CG 11 Andrew Nealen TU Berlin Takeo Igarashi The University of Tokyo / PRESTO JST Olga Sorkine Marc Alexa TU Berlin Laplacian.
Scientific Visualization Data and Geometry Processing for Scientific Visualization CS 5630 / 6630 August 28, 2007.
Computer Graphics Recitation The plan today Least squares approach  General / Polynomial fitting  Linear systems of equations  Local polynomial.
00/4/103DVIP-011 Part Three: Descriptions of 3-D Objects and Scenes.
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.
Domain decomposition in parallel computing Ashok Srinivasan Florida State University COT 5410 – Spring 2004.
Laplacian Surface Editing
Functional maps: A Flexible Representation of Maps Between Shapes SIGGRAPH 2012 Maks Ovsjanikov 1 Mirela Ben-Chen 2 Justin Solomon 2 Adrian Butscher 2.
Structure Preserving Embedding Blake Shaw, Tony Jebara ICML 2009 (Best Student Paper nominee) Presented by Feng Chen.
Context-based Surface Completion Andrei Sharf, Marc Alexa, Daniel Cohen-Or.
Mesh Deformation Based on Discrete Differential Geometry Reporter: Zhongping Ji
Mesh Watermarking based on 2D Transferred Domain Jongyun Jun Tae-Joon Kim CS548 Term Project Presentation 2010/05/13.
IEEE TRANSSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
CS 219: Sparse Matrix Algorithms
« Structure from motion » algorithms for the CYCAB robot Guillaume CERNIER ENSIMAG - 2nd year internship 19th June - 15th September 2006.
First experiments in surface-based mechanical property reconstruction of gelatine phantoms A. Peters, S. Wortmann, R. Elliott, M. Staiger, J.G. Chase,
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.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
Spectral Analysis based on the Adjacency Matrix of Network Data Leting Wu Fall 2009.
Workshop on Optimization in Complex Networks, CNLS, LANL (19-22 June 2006) Application of replica method to scale-free networks: Spectral density and spin-glass.
KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:
Domain decomposition in parallel computing Ashok Srinivasan Florida State University.
Data Structures and Algorithms in Parallel Computing Lecture 7.
The discrete Laplacian on d-regular graphs : Combinatorics, Random Matrix Theory and Random Waves Work done with Yehonatan Elon, Idan Oren, and Amit Godel.
Mesh Segmentation via Spectral Embedding and Contour Analysis Speaker: Min Meng
Multi-view Synchronization of Human Actions and Dynamic Scenes Emilie Dexter, Patrick Pérez, Ivan Laptev INRIA Rennes - Bretagne Atlantique
Differential Coordinates and Laplacians Nicholas Vining Technical Director, Gaslamp Games.
Progress Report #2 Alvaro Velasquez. Project Selection I chose to work with Nasim Souly on the project titled “Subspace Clustering via Graph Regularized.
Random Walk for Similarity Testing in Complex Networks
Processing visual information for Computer Vision
You can check broken videos in this slide here :
Point-wise Map Recovery and Refinement from Functional Correspondence
Presented by Omer Shakil
CS200: Algorithm Analysis
Network Science: A Short Introduction i3 Workshop
Latent Space Model for Road Networks to Predict Time-Varying Traffic
Approximating the Community Structure of the Long Tail
geometric representations of graphs
GreedyMaxCut a b w c d e 1.
Walks, Paths, and Circuits
Discrete Surfaces and Manifolds: A Potential tool to Image Processing
3.3 Network-Centric Community Detection
Descriptions of 3-D Objects and Scenes
Graphs G = (V, E) V are the vertices; E are the edges.
Presentation transcript:

TER - ENSIMAG D Regularization of Animated Surfaces Simon Courtemanche Supervisors : Franck Hétroy, Lionel Revéret, Estelle Duveau Team : EVASION Laboratories : INRIA, LJK

3D Regularization of Animated Surfaces Introduction 1. Type of Data 1.1 Mesh 1.2 Animated Surface 2. Laplacian operator 2.1 Definitions 2.2 Basic smoothing 2.3 Mesh reconstruction & smoothing 3. Extension to mesh sequences

3D Regularization of Animated Surfaces 1. Type of Data 1.1 Mesh M = { V, E, F } Object File Format

3D Regularization of Animated Surfaces 1. Type of Data 1.2 Animated surface - sequence of meshes Grimage Platform – INRIA Extracting process :

3D Regularization of Animated Surfaces 2. Laplacian operator 2.1 Definitions Relative or Differential or -coordinates ( Image by Olga Sorkine ) Degree matrix DD(i,i) = degree vertex i Adjacency matrix AA(i,j) = 1 (i,j) edge Laplacian matrix LL = D – A = L. X L large but sparse !

3D Regularization of Animated Surfaces 2. Laplacian operator 2.2 Basic smoothing - eigenbasis of the Laplacian matrix λ =0( low frequence) λ =3( high frequences)

3D Regularization of Animated Surfaces 2. Laplacian operator 2.3 Mesh reconstruction and smoothing L-1L-1 constraints + approximation || L.X || 2 : smoothness constraint least-squares solving

3D Regularization of Animated Surfaces 3. Extension to mesh sequences 4D meshing Closest points Isometric 4D Laplacian smoothing3D static & dynamic techniques

3D Regularization of Animated Surfaces 3. Extension to mesh sequences spatial coherent registration Images from Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors by Knossow et al., Perception team, INRIA

3D Regularization of Animated Surfaces Conclusion Laplacian operator : spectral properties My work : libraries, intuitive extensions Future works : mesh registration with real videos

3D Regularization of Animated Surfaces Acknowledgments Thanks to : - Estelle Duveau - Franck Hétroy - Lionel Revéret - Maxime Tournier

3D Regularization of Animated Surfaces Complements Images by Knossow et al.