Computing and Processing Correspondences with Functional Maps
|
|
- Liliana Brown
- 5 years ago
- Views:
Transcription
1 Computing and Processing Correspondences with Functional Maps SIGGRAPH 2017 course Maks Ovsjanikov, Etienne Corman, Michael Bronstein, Emanuele Rodolà, Mirela Ben-Chen, Leonidas Guibas, Frederic Chazal, Alex Bronstein
2 General Overview Overall Objective: Create tools for computing and analyzing mappings between geometric objects. 2
3 General Overview Overall Objective: Create tools for computing and analyzing mappings between geometric objects. Rather than comparing pointson objects it is often easier to compare real-valued functionsdefined on them. Such maps can be represented as matrices. 3
4 Course Overview Course Website: or Course Notes: Linked from the website. Or use Attention: (significantly) more material than in the lectures Sample Code: See Sample Code link on the website. New: demo code for basic operations. 4
5 Course Schedule 2:00pm 2:45pm Introduction(Maks) Introduction to the functional maps framework. 2:50pm 3:35pm Computing Functional Maps (Etienne) Optimization methods for functional map estimation. 3:40pm - 4:25pm Functional Vector Fields (Miri) From functional maps to tangent vector fields and back. 4:30pm -5:15pm Maps in Shape Collections (Leo) Networks of maps, shape variability, learning. 5:15pm - Wrapup, Q&A (all) 5
6 What is a Shape? Continuous: a surface embedded in 3D. Discrete: a graph embedded in 3D (triangle mesh). Common assumptions: Connected. Manifold. Without Boundary. 6
7 What is a Shape? Continuous: a surface embedded in 3D. Discrete: a graph embedded in 3D (triangle mesh). 5k 200k triangles 7 Shapes from the FAUST, SCAPE, and TOSCA datasets
8 Overall Goal Given two shapes, find correspondences between them. Finding the best map between a pair of shapes. 8
9 Why Shape Matching? Given a correspondence, we can transfer: texture and parametrization segmentation and labels deformation Sumner et al. 04. Other applications: shape interpolation, reconstruction... 9
10 RigidShape Matching Given a pair of shapes, find the optimal Rigid Alignment between them. The unknowns are the rotation/translation parameters of the source onto the target shape. 10
11 Iterative Closest Point (ICP) Classical approach: iterate between finding correspondences and finding the transformation: M N example in 2D Given a pair of shapes, Mand, iterate: x i M 1. For each find nearestneighbor. 2. Find optimal transformation R,t minimizing: X arg min krx i +t y i k 2 2 R,t i N y i N 11
12 Iterative Closest Point Classical approach: iterate between finding correspondences and finding the transformation: M N Given a pair of shapes, Mand, iterate: x i M 1. For each find nearestneighbor. 2. Find optimal transformation R,t minimizing: X arg min krx i +t y i k 2 2 R,t i N y i N 12
13 Iterative Closest Point Classical approach: iterate between finding correspondences and finding the transformation: M N Given a pair of shapes, Mand, iterate: x i M 1. For each find nearestneighbor. 2. Find optimal transformation R,t minimizing: X arg min krx i +t y i k 2 2 R,t i N y i N 13
14 Iterative Closest Point Classical approach: iterate between finding correspondences and finding the transformation: M N Given a pair of shapes, Mand, iterate: x i M 1. For each find nearestneighbor. 2. Find optimal transformation R,t minimizing: X arg min krx i +t y i k 2 2 R,t i N y i N 14
15 Iterative Closest Point Classical approach: iterate between finding correspondences and finding the transformation: M N Given a pair of shapes, Mand, iterate: x i M 1. For each find nearestneighbor. 2. Find optimal transformation R,t minimizing: X arg min krx i +t y i k 2 2 R,t i N y i N 15
16 Iterative Closest Point Classical approach: iterate between finding correspondences and finding the transformation: M N 1. Finding nearest neighbors: can be done with spacepartitioning data structures (e.g., KD-tree). 2. Finding the optimal transformation R,t minimizing: X arg min krx i +t y i k 2 2 R SO(3),t R 3 i Can be done efficiently via SVD decomposition. Arun et al., Least- Squares Fitting of Two 3-D Point Sets
17 Non-Rigid Shape Matching Unlike rigid matching with rotation/translation, there is no compact representation to optimize for in non-rigid matching. 17
18 Non-Rigid Shape Matching Main Questions: What does it mean for a correspondence to be good? How to compute it efficiently in practice? 18
19 Isometric Shape Matching Deformation Model: Good maps must preserve geodesic distances. N d M (x,y) M d N (T(x),T(y)) Geodesic: length of shortest path lying entirely on the surface. 19
20 Isometric Shape Matching Approach: N d N (T(x),T(y)) d M (x,y) M Find the point mapping by minimizing the distance distortion: X T opt = argmin kd M (x,y) d N (T(x),T(y))k T x,y The unknowns are point correspondences. 20
21 Isometric Shape Matching Approach: N d N (T(x),T(y)) d M (x,y) M Find the point mapping by minimizing the distance distortion: X T opt = argmin kd M (x,y) d N (T(x),T(y))k T x,y Problem: The space of possible solutions is highly non-linear, non-convex.
22 Functional Map Representation We would like to define a representation of shape maps that is more amenable to direct optimization. 1. A compact representation for natural maps. 2. Inherently global and multi-scale. 3. Handles uncertainty and ambiguity gracefully. 4. Allows efficient manipulations (averaging, composition). 5. Leads to simple (linear) optimization problems. 22
23 Functional Approach to Mappings Given two shapes and a pointwisemap T : N M M T N The map T induces a functional correspondence: T F (f)=g, where g = f T Functional maps: a flexible representation of maps between shapes, O., Ben-Chen, Solomon, Butscher, Guibas, SIGGRAPH
24 Functional Approach to Mappings Given two shapes and a pointwisemap T : N M f : M R T F T F (f)=g : N R The map T induces a functional correspondence: T F (f)=g, where g = f T Functional maps: a flexible representation of maps between shapes, O., Ben-Chen, Solomon, Butscher, Guibas, SIGGRAPH
25 Functional Approach to Mappings Given two shapes and a pointwisemap T : N M f : M R T F T F (f)=g : N R The map T induces a functional correspondence: T F (f)=g, where g = f T Functional maps: a flexible representation of maps between shapes, O., Ben-Chen, Solomon, Butscher, Guibas, SIGGRAPH
26 Functional Approach to Mappings Given two shapes and a pointwisemap T : N M f : M R T F T F (f)=g : N R The induced functional correspondence is linear: T F (α 1 f 1 +α 2 f 2 )=α 1 T F (f 1 )+α 2 T F (f 2 ) 26
27 Functional Map Representation Given two shapes and a pointwisemap T : N M f : M R T F T F (f)=g : N R The induced functional correspondence is complete. 27
28 Observation Assume that both: f L 2 (M),g L 2 (N) f : M R T F g : N R M N Express both f and T F (f) in terms of basis functions: f = X i a i φ M i g = T F (f)= X j b j φ N j Since T F is linear, there is a linear transformation from {a i } to {b j }.
29 Functional Map Representation Choice of Basis: Eigenfunctions of the Laplace-Beltrami operator: φ i = λ i φ i (f)= divr(f) Generalization of Fourier bases to surfaces. Ordered by eigenvalues and provide a natural notion of scale. λ 0 =0 λ 1 =2.6 λ 2 =3.4 λ 3 =5.1 λ 4 =7.6 29
30 Functional Map Representation Choice of Basis: Eigenfunctions of the Laplace-Beltrami operator: φ i = λ i φ i Generalization of Fourier bases to surfaces. Ordered by eigenvalues and provide a natural notion of scale. Can be computed efficiently, with a sparse matrix eigensolver. 30
31 Functional Map Representation Since the functional mapping T F is linear: T F (α 1 f 1 +α 2 f 2 )=α 1 T F (f 1 )+α 2 T F (f 2 ) T F = T F can be represented as a matrix C, given a choice of basis for function spaces. Functional maps: a flexible representation of maps between shapes, O., Ben-Chen, Solomon, Butscher, Guibas, SIGGRAPH
32 Functional Map Definition Functional map: matrix C that translates coefficients from Φ M to Φ N. 32
33 Example 1 M T N Given two shapes with n M,n N points and a map: T : N M T : n N n M matrix encoding the map T, one 1 per column with zeros everywhere else. If functions are represented as vectors (in the hat basis), the functional map is given by matrix-vector product: g = T T f C = T T 33
34 Example 2 Given two shapes with n M,n N points and a map: T : N M T : n N n M matrix encoding the map T, one 1 per column with zeros everywhere else. If functions are represented in the reduced basis: Φ M : n M k M Φ N : n N k N k M matrix of the first eigenfunctions of as columns. k N M N matrix of the first eigenfunctions of as columns. The functional map matrix: C = Φ + N TT Φ M + : left pseudo-inverse. C = Φ T NT T Φ M if Φ T NΦ N = Id C = Φ T NA N T T Φ M if Φ T NA N Φ N = Id 34
35 Example Maps in a Reduced Basis Triangle meshes with pre-computed pointwise maps (a) source (b) ground-truth map (c) left-to-right map (d) head-to-tail map Good maps are close to being diagonal 35
36 Reconstructing from LB basis Map reconstruction error using a fixed size matrix. 27.9k vertices reconstruction error Number of basis (eigen)-functions 36
37 Functional Map algebra 1. Map composition becomes matrix multiplication. 2. Map inversion is matrix inversion (in fact, transpose). 3. Algebraic operations on functional maps are possible. E.g. interpolating between two maps with C = αc 1 +(1 α)c 2. 37
38 Shape Matching In practice we do not know C. Given two objects our goal is to find the correspondence.? How can the functional representation help to compute the map in practice? 38
39 Matching via Function Preservation Suppose we don t know C. However, we expect a pair of functions f : M R and g : N R to correspond. Then, C must be s.t. where Ca b f = P i a iφ M i,g= P i b iφ N i. Given enough {a,b} pairs, we can recover C through a linear least squares system. 39
40 Map Constraints Suppose we don t know C. However, we expect a pair of functions f : M R and g : N R to correspond. Then, C must be s.t. Ca b Function preservation constraint is general and includes: Attribute (e.g., color) preservation. Descriptor preservation (e.g. Gauss curvature). Landmark correspondences (e.g. distance to the point). Part correspondences (e.g. indicator function). 40
41 CommutativityConstraints Regularizations: Commutativity with other operators: S M C S N CS M = S N C Note that the energy: kcs M S N Ck 2 F is quadratic in C. 41
42 Regularization Lemma 1: The mapping is isometric, if and only if the functional map matrix commutes with the Laplacian: C M = N C Implies that exact isometries result in diagonal functional maps. Functional maps: a flexible representation of maps between shapes, O., Ben-Chen, Solomon, Butscher, Guibas, SIGGRAPH
43 Regularization Lemma 2: The mapping is locally volume preserving, if and only if the functional map matrix is orthonormal: C T C = Id Map-Based Exploration of Intrinsic Shape Differences and Variability, Rustamov et al., SIGGRAPH
44 Regularization Lemma 3: If the mapping is conformalif and only if: C T 1 C = 2 Map-Based Exploration of Intrinsic Shape Differences and Variability, Rustamov et al., SIGGRAPH
45 Basic Pipeline Given a pair of shapes M,N : 1. Compute the first k (~80-100) eigenfunctions of the Laplace- Beltrami operator. Store them in matrices: 2. Compute descriptor functions (e.g., Wave Kernel Signature) on M,N. Express them in Φ M,Φ N, as columns of : A,B 3. Solve M, N : C diagonal matrices of eigenvalues of LB operator Φ M,Φ N C opt = argminkca Bk 2 +kc M N Ck 2 4. Convert the functional map to a point to point map T. C opt 45
46 Conversion to point-to-point Given a functional map C, we would like to convert to to a point-to-point map. f : M R T F T F (f)=g : N R Option 1: declare T(x) = argmax Problems: high computational complexity, low accuracy. y Φ N Cδ x O(n M n N ) 46
47 Conversion to point-to-point Given a functional map C, we would like to convert to to a point-to-point map. f : M R T F T F (f)=g : N R Option 2: declare T(x) = argmin y kδ y Cδ x k 2 Advantages: computational complexity O(n M logn N ), higher accuracy (e.g., works with the identity map). 47
48 Incorporating Orthonormality In many practical situations we would expect a volumepreserving map, which implies: C T C = Id Option: use post-processing to enforce this constraint. Iterate: 1. Compute the point-to-point map T. 2. Solve for the functional map: arg min C, s.t. C T C=Id x M Exactly the same objective as ICP, but in higher dimension. Can use the same method! X kcδ x δ T(x) k
49 Results A very simple method that puts together many constraints and uses 100 basis functions gives reasonable results: Functional maps: a flexible representation of maps between shapes, O., Ben-Chen, Solomon, Butscher, Guibas, SIGGRAPH
50 Results A very simple method that puts together many constraints and uses 100 basis functions gives reasonable results: radius radius 0.05 Functional maps: a flexible representation of maps between shapes, O., Ben-Chen, Solomon, Butscher, Guibas, SIGGRAPH
51 Segmentation Transfer without P2P To transfer functions we do not need to convert functional to pointwise maps. E.g. we can also transfer segmentations: for each segment, transfer its indicator function, and for each point pick the segment that gave the highest value. 51
Improved Functional Mappings via Product Preservation
Improved Functional Mappings via Product Preservation Workshop: Imaging and Vision March 15 th, 2018 Maks Ovsjanikov Joint with: D. Nogneng, Simone Melzi, Emanuele Rodolà, Umberto Castellani, Michael Bronstein
More informationEfficient regularization of functional map computations
Efficient regularization of functional map computations Flows, mappings and shapes VMVW03 Workshop December 12 th, 2017 Maks Ovsjanikov Joint with: E. Corman, D. Nogneng, R. Huang, M. Ben-Chen, J. Solomon,
More informationComputing and Processing Correspondences with Functional Maps
Computing and Processing Correspondences with Functional Maps SIGGRAPH 2017 COURSE NOTES Organizers & Lecturers: Maks Ovsjanikov, Etienne Corman, Michael Bronstein, Emanuele Rodolà, Mirela Ben-Chen, Leonidas
More informationComputing and Processing Correspondences with Functional Maps
Computing and Processing Correspondences with Functional Maps SIGGRAPH ASIA 2016 COURSE NOTES Organizers & Lecturers: Maks Ovsjanikov, Etienne Corman, Michael Bronstein, Emanuele Rodolà, Mirela Ben-Chen,
More informationHow Much Geometry Lies in The Laplacian?
How Much Geometry Lies in The Laplacian? Encoding and recovering the discrete metric on triangle meshes Distance Geometry Workshop in Bad Honnef, November 23, 2017 Maks Ovsjanikov Joint with: E. Corman,
More informationCorrespondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov
Shape Matching & Correspondence CS 468 Geometry Processing Algorithms Maks Ovsjanikov Wednesday, October 27 th 2010 Overall Goal Given two shapes, find correspondences between them. Overall Goal Given
More informationFunctional Maps: A Flexible Representation of Maps Between Shapes
Functional aps: A Flexible Representation of aps Between Shapes aks Ovsjanikov irela Ben-Chen Justin Solomon Adrian Butscher Leonidas Guibas LIX, École Polytechnique Stanford University Figure 1: Horse
More informationContinuous and Orientation-preserving Correspondences via Functional Maps
Continuous and Orientation-preserving Correspondences via Functional Maps JING REN, KAUST ADRIEN POULENARD, LIX, École Polytechnique PETER WONKA, KAUST MAKS OVSJANIKOV, LIX, École Polytechnique Fig. 1.
More informationNon-rigid shape correspondence by matching semi-local spectral features and global geodesic structures
Non-rigid shape correspondence by matching semi-local spectral features and global geodesic structures Anastasia Dubrovina Technion Israel Institute of Technology Introduction Correspondence detection
More informationGeometric Registration for Deformable Shapes 3.3 Advanced Global Matching
Geometric Registration for Deformable Shapes 3.3 Advanced Global Matching Correlated Correspondences [ASP*04] A Complete Registration System [HAW*08] In this session Advanced Global Matching Some practical
More informationPreparation Meeting. Recent Advances in the Analysis of 3D Shapes. Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers
Preparation Meeting Recent Advances in the Analysis of 3D Shapes Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers What You Will Learn in the Seminar Get an overview on state of the art
More informationMirror-symmetry in images and 3D shapes
Journées de Géométrie Algorithmique CIRM Luminy 2013 Mirror-symmetry in images and 3D shapes Viorica Pătrăucean Geometrica, Inria Saclay Symmetry is all around... In nature: mirror, rotational, helical,
More informationMesh-Based Inverse Kinematics
CS468, Wed Nov 9 th 2005 Mesh-Based Inverse Kinematics R. W. Sumner, M. Zwicker, C. Gotsman, J. Popović SIGGRAPH 2005 The problem 1 General approach Learn from experience... 2 As-rigid-as-possible shape
More informationAssignment 4: Mesh Parametrization
CSCI-GA.3033-018 - Geometric Modeling Assignment 4: Mesh Parametrization In this exercise you will Familiarize yourself with vector field design on surfaces. Create scalar fields whose gradients align
More informationStructured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov
Structured Light II Johannes Köhler Johannes.koehler@dfki.de Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov Introduction Previous lecture: Structured Light I Active Scanning Camera/emitter
More informationarxiv: v1 [cs.cg] 21 Nov 2016
Geodesic Distance Descriptors Gil Shamai Ron Kimmel November 23, 2016 arxiv:1611.07360v1 [cs.cg] 21 Nov 2016 Abstract The Gromov-Hausdorff (GH) distance is traditionally used for measuring distances between
More informationDef De orma f tion orma Disney/Pixar
Deformation Disney/Pixar Deformation 2 Motivation Easy modeling generate new shapes by deforming existing ones 3 Motivation Easy modeling generate new shapes by deforming existing ones 4 Motivation Character
More informationStable and Multiscale Topological Signatures
Stable and Multiscale Topological Signatures Mathieu Carrière, Steve Oudot, Maks Ovsjanikov Inria Saclay Geometrica April 21, 2015 1 / 31 Shape = point cloud in R d (d = 3) 2 / 31 Signature = mathematical
More informationStructured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov
Structured Light II Johannes Köhler Johannes.koehler@dfki.de Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov Introduction Previous lecture: Structured Light I Active Scanning Camera/emitter
More informationGeodesics in heat: A new approach to computing distance
Geodesics in heat: A new approach to computing distance based on heat flow Diana Papyan Faculty of Informatics - Technische Universität München Abstract In this report we are going to introduce new method
More information04 - Normal Estimation, Curves
04 - Normal Estimation, Curves Acknowledgements: Olga Sorkine-Hornung Normal Estimation Implicit Surface Reconstruction Implicit function from point clouds Need consistently oriented normals < 0 0 > 0
More informationParameterization of Meshes
2-Manifold Parameterization of Meshes What makes for a smooth manifold? locally looks like Euclidian space collection of charts mutually compatible on their overlaps form an atlas Parameterizations are
More informationGraphics. Automatic Efficient to compute Smooth Low-distortion Defined for every point Aligns semantic features. Other disciplines
Goal: Find a map between surfaces Blended Intrinsic Maps Vladimir G. Kim Yaron Lipman Thomas Funkhouser Princeton University Goal: Find a map between surfaces Automatic Efficient to compute Smooth Low-distortion
More informationScanning Real World Objects without Worries 3D Reconstruction
Scanning Real World Objects without Worries 3D Reconstruction 1. Overview Feng Li 308262 Kuan Tian 308263 This document is written for the 3D reconstruction part in the course Scanning real world objects
More informationCS 468 (Spring 2013) Discrete Differential Geometry
Lecturer: Adrian Butscher, Justin Solomon Scribe: Adrian Buganza-Tepole CS 468 (Spring 2013) Discrete Differential Geometry Lecture 19: Conformal Geometry Conformal maps In previous lectures we have explored
More informationAnalysis and Visualization of Maps Between Shapes
Volume xx (200y), Number z, pp. 1 10 Analysis and Visualization of Maps Between Shapes Maks Ovsjanikov 1 Mirela Ben-Chen 2 Frederic Chazal 3 Leonidas Guibas 4 1 LIX, Ecole Polytechnique 2 Technion Israel
More informationTopology-Invariant Similarity and Diffusion Geometry
1 Topology-Invariant Similarity and Diffusion Geometry Lecture 7 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 Intrinsic
More informationMultidimensional scaling
Multidimensional scaling Lecture 5 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 Cinderella 2.0 2 If it doesn t fit,
More information3D Computer Vision. Structured Light II. Prof. Didier Stricker. Kaiserlautern University.
3D Computer Vision Structured Light II Prof. Didier Stricker Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche Intelligenz http://av.dfki.de 1 Introduction
More informationSurface Parameterization
Surface Parameterization A Tutorial and Survey Michael Floater and Kai Hormann Presented by Afra Zomorodian CS 468 10/19/5 1 Problem 1-1 mapping from domain to surface Original application: Texture mapping
More informationGeometric Registration for Deformable Shapes 2.2 Deformable Registration
Geometric Registration or Deormable Shapes 2.2 Deormable Registration Variational Model Deormable ICP Variational Model What is deormable shape matching? Example? What are the Correspondences? Eurographics
More informationInvariant shape similarity. Invariant shape similarity. Invariant similarity. Equivalence. Equivalence. Equivalence. Equal SIMILARITY TRANSFORMATION
1 Invariant shape similarity Alexer & Michael Bronstein, 2006-2009 Michael Bronstein, 2010 tosca.cs.technion.ac.il/book 2 Invariant shape similarity 048921 Advanced topics in vision Processing Analysis
More informationLecture 6 Introduction to Numerical Geometry. Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2018
Lecture 6 Introduction to Numerical Geometry Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2018 Outline Introduction Basic concepts in geometry Discrete geometry Metric for discrete
More informationDense Non-Rigid Shape Correspondence using Random Forests
Dense Non-Rigid Shape Correspondence using Random Forests Emanuele Rodolà TU München rodola@in.tum.de Samuel Rota Bulò Fondazione Bruno Kessler Matthias Vestner TU München vestner@in.tum.de rotabulo@fbk.eu
More informationcalibrated coordinates Linear transformation pixel coordinates
1 calibrated coordinates Linear transformation pixel coordinates 2 Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration with partial
More information3D Geometry and Camera Calibration
3D Geometry and Camera Calibration 3D Coordinate Systems Right-handed vs. left-handed x x y z z y 2D Coordinate Systems 3D Geometry Basics y axis up vs. y axis down Origin at center vs. corner Will often
More informationAdvanced Computer Graphics
G22.2274 001, Fall 2009 Advanced Computer Graphics Project details and tools 1 Project Topics Computer Animation Geometric Modeling Computational Photography Image processing 2 Optimization All projects
More informationDiffusion Wavelets for Natural Image Analysis
Diffusion Wavelets for Natural Image Analysis Tyrus Berry December 16, 2011 Contents 1 Project Description 2 2 Introduction to Diffusion Wavelets 2 2.1 Diffusion Multiresolution............................
More informationDiscrete Geometry Processing
Non Convex Boundary Convex boundary creates significant distortion Free boundary is better Some slides from the Mesh Parameterization Course (Siggraph Asia 008) 1 Fixed vs Free Boundary Fixed vs Free Boundary
More informationNumerical Geometry of Nonrigid Shapes. CS 468, Spring 2013 Differential Geometry for Computer Science Justin Solomon and Adrian Butscher
Numerical Geometry of Nonrigid Shapes CS 468, Spring 2013 Differential Geometry for Computer Science Justin Solomon and Adrian Butscher Intrinsically far Extrinsically close Straightest Geodesics on Polyhedral
More informationFast marching methods
1 Fast marching methods Lecture 3 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 Metric discretization 2 Approach I:
More informationData fusion and multi-cue data matching using diffusion maps
Data fusion and multi-cue data matching using diffusion maps Stéphane Lafon Collaborators: Raphy Coifman, Andreas Glaser, Yosi Keller, Steven Zucker (Yale University) Part of this work was supported by
More informationImproved Functional Mappings via Product Preservation
EUROGRAPHICS 218 / D. Gutierrez and A. Sheffer (Guest Editors) Volume 37 (218), Number 2 Improved Functional Mappings via Product Preservation D. Nogneng 1, S. Melz, E. Rodolà 3, U. Castellan, M. Bronstein
More information1.7.1 Laplacian Smoothing
1.7.1 Laplacian Smoothing 320491: Advanced Graphics - Chapter 1 434 Theory Minimize energy functional total curvature estimate by polynomial-fitting non-linear (very slow!) 320491: Advanced Graphics -
More informationFor each question, indicate whether the statement is true or false by circling T or F, respectively.
True/False For each question, indicate whether the statement is true or false by circling T or F, respectively. 1. (T/F) Rasterization occurs before vertex transformation in the graphics pipeline. 2. (T/F)
More informationLarge Mesh Deformation Using the Volumetric Graph Laplacian
Large Mesh Deformation Using the Volumetric Graph Laplacian Kun Zhou1 Jin Huang2 John Snyder3 Xinguo Liu1 Hujun Bao2 Baining Guo1 Heung-Yeung Shum1 1 Microsoft Research Asia 2 Zhejiang University 3 Microsoft
More informationEasy modeling generate new shapes by deforming existing ones
Deformation I Deformation Motivation Easy modeling generate new shapes by deforming existing ones Motivation Easy modeling generate new shapes by deforming existing ones Motivation Character posing for
More informationShape Modeling and Geometry Processing
252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry
More informationLarge-Scale Face Manifold Learning
Large-Scale Face Manifold Learning Sanjiv Kumar Google Research New York, NY * Joint work with A. Talwalkar, H. Rowley and M. Mohri 1 Face Manifold Learning 50 x 50 pixel faces R 2500 50 x 50 pixel random
More informationDetection and Characterization of Intrinsic Symmetry of 3D Shapes
Detection and Characterization of Intrinsic Symmetry of 3D Shapes Anirban Mukhopadhyay Suchendra M. Bhandarkar Fatih Porikli Department of Visual Data Analysis, Zuse Institute Berlin, Berlin, Germany Department
More informationSurface Reconstruction from Unorganized Points
Survey of Methods in Computer Graphics: Surface Reconstruction from Unorganized Points H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, W. Stuetzle SIGGRAPH 1992. Article and Additional Material at: http://research.microsoft.com/en-us/um/people/hoppe/proj/recon/
More informationAdaptive Discrete Laplace Operator
Adaptive Discrete Laplace Operator Christophe Fiorio 1, Christian Mercat 2, and Frédéric Rieux 13 1 LIRMM, Université Montpellier 2, 161 rue Ada, F-34392 MONTPELLIER, FranceIREM, S2HEP, Université Claude
More informationDynamic Geometry Processing
Dynamic Geometry Processing EG 2012 Tutorial Will Chang, Hao Li, Niloy Mitra, Mark Pauly, Michael Wand Tutorial: Dynamic Geometry Processing 1 Articulated Global Registration Introduction and Overview
More informationAlgorithms for 3D Isometric Shape Correspondence
Algorithms for 3D Isometric Shape Correspondence Yusuf Sahillioğlu Computer Eng. Dept., Koç University, Istanbul, Turkey (PhD) Computer Eng. Dept., METU, Ankara, Turkey (Asst. Prof.) 2 / 53 Problem Definition
More informationTHIS paper presents the recent advances in mesh deformation
1 On Linear Variational Surface Deformation Methods Mario Botsch Computer Graphics Laboratory ETH Zurich Olga Sorkine Computer Graphics Group TU Berlin Abstract This survey reviews the recent advances
More informationLaplacian Meshes. COS 526 Fall 2016 Slides from Olga Sorkine and Yaron Lipman
Laplacian Meshes COS 526 Fall 2016 Slides from Olga Sorkine and Yaron Lipman Outline Differential surface representation Ideas and applications Compact shape representation Mesh editing and manipulation
More information2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into
2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into the viewport of the current application window. A pixel
More informationAnimating Transformations
Animating Transformations Connelly Barnes CS445: Graphics Acknowledgment: slides by Jason Lawrence, Misha Kazhdan, Allison Klein, Tom Funkhouser, Adam Finkelstein and David Dobkin Overview Rotations and
More informationTexture Mapping using Surface Flattening via Multi-Dimensional Scaling
Texture Mapping using Surface Flattening via Multi-Dimensional Scaling Gil Zigelman Ron Kimmel Department of Computer Science, Technion, Haifa 32000, Israel and Nahum Kiryati Department of Electrical Engineering
More informationComputer Vision I - Algorithms and Applications: Multi-View 3D reconstruction
Computer Vision I - Algorithms and Applications: Multi-View 3D reconstruction Carsten Rother 09/12/2013 Computer Vision I: Multi-View 3D reconstruction Roadmap this lecture Computer Vision I: Multi-View
More information10 - ARAP and Linear Blend Skinning
10 - ARAP and Linear Blend Skinning Acknowledgements: Olga Sorkine-Hornung As Rigid As Possible Demo Libigl demo 405 As-Rigid-As-Possible Deformation Preserve shape of cells covering the surface Ask each
More informationGeometric Modeling Assignment 3: Discrete Differential Quantities
Geometric Modeling Assignment : Discrete Differential Quantities Acknowledgements: Julian Panetta, Olga Diamanti Assignment (Optional) Topic: Discrete Differential Quantities with libigl Vertex Normals,
More informationParameterization II Some slides from the Mesh Parameterization Course from Siggraph Asia
Parameterization II Some slides from the Mesh Parameterization Course from Siggraph Asia 2008 1 Non-Convex Non Convex Boundary Convex boundary creates significant distortion Free boundary is better 2 Fixed
More informationCS233: The Shape of Data Handout # 3 Geometric and Topological Data Analysis Stanford University Wednesday, 9 May 2018
CS233: The Shape of Data Handout # 3 Geometric and Topological Data Analysis Stanford University Wednesday, 9 May 2018 Homework #3 v4: Shape correspondences, shape matching, multi-way alignments. [100
More informationShape-based Diffeomorphic Registration on Hippocampal Surfaces Using Beltrami Holomorphic Flow
Shape-based Diffeomorphic Registration on Hippocampal Surfaces Using Beltrami Holomorphic Flow Abstract. Finding meaningful 1-1 correspondences between hippocampal (HP) surfaces is an important but difficult
More informationReal-Time Shape Editing using Radial Basis Functions
Real-Time Shape Editing using Radial Basis Functions, Leif Kobbelt RWTH Aachen Boundary Constraint Modeling Prescribe irregular constraints Vertex positions Constrained energy minimization Optimal fairness
More informationVisual Tracking (1) Tracking of Feature Points and Planar Rigid Objects
Intelligent Control Systems Visual Tracking (1) Tracking of Feature Points and Planar Rigid Objects Shingo Kagami Graduate School of Information Sciences, Tohoku University swk(at)ic.is.tohoku.ac.jp http://www.ic.is.tohoku.ac.jp/ja/swk/
More informationCS 523: Computer Graphics, Spring Shape Modeling. Skeletal deformation. Andrew Nealen, Rutgers, /12/2011 1
CS 523: Computer Graphics, Spring 2011 Shape Modeling Skeletal deformation 4/12/2011 1 Believable character animation Computers games and movies Skeleton: intuitive, low-dimensional subspace Clip courtesy
More informationOverview. Spectral Processing of Point- Sampled Geometry. Introduction. Introduction. Fourier Transform. Fourier Transform
Overview Spectral Processing of Point- Sampled Geometry Introduction Fourier transform Spectral processing pipeline Spectral filtering Adaptive subsampling Summary Point-Based Computer Graphics Markus
More informationSOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS
SOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS JIAN LIANG AND HONGKAI ZHAO Abstract. In this paper we present a general framework for solving partial differential equations on manifolds represented
More informationQuaternions and Exponentials
Quaternions and Exponentials Michael Kazhdan (601.457/657) HB A.6 FvDFH 21.1.3 Announcements OpenGL review II: Today at 9:00pm, Malone 228 This week's graphics reading seminar: Today 2:00-3:00pm, my office
More informationGeometric Modeling Summer Semester 2012 Point-Based Modeling
Geometric Modeling Summer Semester 2012 Point-Based Modeling 3D Scanning MLS-Surfaces Reconstruction & Registration Overview... Topics: Subdivision Surfaces Implicit Functions Variational Modeling Point-Based
More informationVisual Representations for Machine Learning
Visual Representations for Machine Learning Spectral Clustering and Channel Representations Lecture 1 Spectral Clustering: introduction and confusion Michael Felsberg Klas Nordberg The Spectral Clustering
More informationSurface Registration. Gianpaolo Palma
Surface Registration Gianpaolo Palma The problem 3D scanning generates multiple range images Each contain 3D points for different parts of the model in the local coordinates of the scanner Find a rigid
More informationCS 523: Computer Graphics, Spring Differential Geometry of Surfaces
CS 523: Computer Graphics, Spring 2009 Shape Modeling Differential Geometry of Surfaces Andrew Nealen, Rutgers, 2009 3/4/2009 Recap Differential Geometry of Curves Andrew Nealen, Rutgers, 2009 3/4/2009
More informationSkeletal deformation
CS 523: Computer Graphics, Spring 2009 Shape Modeling Skeletal deformation 4/22/2009 1 Believable character animation Computers games and movies Skeleton: intuitive, low dimensional subspace Clip courtesy
More informationarxiv: v1 [cs.gr] 28 Sep 2013
Detection and Characterization of Intrinsic Symmetry ANIRBAN MUKHOPADHYAY and SUCHENDRA M. BHANDARKAR Department of Computer Science, The University of Georgia, Athens, GA 30602-7404, USA and FATIH PORIKLI
More informationFinding Structure in Large Collections of 3D Models
Finding Structure in Large Collections of 3D Models Vladimir Kim Adobe Research Motivation Explore, Analyze, and Create Geometric Data Real Virtual Motivation Explore, Analyze, and Create Geometric Data
More informationTopological Function Optimization for Continuous Shape Matching
Eurographics Symposium on Geometry Processing 28 T. Ju and A. Vaxman (Guest Editors) Volume 37 (28), Number 5 Topological Function Optimization for Continuous Shape Matching Adrien Poulenard, Primoz Skraba
More informationTracking system. Danica Kragic. Object Recognition & Model Based Tracking
Tracking system Object Recognition & Model Based Tracking Motivation Manipulating objects in domestic environments Localization / Navigation Object Recognition Servoing Tracking Grasping Pose estimation
More informationIntroduction to Computer Graphics
Introduction to Computer Graphics 2016 Spring National Cheng Kung University Instructors: Min-Chun Hu 胡敏君 Shih-Chin Weng 翁士欽 ( 西基電腦動畫 ) Data Representation Curves and Surfaces Limitations of Polygons Inherently
More informationShape Matching for 3D Retrieval and Recognition. Agenda. 3D collections. Ivan Sipiran and Benjamin Bustos
Shape Matching for 3D Retrieval and Recognition Ivan Sipiran and Benjamin Bustos PRISMA Research Group Department of Computer Science University of Chile Agenda Introduction Applications Datasets Shape
More information05 - Surfaces. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Daniele Panozzo
05 - Surfaces Acknowledgements: Olga Sorkine-Hornung Reminder Curves Turning Number Theorem Continuous world Discrete world k: Curvature is scale dependent is scale-independent Discrete Curvature Integrated
More informationStereo and Epipolar geometry
Previously Image Primitives (feature points, lines, contours) Today: Stereo and Epipolar geometry How to match primitives between two (multiple) views) Goals: 3D reconstruction, recognition Jana Kosecka
More informationMinimum-Distortion Isometric Shape Correspondence Using EM Algorithm
1 Minimum-Distortion Isometric Shape Correspondence Using EM Algorithm Yusuf Sahillioğlu and Yücel Yemez Abstract We present a purely isometric method that establishes 3D correspondence between two (nearly)
More informationA Segmentation of Non-rigid Shape with Heat Diffuse
2012 4th International Conference on Signal Processing Systems (ICSPS 2012) IPCSIT vol. 58 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V58.6 A Segmentation of Non-rigid Shape with Heat
More informationTowards Multi-scale Heat Kernel Signatures for Point Cloud Models of Engineering Artifacts
Towards Multi-scale Heat Kernel Signatures for Point Cloud Models of Engineering Artifacts Reed M. Williams and Horea T. Ilieş Department of Mechanical Engineering University of Connecticut Storrs, CT
More informationCSE 554 Lecture 6: Fairing and Simplification
CSE 554 Lecture 6: Fairing and Simplification Fall 2012 CSE554 Fairing and simplification Slide 1 Review Iso-contours in grayscale images and volumes Piece-wise linear representations Polylines (2D) and
More informationRobust Structure-based Shape Correspondence. Yanir Kleiman and Maks Ovsjanikov. LIX, Ecole Polytechnique, UMR CNRS
Volume xx (200y), Number z, pp. 1 13 Robust Structure-based Shape Correspondence Yanir Kleiman and Maks Ovsjanikov LIX, Ecole Polytechnique, UMR CNRS arxiv:1710.05592v2 [cs.gr] 4 Mar 2018 Abstract We present
More informationShape Matching for 3D Retrieval and Recognition
Shape Matching for 3D Retrieval and Recognition PRISMA Research Group Department of Computer Science University of Chile SIBGRAPI 2013 Tutorial, Arequipa - Perú, August 5, 2013 Outline Introduction 1 Introduction
More informationVector Algebra Transformations. Lecture 4
Vector Algebra Transformations Lecture 4 Cornell CS4620 Fall 2008 Lecture 4 2008 Steve Marschner 1 Geometry A part of mathematics concerned with questions of size, shape, and relative positions of figures
More information3D Point Cloud Processing
3D Point Cloud Processing The image depicts how our robot Irma3D sees itself in a mirror. The laser looking into itself creates distortions as well as changes in intensity that give the robot a single
More informationSIFT - scale-invariant feature transform Konrad Schindler
SIFT - scale-invariant feature transform Konrad Schindler Institute of Geodesy and Photogrammetry Invariant interest points Goal match points between images with very different scale, orientation, projective
More informationJustin Solomon MIT, Spring Numerical Geometry of Nonrigid Shapes
Justin Solomon MIT, Spring 2017 Numerical Geometry of Nonrigid Shapes Intrinsically far Extrinsically close Geodesic distance [jee-uh-des-ik dis-tuh-ns]: Length of the shortest path, constrained not to
More informationIntroduction to geometry
1 2 Manifolds A topological space in which every point has a neighborhood homeomorphic to (topological disc) is called an n-dimensional (or n-) manifold Introduction to geometry The German way 2-manifold
More informationPosture Invariant Surface Description and Feature Extraction
Posture Invariant Surface Description and Feature Extraction Stefanie Wuhrer 1 Zouhour Ben Azouz 2 Chang Shu 1 Abstract We propose a posture invariant surface descriptor for triangular meshes. Using intrinsic
More informationEfficient 3D shape co-segmentation from single-view point clouds using appearance and isometry priors
Efficient 3D shape co-segmentation from single-view point clouds using appearance and isometry priors Master thesis Nikita Araslanov Compute Science Institute VI University of Bonn March 29, 2016 Nikita
More informationA Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching
International Journal of Computer Vision manuscript No. (will be inserted by the editor) A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching Alexander
More informationCoupled Functional Maps
Coupled Functional Maps Davide Eynard Emanuele Rodolà Klaus Glashoff Michael M. Bronstein USI Lugano Tel Aviv University Intel {davide.eynard, emanuele.rodola, klaus.glashoff, michael.bronstein}@usi.ch
More informationTwo-View Geometry (Course 23, Lecture D)
Two-View Geometry (Course 23, Lecture D) Jana Kosecka Department of Computer Science George Mason University http://www.cs.gmu.edu/~kosecka General Formulation Given two views of the scene recover the
More information