Spectral Global Intrinsic Symmetry Invariant Functions Hui Wang Shijiazhuang Tiedao University Patricio Simari The Catholic University of America Zhixun.

Slides:



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

Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.
Scale & Affine Invariant Interest Point Detectors Mikolajczyk & Schmid presented by Dustin Lennon.
3D Geometry for Computer Graphics
3-D Computer Vision CSc83020 / Ioannis Stamos  Revisit filtering (Gaussian and Median)  Introduction to edge detection 3-D Computater Vision CSc
Presented by Xinyu Chang
Active Contours, Level Sets, and Image Segmentation
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Junjie Cao 1, Andrea Tagliasacchi 2, Matt Olson 2, Hao Zhang 2, Zhixun Su 1 1 Dalian University of Technology 2 Simon Fraser University Point Cloud Skeletons.
Spectral methods 1 © Alexander & Michael Bronstein,
1 Michael Bronstein Heat diffusion descriptors deformable Michael Bronstein Weizmann Institute of Science, 4 November 2010 Institute of Computational Science.
IDEAL 2005, 6-8 July, Brisbane Multiresolution Analysis of Connectivity Atul Sajjanhar, Deakin University, Australia Guojun Lu, Monash University, Australia.
Persistent Heat Signature for Pose-oblivious Matching of Incomplete Models Tamal K. Dey, Kuiyu Li, Chuanjiang Luo, Pawas Ranjan, Issam Safa, Yusu Wang.
Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.
1 Numerical Geometry of Non-Rigid Shapes Diffusion Geometry Diffusion geometry © Alexander & Michael Bronstein, © Michael Bronstein, 2010 tosca.cs.technion.ac.il/book.
November 4, 2014Computer Vision Lecture 15: Shape Representation II 1Signature Another popular method of representing shape is called the signature. In.
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,
Asst. Prof. Yusuf Sahillioğlu
Shape-Based Retrieval of Articulated 3D Models Using Spectral Embedding GrUVi Lab, School of Computing Science Simon Fraser University, Burnaby, BC Canada.
Hierarchical Region-Based Segmentation by Ratio-Contour Jun Wang April 28, 2004 Course Project of CSCE 790.
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 II SIZE FUNCTIONS:
Image Filtering CS485/685 Computer Vision Prof. George Bebis.
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.
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
Spectral Mesh Processing
What is So Spectral? SIGGRAPH 2010 Course Spectral Mesh Processing
CS 376b Introduction to Computer Vision 03 / 04 / 2008 Instructor: Michael Eckmann.
© 2010 Cengage Learning Engineering. All Rights Reserved.
Computational Photography: Image Processing Jinxiang Chai.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
Chapter 2. Image Analysis. Image Analysis Domains Frequency Domain Spatial Domain.
Dual Evolution for Geometric Reconstruction Huaiping Yang (FSP Project S09202) Johannes Kepler University of Linz 1 st FSP-Meeting in Graz, Nov ,
Functional maps: A Flexible Representation of Maps Between Shapes SIGGRAPH 2012 Maks Ovsjanikov 1 Mirela Ben-Chen 2 Justin Solomon 2 Adrian Butscher 2.
Modal Shape Analysis beyond Laplacian (CAGP 2012) Klaus Hildebrandt, Christian Schulz, Christoph von Tycowicz, Konrad Polthier (brief) Presenter: ShiHao.Wu.
TEMPLATE BASED SHAPE DESCRIPTOR Raif Rustamov Department of Mathematics and Computer Science Drew University, Madison, NJ, USA.
Mesh Deformation Based on Discrete Differential Geometry Reporter: Zhongping Ji
Computer Vision Lecture 5. Clustering: Why and How.
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Image processing.
Non-Euclidean Example: The Unit Sphere. Differential Geometry Formal mathematical theory Work with small ‘patches’ –the ‘patches’ look Euclidean Do calculus.
Roee Litman, Alexander Bronstein, Michael Bronstein
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Visual Categorization With Bags of Keypoints Original Authors: G. Csurka, C.R. Dance, L. Fan, J. Willamowski, C. Bray ECCV Workshop on Statistical Learning.
2005/12/021 Content-Based Image Retrieval Using Grey Relational Analysis Dept. of Computer Engineering Tatung University Presenter: Tienwei Tsai ( 蔡殿偉.
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.
Klein-Gordon Equation in the Gravitational Field of a Charged Point Source D.A. Georgieva, S.V. Dimitrov, P.P. Fiziev, T.L. Boyadjiev Gravity, Astrophysics.
CDS 301 Fall, 2008 Image Visualization Chap. 9 November 11, 2008 Jie Zhang Copyright ©
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Computer vision. Applications and Algorithms in CV Tutorial 3: Multi scale signal representation Pyramids DFT - Discrete Fourier transform.
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.
3D Geometry for Computer Graphics Class 3. 2 Last week - eigendecomposition A We want to learn how the transformation A works:
Mesh Segmentation via Spectral Embedding and Contour Analysis Speaker: Min Meng
1 Shape Descriptors for Maximally Stable Extremal Regions Per-Erik Forss´en and David G. Lowe Department of Computer Science University of British Columbia.
Rongjie Lai University of Southern California Joint work with: Jian Liang, Alvin Wong, Hongkai Zhao 1 Geometric Understanding of Point Clouds using Laplace-Beltrami.
By Poornima Balakrishna Rajesh Ganesan George Mason University A Comparison of Classical Wavelet with Diffusion Wavelets.
Qifeng Chen Stanford University Vladlen Koltun Intel Labs.
Spectral Methods for Dimensionality
Intrinsic Data Geometry from a Training Set
Mikhail Belkin Dept. of Computer Science Ohio State University
Throat quantization of the Schwarzschild-Tangherlini(-AdS) black hole
Image gradients and edges
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
Fourier Transform of Boundaries
Continuous Random Variables: Basics
Presentation transcript:

Spectral Global Intrinsic Symmetry Invariant Functions Hui Wang Shijiazhuang Tiedao University Patricio Simari The Catholic University of America Zhixun Su Dalian University of Technology Hao Zhang Simon Fraser University

Introduction Global Intrinsic Symmetry Invariant Functions (GISIFs) are functions defined on a manifold invariant under all global intrinsic symmetries Useful in shape analysis: – Critical points of GISIFs obtained via geodesic distances form symmetry invariant point sets for the generation of candidate Mobius transformations – Classical Heat Kernel Signature (HKS) Wave Kernel Signature (WKS) – both GISIFs -- are used as symmetry invariant descriptors for correspondence

Introduction We propose a new class of GISIFs over compact Riemannian manifolds Spectral method: each eigenvalue of the Laplace-Beltrami operator, either repeated or non-repeated, corresponds to a GISIF.

Main Related Work M. Ovsjanikov, J. Sun, and L. Guibas. “Global intrinsic symmetries of shapes”. Computer Graphics Forum, 27(5):1341–1348, V. G. Kim, Y. Lipman, and X. Chen. “Möbius transformations for global intrinsic symmetry analysis”. Computer Graphics Forum, 29(5):1689– 1700, Y. Lipman, X. Chen, I. Daubechies, and T. A. Funkhouser. “Symmetry factored embedding and distance”. ACM Transactions on Graphics, 29(4):439–464, 2010.

Background A global intrinsic symmetry on a particular manifold is a geodesic distance-preserving self-homeomorphism. T: M  M is a global intrinsic symmetry if for all p, q in M it holds that where g denotes geodesic distance

Background A global intrinsic symmetry invariant function (GISIF) is any function f: M  R such that for any global intrinsic symmetry T it holds that f o T = f. In other words, if for all p in M it holds that

Background Some useful propositions: – Constant functions, f(p) = c for all p, are GISIFs – If f is a GISIF then c * f is a GISIF – If f and g are GISIFs, then f + g, g – f, f * g, and f/g (for g ≠ 0) are all GISIFs Based on the above propositions, all of the GISIFs defined on a manifold form a linear space called the global intrinsic symmetry invariant function space.

Spectral GISIFs via the LB Operator We propose a new class of GISIFs based on the eigendecomposition of the Laplace-Beltrami operator on compact Riemannian manifolds without boundaries. Each GISIF corresponds to an eigenvalue, repeated or non-repeated, of the Laplace- Beltrami operator. Formally stated…

Spectral GISIFs via the LB Operator Theorem: Suppose M is a compact Riemannian manifold without boundary, λ i is an eigenvalue of the Laplace- Beltrami operator Δ on M with a k-dimensional eigenfunction space. If φ i1, φ i2, …, φ ik is an orthogonal basis of the corresponding eigenfunction space of λ i, then the function is a GISIF on M. Discretized on meshes and point clouds (cotangent weights). Generalizes HKS, WKS, ADF…

Results fi_j denotes a GISIF computed using eigenfunctions of the Laplace-Beltrami operator corresponding to repeated eigenvalues i through j Less “detail” More “detail”

Results fi_j denotes a GISIF computed using eigenfunctions of the Laplace-Beltrami operator corresponding to repeated eigenvalues i through j

Results fi_j denotes a GISIF computed using eigenfunctions of the Laplace-Beltrami operator corresponding to repeated eigenvalues i through j

Results: Sparsity Level sets and histograms of our spectral GISIFs. The large blue areas without contours along with the histograms of each field illustrate the sparsity of the fields.

Results: Sparsity Level sets of our spectral GISIFs. The large blue areas without contours along with the histograms of each field illustrate the sparsity of the fields.

Results: Robustness to Noise Original Gaussian Noise: 20% mean edge length

Results: Comparison to HKS Some of our spectral GISIFs HKS for varying times (default parameters)

Results: Comparison to AGD Some of our spectral GISIFsAGD Topological noise

Applications: SFDs Symmetry Factored Embedding (SFE): Symmetry Factored Distance (SFD): The SFDs between a point and its symmetric points are zero.

Applications: SFDs Symmetry-factored distances (SFDs) computed using spectral GISIFs from the red points shown. Note how the SFDs between each point and its symmetric points are near zero (blue).

Applications: SFDs Symmetry-factored distances from the red points Symmetry orbits from the red points

Applications: SFDs Symmetry-factored distances from the red points Symmetry orbits from the red points Symmetry-factored distances from the red points Symmetry orbits from the red points

Application: Segmentation Symmetry-aware segmentations: k-means clustering on the SFE -- preliminary result

Summary and Limitations Propose a new class of GISIFs: Spectral GISIFs – More robust to topological noise than those based on geodesic distances – Generalizes HKS, WKS, ADF… Presented applications: – Symmetry orbits – symmetry-aware segmentations (preliminary) Limitations: – Cannot be computed on non-manifold shapes – Difficult for a user to decide which spectral GISIFs to use out of the full spectrum and if/how to combine them

Future Work Theory: – Study relation between global intrinsic symmetry and multiplicity of eigenvalues of the LB operator – Formal derivation of sparsity property Heuristics: – Choosing of most informative GISIFs (e.g., entropy) – Setting threshold for detecting repeated eigenvalue Symmetry-aware applications: – skeletonization – texture synthesis – denoising, – repair – processing and analysis of high-dimensional manifolds

Thank You!