Modal Shape Analysis beyond Laplacian (CAGP 2012) Klaus Hildebrandt, Christian Schulz, Christoph von Tycowicz, Konrad Polthier (brief) Presenter: ShiHao.Wu.

Slides:



Advertisements
Similar presentations
Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.
Advertisements

Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
As-Rigid-As-Possible Surface Modeling
Spectral methods 1 © Alexander & Michael Bronstein,
Nonlinear Dimension Reduction Presenter: Xingwei Yang The powerpoint is organized from: 1.Ronald R. Coifman et al. (Yale University) 2. Jieping Ye, (Arizona.
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
Extended Gaussian Images
Topology-Invariant Similarity and Diffusion Geometry
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Surface Classification Using Conformal Structures Xianfeng Gu 1, Shing-Tung Yau 2 1. Computer and Information Science and Engineering, University of Florida.
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
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.
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
Lecture 21: Spectral Clustering
Shape-Based Retrieval of Articulated 3D Models Using Spectral Embedding GrUVi Lab, School of Computing Science Simon Fraser University, Burnaby, BC Canada.
Principal Component Analysis
Spectral embedding Lecture 6 1 © Alexander & Michael Bronstein
6. One-Dimensional Continuous Groups 6.1 The Rotation Group SO(2) 6.2 The Generator of SO(2) 6.3 Irreducible Representations of SO(2) 6.4 Invariant Integration.
A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts
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.
Spectral Embedding Alexander Bronstein, Michael Bronstein
Optimal Bandwidth Selection for MLS Surfaces
Three Algorithms for Nonlinear Dimensionality Reduction Haixuan Yang Group Meeting Jan. 011, 2005.
What is So Spectral? SIGGRAPH 2010 Course Spectral Mesh Processing
A Global Geometric Framework for Nonlinear Dimensionality Reduction Joshua B. Tenenbaum, Vin de Silva, John C. Langford Presented by Napat Triroj.
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 Graphics Recitation The plan today Least squares approach  General / Polynomial fitting  Linear systems of equations  Local polynomial.
Diffusion Maps and Spectral Clustering
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Morphological Analysis of 3D Scalar Fields based on Morse Theory and Discrete Distortion Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept.
Image Processing and Analysis (ImagePandA) 10 – Shape and Motion Christoph Lampert / Chris Wojtan.
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
SIGGRAPH 2010 “Spectral Mesh Processing” Bruno Lévy and Richard Hao Zhang.
Spectral Global Intrinsic Symmetry Invariant Functions Hui Wang Shijiazhuang Tiedao University Patricio Simari The Catholic University of America Zhixun.
Linear Image Reconstruction Bart Janssen 13-11, 2007 Eindhoven.
USSC3002 Oscillations and Waves Lecture 11 Continuous Systems
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Spectral Sequencing Based on Graph Distance Rong Liu, Hao Zhang, Oliver van Kaick {lrong, haoz, cs.sfu.ca {lrong, haoz, cs.sfu.ca.
David Levin Tel-Aviv University Afrigraph 2009 Shape Preserving Deformation David Levin Tel-Aviv University Afrigraph 2009 Based on joint works with Yaron.
Hierarchical Deformation of Locally Rigid Meshes Josiah Manson and Scott Schaefer Texas A&M University.
Methods for 3D Shape Matching and Retrieval
Signal & Weight Vector Spaces
Boundary-Value Problems in Rectangular Coordinates
 In the previews parts we have seen some kind of segmentation method.  In this lecture we will see graph cut, which is a another segmentation method.
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.
Instructor: Mircea Nicolescu Lecture 7
A Part-aware Surface Metric for Shape Analysis Rong Liu 1, Hao Zhang 1, Ariel Shamir 2, and Daniel Cohen-Or 3 1 Simon Fraser University, Canada 2 The Interdisciplinary.
Mesh Segmentation via Spectral Embedding and Contour Analysis Speaker: Min Meng
Principal Warps: Thin-Plate Splines and the Decomposition of Deformations 김진욱 ( 이동통신망연구실 ; 박천현 (3D 모델링 및 처리연구실 ;
Principal Components Analysis ( PCA)
Rongjie Lai University of Southern California Joint work with: Jian Liang, Alvin Wong, Hongkai Zhao 1 Geometric Understanding of Point Clouds using Laplace-Beltrami.
CSE 554 Lecture 8: Alignment
Spectral Methods for Dimensionality
Graph Spectral Image Smoothing
Random Walk for Similarity Testing in Complex Networks
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Intrinsic Data Geometry from a Training Set
You can check broken videos in this slide here :
Slope and Curvature Density Functions
Paper Presentation: Shape and Matching
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
Domain-Modeling Techniques
Scale-Space Representation of 3D Models and Topological Matching
ECE 576 POWER SYSTEM DYNAMICS AND STABILITY
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
§3.3.1 Sturm-Liouville theorem: orthogonal eigenfunctions
Active Contour Models.
Presentation transcript:

Modal Shape Analysis beyond Laplacian (CAGP 2012) Klaus Hildebrandt, Christian Schulz, Christoph von Tycowicz, Konrad Polthier (brief) Presenter: ShiHao.Wu

Outline 1, Quick review of Spectral 2, Main contributions of the paper 3, Results

Chladni plates Let us “see” the vibration of the metal plate from the white sands.

Chladni plates VS spetral Left: In the late 1700's, the physicist Ernst Chladni was amazed by the patterns formed by sand on vibrating metal plates. Right: numerical simulations obtained with a discretized Laplacian.

How to transform to spetral space? In order to build eigenstructure of the surface. Discrete view: – Define matrices on the graphs of surface, then find eigenvectors and eigenvalues. Continuous view: – Define operators on the manifolds, then find eigenfunctions(eigenmodes) and eigenvalues.

Laplace operator(Laplacian)

Advantage: – eigenfunctions of the Laplacian form an orthogonal basis of the space of the surface(like Fourier basis) – eigenvalues and eigenfunctions are invariant under isometric deformations of the surface Disadvantage: – insensitivity to extrinsic features of the surface, like sharp bends

Motivation and Contributions New operators derive from surface energy as alternatives to Lapacian, which is sensitive to features. Application to global mesh shape analysis – vibration signature(descriptor): measures the similarity of points on a surface – feature signature: identify features of surfaces

What’s surface energy? A twice continuously differentiable function of the surface. (skip)At a minimum of E, the eigenmodes associated to the low eigenvalues of the Hessian of E, point into the direction that locally cause the least increase of energy. Surface Energy Hessian on minima Eigenvalues Eigenmodes

Example1 of surface energy (foundation of this paper) Dirichlet energy: – measure of how variable of σ, is intimately connected to Laplace basically. – its Hessian equals the Laplace operator if the surface is a part of the Euclidean plane

Example2 of surface energy(skip) (foundation of this paper) Deformation energy: – x is a surface mesh (the positions of the vertices) – ƒ and ω measure angles, length of edges, or area of triangles. Example, thin shell simulation:

Key observation Laplacian eigenvalue problem appears as the eigenvalue problem of the Hessian of the Dirichlet energy. So, By modifying the Dirichlet energy, we could get new operators better than Laplacian, using normal information

Modified Dirichlet energy

Discretization of Dirichlet energy(skip)

Comparison and possible Explanation Laplacian

Comparison and possible Explanation The energy has its minimum at the origin of the space of normal vector fields. Therefore, eigenmodes of Hessian of that correspond to small eigenvalues have small function values in areas of high curvature, because then a variation in this direction causes less increase of energy

Modes of Deformation energy(skip) Deformation energy:

Eigen vibration modes from shell deformation energy(skip)

Vibration signature(skip) Based on the vibration modes of the surface with respect to the Discrete Shells energy – denote the eigenvalues and vibration eigenmodes of a mesh x. – The eigenmodes with smaller eigenvalue receive higher weights and t is a parameter to control that

Vibration signature distance measures the similarity of points on a surface Different distance threshold

Feature signature Identify features of surfaces by normal information

Vibration signature VS Heat kernel signature HKS V S

Heat kernel signature VS Vibration signature HKS V S different t

Feature signature VS Heat kernel signature HKS FS

Feature signature VS Heat kernel signature HKS FS

Efficiency

Future work Spectral quadrangulations sensitive to feature Create a subspace of the shape space of a mesh by vibration modes.(SIG 2012)

29 Application: use of eigenvectors Whenever clustering is applicable, e.g., – Mesh segmentation in spectral domain [Liu & Zhang 04, 05, 07] – Surface reconstruction: grouping “inside” and “outside” tetrahedra [Kullori et al. 05] – Shape correspondence: finding clusters of consistent or agreeable pair-wise matching [Leordeanu & Hebert 06]

Favorite spectral project Music Visualization and editing

Thank you !