1 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Matching 2D articulated shapes using Generalized Multidimensional.

Slides:



Advertisements
Similar presentations
Fast Marching on Triangulated Domains
Advertisements

1 Numerical geometry of non-rigid shapes Introduction Introduction Alexander Bronstein, Michael Bronstein © 2008 All rights reserved. Web: tosca.cs.technion.ac.il.
Spectral methods 1 © Alexander & Michael Bronstein,
Multiple Shape Correspondence by Dynamic Programming Yusuf Sahillioğlu 1 and Yücel Yemez 2 Pacific Graphics 2014 Computer Eng. Depts, 1, 2, Turkey.
1 Michael Bronstein Heat diffusion descriptors deformable Michael Bronstein Weizmann Institute of Science, 4 November 2010 Institute of Computational Science.
Presented by: Mingyuan Zhou Duke University, ECE April 3, 2009
Topology-Invariant Similarity and Diffusion Geometry
1 Numerical Geometry of Non-Rigid Shapes Diffusion Geometry Diffusion geometry © Alexander & Michael Bronstein, © Michael Bronstein, 2010 tosca.cs.technion.ac.il/book.
Discrete Geometry Tutorial 2 1
Isometry-Invariant Similarity
1 Numerical geometry of non-rigid shapes Geometry Numerical geometry of non-rigid shapes Shortest path problems Alexander Bronstein, Michael Bronstein,
1 Numerical geometry of non-rigid shapes Consistent approximation of geodesics in graphs Consistent approximation of geodesics in graphs Tutorial 3 © Alexander.
Shape reconstruction and inverse problems
Invariant correspondence
1 Processing & Analysis of Geometric Shapes Shortest path problems Shortest path problems The discrete way © Alexander & Michael Bronstein, ©
1 Michael Bronstein Shapes as metric spaces: deformation-invariant similarity Michael Bronstein Computational metric geometry: an old new tool in image.
1 Michael Bronstein Computational metric geometry Computational metric geometry Michael Bronstein Department of Computer Science Technion – Israel Institute.
1 Numerical geometry of non-rigid shapes Partial similarity Partial similarity © Alexander & Michael Bronstein, © Michael Bronstein, 2010 tosca.cs.technion.ac.il/book.
1 Processing & Analysis of Geometric Shapes Introduction Processing and Analysis of Geometric Shapes Department of Electrical Engineering – Technion Spring.
Multidimensional scaling
Scale Normalization for Isometric Shape Matching Yusuf Sahillioğlu and Yücel Yemez Computer Eng. Dept., Koç University, Istanbul, Turkey.
Isometry invariant similarity
1 Michael Bronstein 3D face recognition Face recognition: New technologies, new challenges Michael M. Bronstein.
1 Numerical geometry of non-rigid shapes Lecture I – Introduction Numerical geometry of shapes Lecture I – Introduction non-rigid Michael Bronstein.
Spectral embedding Lecture 6 1 © Alexander & Michael Bronstein
Numerical geometry of non-rigid shapes
Numerical geometry of objects
1 Bronstein 2 and Kimmel Extrinsic and intrinsic similarity of nonrigid shapes Michael M. Bronstein Department of Computer Science Technion – Israel Institute.
Lecture IV – Invariant Correspondence
1 Numerical geometry of non-rigid shapes Mathematical background Mathematical background Tutorial 1 © Maks Ovsjanikov, Alex & Michael Bronstein tosca.cs.technion.ac.il/book.
Correspondence & Symmetry
1 Numerical geometry of non-rigid shapes Partial similarity Partial Similarity Alexander Bronstein, Michael Bronstein © 2008 All rights reserved. Web:
1 Numerical geometry of non-rigid shapes Spectral Methods Tutorial. Spectral Methods Tutorial 6 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical.
1 Numerical geometry of non-rigid shapes Lecture II – Numerical Tools Numerical geometry of shapes Lecture II – Numerical Tools non-rigid Alex Bronstein.
Spectral Embedding Alexander Bronstein, Michael Bronstein
Numerical geometry of non-rigid shapes
1 Numerical geometry of non-rigid shapes A journey to non-rigid world objects Invariant correspondence and shape synthesis non-rigid Alexander Bronstein.
1 Bronstein, Bronstein, and Kimmel Joint extrinsic and intrinsic similarity of non-rigid shapes Rock, paper, and scissors Joint extrinsic and intrinsic.
Invariant Correspondence
1 Regularized partial similarity of shapes NORDIA – CVPR 2008 Not only size matters: Regularized partial similarity of shapes Alexander Bronstein, Michael.
1 Numerical geometry of non-rigid shapes A journey to non-rigid world objects Numerical methods non-rigid Alexander Bronstein Michael Bronstein Numerical.
Non-Euclidean Embedding
1 Numerical geometry of non-rigid shapes Introduction Numerical geometry of non-rigid shapes Introduction Alexander Bronstein, Michael Bronstein, Ron Kimmel.
1 Numerical geometry of non-rigid shapes Numerical Geometry Numerical geometry of non-rigid shapes Numerical geometry Alexander Bronstein, Michael Bronstein,
Flattening via Multi- Dimensional Scaling Ron Kimmel Computer Science Department Geometric Image Processing Lab Technion-Israel.
Numerical geometry of non-rigid shapes
Paretian similarity for partial comparison of non-rigid objects
1 Bronstein 2 & Kimmel An isometric model for facial animation and beyond AMDO, Puerto de Andratx, 2006 An isometric model for facial animation and beyond.
1 Numerical Geometry of Non-Rigid Shapes Invariant shape similarity Invariant shape similarity © Alexander & Michael Bronstein, © Michael Bronstein,
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
1 Numerical geometry of non-rigid shapes Expression-invariant face recognition Expression-invariant face recognition Lecture 8 © Alexander & Michael Bronstein.
1 Numerical geometry of non-rigid shapes Three-Dimensional Face Recognition Three Dimensional Face Recognition “And in stature he is small, chest broad,
1 Michael M. Bronstein Partial similarity of objects 17 December 2006 Partial similarity of objects, or how to compare a centaur to a horse Michael M.
1 M. Bronstein Multigrid multidimensional scaling Multigrid Multidimensional Scaling Michael M. Bronstein Department of Computer Science Technion – Israel.
1 Numerical geometry of non-rigid shapes Non-rigid correspondence Numerical geometry of non-rigid shapes Non-rigid correspondence Alexander Bronstein,
1 Numerical geometry of non-rigid shapes Nonrigid Correspondence & Calculus of Shapes Non-Rigid Correspondence and Calculus of Shapes Of bodies changed.
1 M. Bronstein | Expression-invariant representation of faces and its applications for face recognition Expression-invariant representation of faces and.
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
Matching 3D Shapes Using 2D Conformal Representations Xianfeng Gu 1, Baba Vemuri 2 Computer and Information Science and Engineering, Gainesville, FL ,
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence Yusuf Sahillioğlu and Yücel Yemez Computer Eng. Dept., Koç University, Istanbul,
Expression-invariant Face Recognition using Geodesic Distance Isometries Kerry Widder A Review of ‘Robust expression-invariant face recognition from partially.
Scalable and Fully Distributed Localization With Mere Connectivity.
Tony Jebara, Columbia University Advanced Machine Learning & Perception Instructor: Tony Jebara.
Lower Bounds for Embedding Edit Distance into Normed Spaces A. Andoni, M. Deza, A. Gupta, P. Indyk, S. Raskhodnikova.
1 Numerical geometry of non-rigid shapes Projects Quasi-isometries Project 1 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry.
Qifeng Chen Stanford University Vladlen Koltun Intel Labs.
Morphing and Shape Processing
Haim Kaplan and Uri Zwick
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
Presentation transcript:

1 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Matching 2D articulated shapes using Generalized Multidimensional Scaling Michael M. Bronstein Department of Computer Science Technion – Israel Institute of Technology

2 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Co-authors Ron KimmelAlex Bronstein

3 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Main problems Comparison of articulated shapesComparison of partially-missing articulated shapes Local differences between shapesCorrespondence between articulated shapes

4 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Ideal articulated shape Two-dimensional shape Geodesic distances induced by the boundary Consists of rigid parts and point joins Space of ideal articulated shapes Articulation: an isometric deformation such that ISOMETRY

5 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, articulated shape Rigid parts and joints with Space of -articulated shapes: Articulation: an -isometry such that -ISOMETRY

6 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Articulation-invariant distance A distance between articulated shapes should satisfy: Non-negativity: Symmetry: Triangle inequality: Articulation invariance: for all and all articulations of Dissimilarity: if, then there do not exist and two articulations of such that and Consistency to sampling: if and are finite -coverings of and, then Efficiency: can be efficiently computed

7 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Canonical forms distance (I) A. Elad, R. Kimmel, CVPR 2001 H. Ling, D. Jacobs, CVPR 2005 Embed and into a common metric space by minimum- distortion embeddings and compare the images (“canonical forms”)

8 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Approximately articulation invariant Approximately consistent to sampling Efficient computation using multidimensional scaling (MDS) A. Elad, R. Kimmel, CVPR 2001 Given a sampling the minimum-distortion embedding is found by optimizing over the images and not on itself Canonical forms distance (II)

9 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Gromov-Hausdorff distance M. Gromov, 1981 Allow for an arbitrary embedding space A metric on the space Consistent to sampling: if and are -coverings of and, Computation: untractable

10 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Computing the Gromov-Hausdorff distance (I) F. Mémoli, G. Sapiro, Foundations Comp. Math, 2005 Equivalent definition in terms of metric distortions: Replace with a simpler expression Probabilistic bound on the error Combinatorial problem Mémoli & Sapiro (2005) Where:

11 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006B 2 K, PNAS 2006 Given the samplings and, the minimum-distortion embeddings are found by optimizing over the images and The Gromov-Hausdorff distance is essentially a problem of finding minimum-distortion maps between and, and can be computed in an MDS-like spirit Computing the Gromov-Hausdorff distance (II)

12 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Generalized multidimensional scaling (GMDS) The distances have no analytic expression and must be approximated numerically Multiresolution scheme to prevent local convergence -norm can be used instead of for a more robust computation B 2 K, PNAS 2006 G MDS:

13 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Example I – comparison of shapes

14 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Similarity patterns between different articulated shapes Example I – comparison of shapes

15 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Adding another axiom… Partial matching: If is a convex cut of, then Partial matching is non-symmetric: some properties must be sacrificed Convex cut guarantees

16 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Triangle inequality

17 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006Illustration: Herluf Bidstrup The danger of partial matching does not necessarily imply that But: if is an -covering of, then

18 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Partial embedding distance (I) Use the distortion as a measure of partial similarity B 2 K, PNAS 2006 Non-symmetric Allows for partial matching Consistent to sampling In the discrete setting, posed as a GMDS problem Computationally efficient

19 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Example – partial matching

20 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Local comparison B 2 K, PNAS 2006 Use the contribution of a single point to the distortion as a measure of local difference between the shapes, or local distortion

21 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Example – local differences

22 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Summary Isometric model of articulated shape Axiomatic approach to comparison of shapes Partial matching and correspondence GMDS - a generic tool for shape recognition and matching

23 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, D example B 2 K, SIAM J. Sci. Comp, to appear

24 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Canonical forms distance (MDS, 500 points) Gromov-Hausdorff distance (GMDS, 50 points) 3D example B 2 K, SIAM J. Sci. Comp, to appear