Scale Normalization for Isometric Shape Matching Yusuf Sahillioğlu and Yücel Yemez Computer Eng. Dept., Koç University, Istanbul, Turkey.

Slides:

Advertisements

Similar presentations

1 Registration of 3D Faces Leow Wee Kheng CS6101 AY Semester 1.

Advertisements

 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --

3D Morphing using Multiplanar Representation

Multiple Shape Correspondence by Dynamic Programming Yusuf Sahillioğlu 1 and Yücel Yemez 2 Pacific Graphics 2014 Computer Eng. Depts, 1, 2, Turkey.

Face Alignment with Part-Based Modeling

Modeling the Shape of People from 3D Range Scans

Presented by: Mingyuan Zhou Duke University, ECE April 3, 2009

Topology-Invariant Similarity and Diffusion Geometry

Discrete Geometry Tutorial 2 1

Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau

6/26/2006CGI'06, Hangzhou China1 Sub-sampling for Efficient Spectral Mesh Processing Rong Liu, Varun Jain and Hao Zhang GrUVi lab, Simon Fraser University,

1 Michael Bronstein Computational metric geometry Computational metric geometry Michael Bronstein Department of Computer Science Technion – Israel Institute.

An Optimization Approach to Improving Collections of Shape Maps Andy Nguyen, Mirela Ben-Chen, Katarzyna Welnicka, Yinyu Ye, Leonidas Guibas Computer Science.

Asst. Prof. Yusuf Sahillioğlu

CENG 789 – Digital Geometry Processing 01- Introduction Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.

CENG 789 – Digital Geometry Processing 05- Smoothing and Remeshing

Asst. Prof. Yusuf Sahillioğlu

CENG 789 – Digital Geometry Processing 06- Rigid-Body Alignment Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.

1 Bronstein 2 and Kimmel Extrinsic and intrinsic similarity of nonrigid shapes Michael M. Bronstein Department of Computer Science Technion – Israel Institute.

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.

Slide 1 EE3J2 Data Mining Lecture 16 Unsupervised Learning Ali Al-Shahib.

1 Numerical geometry of non-rigid shapes Lecture II – Numerical Tools Numerical geometry of shapes Lecture II – Numerical Tools non-rigid Alex Bronstein.

1 Bronstein, Bronstein, and Kimmel Joint extrinsic and intrinsic similarity of non-rigid shapes Rock, paper, and scissors Joint extrinsic and intrinsic.

Non-Euclidean Embedding

A Global Geometric Framework for Nonlinear Dimensionality Reduction Joshua B. Tenenbaum, Vin de Silva, John C. Langford Presented by Napat Triroj.

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,

Atul Singh Junior Undergraduate CSE, IIT Kanpur.  Dimension reduction is a technique which is used to represent a high dimensional data in a more compact.

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 Bronstein 2 & Kimmel Matching 2D articulated shapes using GMDS AMDO, Puerto de Andratx, 2006 Matching 2D articulated shapes using Generalized Multidimensional.

CSci 6971: Image Registration Lecture 5: Feature-Base Regisration January 27, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart,

1 M. Bronstein Multigrid multidimensional scaling Multigrid Multidimensional Scaling Michael M. Bronstein Department of Computer Science Technion – Israel.

Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University

Algorithms for 3D Isometric Shape Correspondence Yusuf Sahillioğlu Computer Eng. Dept., Koç University, Istanbul, Turkey.

Intrinsic Parameterization for Surface Meshes Mathieu Desbrun, Mark Meyer, Pierre Alliez CS598MJG Presented by Wei-Wen Feng 2004/10/5.

Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.

Functional maps: A Flexible Representation of Maps Between Shapes SIGGRAPH 2012 Maks Ovsjanikov 1 Mirela Ben-Chen 2 Justin Solomon 2 Adrian Butscher 2.

Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence Yusuf Sahillioğlu and Yücel Yemez Computer Eng. Dept., Koç University, Istanbul,

Mesh Deformation Based on Discrete Differential Geometry Reporter: Zhongping Ji

Expression-invariant Face Recognition using Geodesic Distance Isometries Kerry Widder A Review of ‘Robust expression-invariant face recognition from partially.

SISAP’08 – Approximate Similarity Search in Genomic Sequence Databases using Landmark-Guided Embedding Ahmet Sacan and I. Hakki Toroslu

Computer Vision Lab. SNU Young Ki Baik Nonlinear Dimensionality Reduction Approach (ISOMAP, LLE)

Multidimensional Scaling Vuokko Vuori Based on: Data Exploration Using Self-Organizing Maps, Samuel Kaski, Ph.D. Thesis, 1997 Multivariate Statistical.

AS-RIGID-AS-POSSIBLE SHAPE MANIPULATION

Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.

Object Recognition Based on Shape Similarity Longin Jan Latecki Computer and Information Sciences Dept. Temple Univ.,

Jan Kamenický.  Many features ⇒ many dimensions  Dimensionality reduction ◦ Feature extraction (useful representation) ◦ Classification ◦ Visualization.

Spectral Sequencing Based on Graph Distance Rong Liu, Hao Zhang, Oliver van Kaick {lrong, haoz, cs.sfu.ca {lrong, haoz, cs.sfu.ca.

CENG 789 – Digital Geometry Processing 04- Distances, Descriptors and Sampling on Meshes Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.

Skuller: A volumetric shape registration algorithm for modeling skull deformities Yusuf Sahillioğlu 1 and Ladislav Kavan 2 Medical Image Analysis 2015.

Methods for 3D Shape Matching and Retrieval

Using the Particle Filter Approach to Building Partial Correspondences between Shapes Rolf Lakaemper, Marc Sobel Temple University, Philadelphia,PA,USA.

1 Numerical geometry of non-rigid shapes Projects Quasi-isometries Project 1 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry.

Data Visualization Fall The Data as a Quantity Quantities can be classified in two categories: Intrinsically continuous (scientific visualization,

CSC321: Lecture 25: Non-linear dimensionality reduction Geoffrey Hinton.

CENG 789 – Digital Geometry Processing 07- Rigid-Body Alignment Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.

Clustering Wei Wang. Outline What is clustering Partitioning methods Hierarchical methods Density-based methods Grid-based methods Model-based clustering.

CENG 789 – Digital Geometry Processing 10- Data-Driven Shape Analysis

CSC321: Extra Lecture (not on the exam) Non-linear dimensionality reduction Geoffrey Hinton.

Algorithms for 3D Isometric Shape Correspondence

CENG 789 – Digital Geometry Processing 08- Rigid-Body Alignment

Assoc. Prof. Yusuf Sahillioğlu

CENG 789 – Digital Geometry Processing 10- Least-Squares Solutions

Spectral Methods Tutorial 6 1 © Maks Ovsjanikov

Scale-Space Representation for Matching of 3D Models

Clustering Wei Wang.

CENG 789 – Digital Geometry Processing 09- Rigid-Body Alignment

CENG 789 – Digital Geometry Processing 11- Least-Squares Solutions

Calibration and homographies

Presentation transcript:

Scale Normalization for Isometric Shape Matching Yusuf Sahillioğlu and Yücel Yemez Computer Eng. Dept., Koç University, Istanbul, Turkey

Problem Definition & Scope 2 / 22 Scale problem inherent to isometric shape correspondence. Scale normalization tested by shape correspondence. One shape is an isometric part of the other up to an arbitrary scale. Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Motivation 3 / 22 Shape interpolation, animation. Shape registration. Shape recognition. Time-varying reconstruction. Statistical shape analysis. Mapping between two shapes initiates cool apps. Attribute transfer. Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Contributions A novel scale-invariant isometric distortion function. Embedding avoided. Correspondences are partial and dense at the same time. No restriction on topology and triangulation type. 4 / 22 Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Isometry Our method is purely isometric. Intrinsic global property. Similar shapes have similar metric structures. Metric: geodesic distance. 5 / 22 Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Scale Normalization Scale normalization to prepare geodesic distances for the upcoming isometric distortion computations. 6 / 22 Complete shapes (scale by max geodesic)Partial shapes (max geodesic based normalization fails) Partial shapes (scale by trusted matches)Partial shapes (scale by Euclidean embedding, e.g., Möbius) Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Isometric Distortion Given, measure its isometric distortion: O(N 2 ) for a map of size N. 7 / 22 in the most general setting. : normalized geodesic distance b/w two vertices. Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Isometric Distortion 8 / 22 g g gg g g g g average for. in action: Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Scale-invariant Isometric Distortion Given, measure its scale-inv. isometric distortion: This measure based on raw geodesics provides few trusted matches to be used in scale normalization. O(N 3 ) for a map of size N. 9 / 22 : raw geodesic distance b/w two vertices. Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Scale-invariant Isometric Distortion 10 / 22 in action: average for. Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Minimizing Isometric Distortion 11 / 22 Optimization for completely isometric shapes. Optimization for partially isometric shapes. Covers complete shape matching naturally. Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Shape Matching Algorithm Combinatorial optimization of for initial coarse correspondence. The most extreme M source vertices are matched w/ |T| target extremities in the guidance of scale-inv. isometric distortion measure. computational complexity where we set M=5. 12 / 22 Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Shape Matching Algorithm Two isometric distortion measures in action. Scale-invariant isometric distortion. Isometric distortion w/ normalized geodesics. 13 / 22 Winner Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Shape Matching Algorithm Use initial coarse correspondence to bring the meshes to the same scale. Scale the target mesh by Dense sampling. 14 / here Same radius Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Shape Matching Algorithm Dense matching. Minimum-weight perfect matching on cost matrix C. c i,j = cost of matching s i to t j //generating is traversed by (s i, t j ). Symmetric flip caring: repeat above (scaling, sampling, matching) with K-1 more generating initial coarse correspondences that follow in sorted distortions list. 15 / 22 Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Computational Complexity 16 / 22 Initial coarse correspondence: Extension to dense map of size U : which also requires dense sampling. Initial coarse correspondence dominates all. Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Isometric part matching. Results 17 / 22 Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Also for complete matching and for pairs w/ incompatible max geodesics. Results 18 / 22 Comparison w/ Möbius Voting (MV). Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, MV: bad extremity matching, triangulation-sensitive.

Different choices of M. Results 19 / 22 Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, Too small. computation less reliable. Too large. High computational load. Inconsistent joint sampling.

20 / 22 Limitation & Future Work Presence of uncommon parts may fail this framework which forces to match M=5 most extremes as a whole. Embedding into a more sophisticated framework should help as it handles arbitrary scaling of the similar parts to be matched. Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

Conclusion 21 / 22 A novel scale normalization method that proves useful for isometric partial and complete correspondence. Scale-invariant isometric distortion minimized in the original 3D Euclidean space wherein isometry is defined. So does dense isometric matching. Correspondences are partial and dense at the same time. Care for symmetric flips. No restriction on topology and triangulation. Applicable in its current form to 3D part retrieval problem. Yusuf Sahillioğlu & Yücel Yemez, Scale Normalization for Isometric Shape Matching, Pacific Graphics, 2012.

People Assoc. Prof. Yücel Yemez, supervisor Yusuf, PhD student 22 / 22