IFT LAPLACIAN APPLICATIONS. Mikhail Bessmeltsev

Size: px
Start display at page:

Download "IFT LAPLACIAN APPLICATIONS. Mikhail Bessmeltsev"

Transcription

1 IFT LAPLACIAN APPLICATIONS Mikhail Bessmeltsev

2 Rough Intuition You can learn a lot about a shape by hitting it (lightly) with a hammer!

3 Spectral Geometry What can you learn about its shape from vibration frequencies and oscillation patterns?

4 THE COTANGENT LAPLACIAN

5 Laplacian is sparse! Induced by the connectivity of the triangle mesh.

6 How can we use L? (useful properties of the Laplacian) In Computer Graphics and Geometry Modeling/Processing In Machine Learning

7 How can we use L? (useful properties of the Laplacian) In Computer Graphics and Geometry Modeling/Processing In Machine Learning

8 One Object, Many Interpretations Deviation from neighbors

9 One Object, Many Interpretations Decreasing E Images made by E. Vouga Dirichlet energy: Measures smoothness

10 One Object, Many Interpretations Vibration modes

11 Key Observation (in discrete case)

12 After (More) Trigonometry mage/formula in Functional Characterization of Instrinsic and Extrinsic Geometry, TOG 2017 (Corman et al.) Laplacian only depends on edge lengths

13 Isometry Bending without stretching.

14 Lots of Interpretations Global isometry Local isometry

15 Intrinsic Techniques Isometry invariant

16 Isometry Invariance: Hope

17 Isometry Invariance: Reality Few shapes can deform isometrically

18 Isometry Invariance: Reality isometries? Few shapes can deform isometrically

19 Useful Fact

20 Beware Image from: Raviv et al. Volumetric Heat Kernel Signatures. 3DOR Not the same.

21 Why Study the Laplacian? Encodes intrinsic geometry Edge lengths on triangle mesh, Riemannian metric on manifold Multi-scale Filter based on frequency Geometry through linear algebra Linear/eigenvalue problems, sparse positive definite matrices Connection to physics Heat equation, wave equation, vibration,

22 How can we use L? (useful properties of the Laplacian) In Computer Graphics and Geometry Modeling/Processing In Machine Learning

23 Example Task: Shape Descriptors Pointwise quantity

24 Descriptor Tasks Characterize local geometry Feature/anomaly detection Describe point s role on surface Symmetry detection, correspondence

25 Descriptors We ve Seen Before Gaussian and mean curvature

26 Desirable Properties Distinguishing Provides useful information about a point Stable Numerically and geometrically Intrinsic No dependence on embedding

27 Intrinsic Descriptors Invariant under Rigid motion Bending without stretching

28 Intrinsic Descriptor Theorema Egregium ( Totally Awesome Theorem ): Gaussian curvature is intrinsic.

29 End of the Story? Second derivative quantity

30 Desirable Properties Incorporates neighborhood information in an intrinsic fashion Stable under small deformation

31 Shape Context

32 Shape Context + Translational invariance + Scale invariance - Rotational invariance

33 Shape Context Idea! Compute angles relative to the tangent + Translational invariance + Scale invariance + Rotational invariance

34 Connection to Physics Heat equation fall/lectureslides/11_shape_matching.pdf

35 Intrinsic Observation Heat diffusion patterns are not affected if you bend a surface.

36 Global Point Signature Laplace-Beltrami Eigenfunctions for Deformation Invariant Shape Representation Rustamov, SGP 2007

37 Global Point Signature If surface does not self-intersect, neither does the GPS embedding. Proof: Laplacian eigenfunctions span LL 22 (ΣΣ); if GPS(p)=GPS(q), then all functions on ΣΣ would be equal at p and q.

38 Global Point Signature GPS is isometry-invariant. Proof: Comes from the Laplacian.

39 Drawbacks of GPS Assumes unique λ s Potential for eigenfunction switching Nonlocal feature

40 PDE Applications of the Laplacian Heat equation fall/lectureslides/11_shape_matching.pdf

41 PDE Applications of the Laplacian Image courtesy G. Peyré Wave equation

42 PDE Applications of the Laplacian Image courtesy G. Peyré Wave equation

43 Solutions in the LB Basis Heat equation

44 Heat Kernel Signature (HKS) Continuous function of tt [00, ) How much heat diffuses from x to itself in time t?

45 Heat Kernel Signature (HKS) A concise and provably informative multi-scale signature based on heat diffusion Sun, Ovsjanikov, and Guibas; SGP 2009

46 Heat Kernel Signature (HKS) Good properties: Isometry-invariant Multiscale Not subject to switching Easy to compute Related to curvature at small scales

47 Heat Kernel Signature (HKS) Bad properties: Issues remain with repeated eigenvalues Theoretical guarantees require (near-)isometry

48 Wave Kernel Signature (WKS) Average probability over time that particle is at x. Initial energy distribution The Wave Kernel Signature: A Quantum Mechanical Approach to Shape Analysis Aubry, Schlickewei, and Cremers; ICCV Workshops 2012

49 Wave Kernel Signature (WKS) HKS WKS vision.in.tum.de/_media/spezial/bib/aubry-et-al-4dmod11.pdf

50 Wave Kernel Signature (WKS) Good properties: [Similar to HKS] Localized in frequency Stable under some non-isometric deformation Some multi-scale properties

51 Wave Kernel Signature (WKS) Bad properties: [Similar to HKS] Can filter out large-scale features

52 Many Others Lots of spectral descriptors in terms of Laplacian eigenstructure.

53 Combination with Machine Learning Learn f rather than defining it Learning Spectral Descriptors for Deformable Shape Correspondence Litman and Bronstein; PAMI 2014

54 Application: Feature Extraction Maxima of k t (x,x) over x for large t. A Concise and Provably Informative Multi-Scale Signature Based on Heat Diffusion Sun, Ovsjanikov, and Guibas; SGP 2009 Feature points

55 Preview: Correspondence 10.pdf

56 Descriptor Matching Simply match closest points in descriptor space.

57 Descriptor Matching Problem Symmetry

58 Heat Kernel Map How much heat diffuses from p to x in time t? One Point Isometric Matching with the Heat Kernel Ovsjanikov et al. 2010

59 Heat Kernel Map Theorem: Only have to match one point! One Point Isometric Matching with the Heat Kernel Ovsjanikov et al. 2010

60 Self-Map: Symmetry Intrinsic symmetries become extrinsic in GPS space! Global Intrinsic Symmetries of Shapes Ovsjanikov, Sun, and Guibas 2008 Discrete intrinsic symmetries

61 All Over the Place Laplacians appear everywhere in shape analysis and geometry processing.

62 Biharmonic Distances Biharmonic distance Lipman, Rustamov & Funkhouser, 2010

63 Geodesic Distances Geodesics in heat Crane, Weischedel, and Wardetzky; TOG 2013

64 Finding geodesics Crane, Weischedel, and Wardetzky. Geodesics in Heat. TOG, 2013.

65 Mean Curvature Flow

66 Mean Curvature Flow Implicit fairing of irregular meshes using diffusion and curvature flow Desbrun et al., 1999

67 Mean Curvature Flow Changes at each time step Implicit fairing of irregular meshes using diffusion and curvature flow Desbrun et al., 1999

68 Recall:

69 Another fairing Screened Poisson Equation

70 Useful Technique Choice: Evaluate at time T nconditionally stable, but not necessarily accurate for large T! Implicit time stepping

71 Parameterization: Harmonic Map Multiresolution analysis of arbitrary meshes Eck et al., 1995 (and many others!)

72 Others Shape retrieval from Laplacian eigenvalues Shape DNA [Reuter et al., 2006] Quadrangulation Nodal domains [Dong et al., 2006] Surface deformation As-rigid-as-possible [Sorkine & Alexa, 2007]

73 How can we use L? (useful properties of the Laplacian) In Computer Graphics and Geometry Modeling/Processing In Machine Learning

74 Semi-Supervised Learning Semi-supervised learning using Gaussian fields and harmonic functions Zhu, Ghahramani, & Lafferty 2003

75 Semi-Supervised Technique irichlet energy Linear system of equations (Poisson)

76 Related Method Step 1: Build k-nn graph Step 2: Compute p smallest Laplacian eigenvectors Step 3: Solve semi-supervised problem in subspace Using Manifold Structure for Partially Labelled Classification Belkin and Niyogi; NIPS 2002

77 Manifold Regularization Loss function Regularizer Dirichlet energy Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples Belkin, Niyogi, and Sindhwani; JMLR 2006

78 Examples of Manifold Regularization Laplacian-regularized least squares (LapRLS) Laplacian support vector machine (LapSVM) On Manifold Regularization Belkin, Niyogi, Sindhwani; AISTATS 2005

79 Diffusion Maps Embedding from first k eigenvalues/vectors: Roughly: ΨΨ tt xx ΨΨ tt yy is probability that x, y diffuse to the same point in time t. Diffusion Maps Coifman and Lafon; Applied and Computational Harmonic Analysis, 2006 Robust to sampling and noise Image from

Justin Solomon MIT, Spring 2017

Justin Solomon MIT, Spring 2017 Justin Solomon MIT, Spring 2017 http://pngimg.com/upload/hammer_png3886.png You can learn a lot about a shape by hitting it (lightly) with a hammer! What can you learn about its shape from vibration frequencies

More information

CS 468, Spring 2013 Differential Geometry for Computer Science Justin Solomon and Adrian Butscher

CS 468, Spring 2013 Differential Geometry for Computer Science Justin Solomon and Adrian Butscher CS 468, Spring 2013 Differential Geometry for Computer Science Justin Solomon and Adrian Butscher http://graphics.stanford.edu/projects/lgl/papers/nbwyg-oaicsm-11/nbwyg-oaicsm-11.pdf Need to understand

More information

Spectral Processing. Misha Kazhdan

Spectral Processing. Misha Kazhdan Spectral Processing Misha Kazhdan [Taubin, 1995] A Signal Processing Approach to Fair Surface Design [Desbrun, et al., 1999] Implicit Fairing of Arbitrary Meshes [Vallet and Levy, 2008] Spectral Geometry

More information

Heat Kernel Signature: A Concise Signature Based on Heat Diffusion. Leo Guibas, Jian Sun, Maks Ovsjanikov

Heat Kernel Signature: A Concise Signature Based on Heat Diffusion. Leo Guibas, Jian Sun, Maks Ovsjanikov Heat Kernel Signature: A Concise Signature Based on Heat Diffusion i Leo Guibas, Jian Sun, Maks Ovsjanikov This talk is based on: Jian Sun, Maks Ovsjanikov, Leonidas Guibas 1 A Concise and Provably Informative

More information

Spectral Algorithms II

Spectral Algorithms II Spectral Algorithms II Applications Slides based on Spectral Mesh Processing Siggraph 2010 course Applications Shape retrieval Parameterization i 1D 2D Quad meshing Shape Retrieval 3D Repository Query

More information

IFT CONTINUOUS LAPLACIAN Mikhail Bessmeltsev

IFT CONTINUOUS LAPLACIAN   Mikhail Bessmeltsev IFT 6112 07 CONTINUOUS LAPLACIAN http://www-labs.iro.umontreal.ca/~bmpix/teaching/6112/2018/ Mikhail Bessmeltsev Famous Motivation An Experiment Unreasonable to Ask? Length of string http://www.takamine.com/templates/default/images/gclassical.png

More information

Graphs, Geometry and Semi-supervised Learning

Graphs, Geometry and Semi-supervised Learning Graphs, Geometry and Semi-supervised Learning Mikhail Belkin The Ohio State University, Dept of Computer Science and Engineering and Dept of Statistics Collaborators: Partha Niyogi, Vikas Sindhwani In

More information

EE Technion, Spring then. can be isometrically embedded into can be realized as a Gram matrix of rank, Properties:

EE Technion, Spring then. can be isometrically embedded into can be realized as a Gram matrix of rank, Properties: 5/25/200 2 A mathematical exercise Assume points with the metric are isometrically embeddable into Then, there exists a canonical form such that for all Spectral methods We can also write Alexander & Michael

More information

Laplace-Beltrami Eigenfunctions for Deformation Invariant Shape Representation

Laplace-Beltrami Eigenfunctions for Deformation Invariant Shape Representation Laplace-Beltrami Eigenfunctions for Deformation Invariant Shape Representation Author: Raif M. Rustamov Presenter: Dan Abretske Johns Hopkins 2007 Outline Motivation and Background Laplace-Beltrami Operator

More information

6/9/2010. Feature-based methods and shape retrieval problems. Structure. Combining local and global structures. Photometric stress

6/9/2010. Feature-based methods and shape retrieval problems. Structure. Combining local and global structures. Photometric stress 1 2 Structure Feature-based methods and shape retrieval problems Global Metric Local Feature descriptors Alexander & Michael Bronstein, 2006-2009 Michael Bronstein, 2010 tosca.cs.technion.ac.il/book 048921

More information

Diffusion Geometries, Diffusion Wavelets and Harmonic Analysis of large data sets.

Diffusion Geometries, Diffusion Wavelets and Harmonic Analysis of large data sets. Diffusion Geometries, Diffusion Wavelets and Harmonic Analysis of large data sets. R.R. Coifman, S. Lafon, MM Mathematics Department Program of Applied Mathematics. Yale University Motivations The main

More information

softened probabilistic

softened probabilistic Justin Solomon MIT Understand geometry from a softened probabilistic standpoint. Somewhere over here. Exactly here. One of these two places. Query 1 2 Which is closer, 1 or 2? Query 1 2 Which is closer,

More information

Matching shapes by eigendecomposition of the Laplace-Beltrami operator

Matching shapes by eigendecomposition of the Laplace-Beltrami operator Matching shapes by eigendecomposition of the Laplace-Beltrami operator Anastasia Dubrovina Technion - Israel Institute of Technology nastyad@tx.technion.ac.il Ron Kimmel Technion - Israel Institute of

More information

Laplace Operator and Heat Kernel for Shape Analysis

Laplace Operator and Heat Kernel for Shape Analysis Laplace Operator and Heat Kernel for Shape Analysis Jian Sun Mathematical Sciences Center, Tsinghua University R kf := 2 f x 2 1 Laplace Operator on R k, the standard Laplace operator: R kf := div f +

More information

Spectral Algorithms I. Slides based on Spectral Mesh Processing Siggraph 2010 course

Spectral Algorithms I. Slides based on Spectral Mesh Processing Siggraph 2010 course Spectral Algorithms I Slides based on Spectral Mesh Processing Siggraph 2010 course Why Spectral? A different way to look at functions on a domain Why Spectral? Better representations lead to simpler solutions

More information

An Introduction to Laplacian Spectral Distances and Kernels: Theory, Computation, and Applications. Giuseppe Patané, CNR-IMATI - Italy

An Introduction to Laplacian Spectral Distances and Kernels: Theory, Computation, and Applications. Giuseppe Patané, CNR-IMATI - Italy i An Introduction to Laplacian Spectral Distances and Kernels: Theory, Computation, and Applications Giuseppe Patané, CNR-IMATI - Italy ii Contents List of Figures...1 List of Tables...7 1 Introduction...9

More information

Manifold Regularization

Manifold Regularization Manifold Regularization Vikas Sindhwani Department of Computer Science University of Chicago Joint Work with Mikhail Belkin and Partha Niyogi TTI-C Talk September 14, 24 p.1 The Problem of Learning is

More information

Stable Spectral Mesh Filtering

Stable Spectral Mesh Filtering Stable Spectral Mesh Filtering Artiom Kovnatsky, Michael M. Bronstein, and Alexander M. Bronstein 2 Institute of Computational Science, Faculty of Informatics, Università della Svizzera Italiana, Lugano,

More information

Data Analysis and Manifold Learning Lecture 9: Diffusion on Manifolds and on Graphs

Data Analysis and Manifold Learning Lecture 9: Diffusion on Manifolds and on Graphs Data Analysis and Manifold Learning Lecture 9: Diffusion on Manifolds and on Graphs Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline of Lecture

More information

arxiv: v1 [cs.cv] 23 Oct 2011

arxiv: v1 [cs.cv] 23 Oct 2011 Spectral descriptors for deformable shapes arxiv:1110.5015v1 [cs.cv] 23 Oct 2011 A. M. Bronstein October 25, 2011 Abstract Informative and discriminative feature descriptors play a fundamental role in

More information

CS 468, Spring 2013 Differential Geometry for Computer Science Justin Solomon and Adrian Butscher

CS 468, Spring 2013 Differential Geometry for Computer Science Justin Solomon and Adrian Butscher http://igl.ethz.ch/projects/arap/arap_web.pdf CS 468, Spring 2013 Differential Geometry for Computer Science Justin Solomon and Adrian Butscher Homework 4: June 5 Project: June 6 Scribe notes: One week

More information

Contribution from: Springer Verlag Berlin Heidelberg 2005 ISBN

Contribution from: Springer Verlag Berlin Heidelberg 2005 ISBN Contribution from: Mathematical Physics Studies Vol. 7 Perspectives in Analysis Essays in Honor of Lennart Carleson s 75th Birthday Michael Benedicks, Peter W. Jones, Stanislav Smirnov (Eds.) Springer

More information

A graph based approach to semi-supervised learning

A graph based approach to semi-supervised learning A graph based approach to semi-supervised learning 1 Feb 2011 Two papers M. Belkin, P. Niyogi, and V Sindhwani. Manifold regularization: a geometric framework for learning from labeled and unlabeled examples.

More information

Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature

Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields sing the Heat Kernel Signature Valentin Zobel, Jan Reininghaus, and Ingrid Hotz Abstract We propose a method for visualizing two-dimensional

More information

Beyond the Point Cloud: From Transductive to Semi-Supervised Learning

Beyond the Point Cloud: From Transductive to Semi-Supervised Learning Beyond the Point Cloud: From Transductive to Semi-Supervised Learning Vikas Sindhwani, Partha Niyogi, Mikhail Belkin Andrew B. Goldberg goldberg@cs.wisc.edu Department of Computer Sciences University of

More information

Nonlinear Dimensionality Reduction. Jose A. Costa

Nonlinear Dimensionality Reduction. Jose A. Costa Nonlinear Dimensionality Reduction Jose A. Costa Mathematics of Information Seminar, Dec. Motivation Many useful of signals such as: Image databases; Gene expression microarrays; Internet traffic time

More information

Functional Maps ( ) Dr. Emanuele Rodolà Room , Informatik IX

Functional Maps ( ) Dr. Emanuele Rodolà Room , Informatik IX Functional Maps (12.06.2014) Dr. Emanuele Rodolà rodola@in.tum.de Room 02.09.058, Informatik IX Seminar «LP relaxation for elastic shape matching» Fabian Stark Wednesday, June 18th 14:00 Room 02.09.023

More information

Advances in Manifold Learning Presented by: Naku Nak l Verm r a June 10, 2008

Advances in Manifold Learning Presented by: Naku Nak l Verm r a June 10, 2008 Advances in Manifold Learning Presented by: Nakul Verma June 10, 008 Outline Motivation Manifolds Manifold Learning Random projection of manifolds for dimension reduction Introduction to random projections

More information

Laplace-Beltrami: The Swiss Army Knife of Geometry Processing

Laplace-Beltrami: The Swiss Army Knife of Geometry Processing Laplace-Beltrami: The Swiss Army Knife of Geometry Processing (SGP 2014 Tutorial July 7 2014) Justin Solomon / Stanford University Keenan Crane / Columbia University Etienne Vouga / Harvard University

More information

APPROXIMATELY ISOMETRIC SHAPE CORRESPONDENCE BY MATCHING POINTWISE SPECTRAL FEATURES AND GLOBAL GEODESIC STRUCTURES

APPROXIMATELY ISOMETRIC SHAPE CORRESPONDENCE BY MATCHING POINTWISE SPECTRAL FEATURES AND GLOBAL GEODESIC STRUCTURES Advances in Adaptive Data Analysis Vol. 3, Nos. 1 & 2 (2011) 203 228 c World Scientific Publishing Company DOI: 10.1142/S1793536911000829 APPROXIMATELY ISOMETRIC SHAPE CORRESPONDENCE BY MATCHING POINTWISE

More information

Modal Shape Analysis beyond Laplacian

Modal Shape Analysis beyond Laplacian Modal Shape Analysis beyond Laplacian Klaus Hildebrandt, Christian Schulz, Christoph von Tycowicz, Konrad Polthier Abstract In recent years, substantial progress in shape analysis has been achieved through

More information

On the optimality of shape and data representation in the spectral domain

On the optimality of shape and data representation in the spectral domain On the optimality of shape and data representation in the spectral domain Yonathan Aflalo Haim Brezis Ron Kimmel arxiv:1409.4349v1 [cs.cv] 15 Sep 014 October 11, 018 Abstract A proof of the optimality

More information

Regularized Principal Component Analysis

Regularized Principal Component Analysis Chin. Ann. Math. 38B(1), 2017, 1 12 DOI: 10.1007/s11401-016-1061-6 Chinese Annals of Mathematics, Series B c The Editorial Office of CAM and Springer-Verlag Berlin Heidelberg 2017 Regularized rincipal

More information

Learning Eigenfunctions: Links with Spectral Clustering and Kernel PCA

Learning Eigenfunctions: Links with Spectral Clustering and Kernel PCA Learning Eigenfunctions: Links with Spectral Clustering and Kernel PCA Yoshua Bengio Pascal Vincent Jean-François Paiement University of Montreal April 2, Snowbird Learning 2003 Learning Modal Structures

More information

The Laplacian ( ) Matthias Vestner Dr. Emanuele Rodolà Room , Informatik IX

The Laplacian ( ) Matthias Vestner Dr. Emanuele Rodolà Room , Informatik IX The Laplacian (26.05.2014) Matthias Vestner Dr. Emanuele Rodolà {vestner,rodola}@in.tum.de Room 02.09.058, Informatik IX Seminar «The metric approach to shape matching» Alfonso Ros Wednesday, May 28th

More information

Manifold Regularization

Manifold Regularization 9.520: Statistical Learning Theory and Applications arch 3rd, 200 anifold Regularization Lecturer: Lorenzo Rosasco Scribe: Hooyoung Chung Introduction In this lecture we introduce a class of learning algorithms,

More information

LECTURE NOTE #11 PROF. ALAN YUILLE

LECTURE NOTE #11 PROF. ALAN YUILLE LECTURE NOTE #11 PROF. ALAN YUILLE 1. NonLinear Dimension Reduction Spectral Methods. The basic idea is to assume that the data lies on a manifold/surface in D-dimensional space, see figure (1) Perform

More information

Laplacian Eigenmaps for Dimensionality Reduction and Data Representation

Laplacian Eigenmaps for Dimensionality Reduction and Data Representation Laplacian Eigenmaps for Dimensionality Reduction and Data Representation Neural Computation, June 2003; 15 (6):1373-1396 Presentation for CSE291 sp07 M. Belkin 1 P. Niyogi 2 1 University of Chicago, Department

More information

Face Recognition Using Laplacianfaces He et al. (IEEE Trans PAMI, 2005) presented by Hassan A. Kingravi

Face Recognition Using Laplacianfaces He et al. (IEEE Trans PAMI, 2005) presented by Hassan A. Kingravi Face Recognition Using Laplacianfaces He et al. (IEEE Trans PAMI, 2005) presented by Hassan A. Kingravi Overview Introduction Linear Methods for Dimensionality Reduction Nonlinear Methods and Manifold

More information

Beyond Scalar Affinities for Network Analysis or Vector Diffusion Maps and the Connection Laplacian

Beyond Scalar Affinities for Network Analysis or Vector Diffusion Maps and the Connection Laplacian Beyond Scalar Affinities for Network Analysis or Vector Diffusion Maps and the Connection Laplacian Amit Singer Princeton University Department of Mathematics and Program in Applied and Computational Mathematics

More information

Nonlinear Methods. Data often lies on or near a nonlinear low-dimensional curve aka manifold.

Nonlinear Methods. Data often lies on or near a nonlinear low-dimensional curve aka manifold. Nonlinear Methods Data often lies on or near a nonlinear low-dimensional curve aka manifold. 27 Laplacian Eigenmaps Linear methods Lower-dimensional linear projection that preserves distances between all

More information

The Laplace-Beltrami operator: a ubiquitous tool for image and shape processing

The Laplace-Beltrami operator: a ubiquitous tool for image and shape processing The Laplace-Beltrami operator: a ubiquitous tool for image and shape processing Aaron Wetzler, Yonathan Aflalo, Anastasia Dubrovina, and Ron Kimmel Technion - Israel Institute of Technology, Haifa, Israel

More information

Differential geometry II

Differential geometry II Differential geometry II Lecture 2 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 Intrinsic & extrinsic geometry 2 First

More information

Diffusion Wavelets and Applications

Diffusion Wavelets and Applications Diffusion Wavelets and Applications J.C. Bremer, R.R. Coifman, P.W. Jones, S. Lafon, M. Mohlenkamp, MM, R. Schul, A.D. Szlam Demos, web pages and preprints available at: S.Lafon: www.math.yale.edu/~sl349

More information

EECS 275 Matrix Computation

EECS 275 Matrix Computation EECS 275 Matrix Computation Ming-Hsuan Yang Electrical Engineering and Computer Science University of California at Merced Merced, CA 95344 http://faculty.ucmerced.edu/mhyang Lecture 23 1 / 27 Overview

More information

Laplacian Mesh Processing

Laplacian Mesh Processing Sorkine et al. Laplacian Mesh Processing (includes material from Olga Sorkine, Yaron Lipman, Marc Pauly, Adrien Treuille, Marc Alexa and Daniel Cohen-Or) Siddhartha Chaudhuri http://www.cse.iitb.ac.in/~cs749

More information

Analysis of Spectral Kernel Design based Semi-supervised Learning

Analysis of Spectral Kernel Design based Semi-supervised Learning Analysis of Spectral Kernel Design based Semi-supervised Learning Tong Zhang IBM T. J. Watson Research Center Yorktown Heights, NY 10598 Rie Kubota Ando IBM T. J. Watson Research Center Yorktown Heights,

More information

Intrinsic Local Symmetries: A Computational Framework

Intrinsic Local Symmetries: A Computational Framework Eurographics Workshop on 3D Object Retrieval (2012) M. Spagnuolo, M. Bronstein, A. Bronstein, and A. Ferreira (Editors) Intrinsic Local Symmetries: A Computational Framework Carmi Grushko Dan Raviv Ron

More information

Characterization of Partial Intrinsic Symmetries

Characterization of Partial Intrinsic Symmetries Characterization of Partial Intrinsic Symmetries Aurela Shehu 1,2, Alan Brunton 3, Stefanie Wuhrer 1, and Michael Wand 4 1 Cluster of Excellence MMCI, Saarland University, Germany 2 Saarbrücken Graduate

More information

Geometric and photometric data fusion in non-rigid shape analysis

Geometric and photometric data fusion in non-rigid shape analysis NUMERICAL MATHEMATICS: Theory, Methods and Applications Numer. Math. Theor. Meth. Appl., Vol. xx, No. x, pp. 1-28 (200x) Geometric and photometric data fusion in non-rigid shape analysis Artiom Kovnatsky

More information

Unsupervised Learning Techniques Class 07, 1 March 2006 Andrea Caponnetto

Unsupervised Learning Techniques Class 07, 1 March 2006 Andrea Caponnetto Unsupervised Learning Techniques 9.520 Class 07, 1 March 2006 Andrea Caponnetto About this class Goal To introduce some methods for unsupervised learning: Gaussian Mixtures, K-Means, ISOMAP, HLLE, Laplacian

More information

of semi-supervised Gaussian process classifiers.

of semi-supervised Gaussian process classifiers. Semi-supervised Gaussian Process Classifiers Vikas Sindhwani Department of Computer Science University of Chicago Chicago, IL 665, USA vikass@cs.uchicago.edu Wei Chu CCLS Columbia University New York,

More information

Learning on Graphs and Manifolds. CMPSCI 689 Sridhar Mahadevan U.Mass Amherst

Learning on Graphs and Manifolds. CMPSCI 689 Sridhar Mahadevan U.Mass Amherst Learning on Graphs and Manifolds CMPSCI 689 Sridhar Mahadevan U.Mass Amherst Outline Manifold learning is a relatively new area of machine learning (2000-now). Main idea Model the underlying geometry of

More information

arxiv: v1 [cs.cv] 28 Sep 2012

arxiv: v1 [cs.cv] 28 Sep 2012 Coupled quasi-harmonic bases arxiv:1210.0026v1 [cs.cv] 28 Sep 2012 A. Kovnatsky 1, M. M. Bronstein 1, A. M. Bronstein 2, K. Glashoff 3, and R. Kimmel 4 1 Faculty of Informatics, Università della Svizzera

More information

Nonlinear Dimensionality Reduction

Nonlinear Dimensionality Reduction Outline Hong Chang Institute of Computing Technology, Chinese Academy of Sciences Machine Learning Methods (Fall 2012) Outline Outline I 1 Kernel PCA 2 Isomap 3 Locally Linear Embedding 4 Laplacian Eigenmap

More information

Is Manifold Learning for Toy Data only?

Is Manifold Learning for Toy Data only? s Manifold Learning for Toy Data only? Marina Meilă University of Washington mmp@stat.washington.edu MMDS Workshop 2016 Outline What is non-linear dimension reduction? Metric Manifold Learning Estimating

More information

Appendix to: On the Relation Between Low Density Separation, Spectral Clustering and Graph Cuts

Appendix to: On the Relation Between Low Density Separation, Spectral Clustering and Graph Cuts Appendix to: On the Relation Between Low Density Separation, Spectral Clustering and Graph Cuts Hariharan Narayanan Department of Computer Science University of Chicago Chicago IL 6637 hari@cs.uchicago.edu

More information

Diffusion/Inference geometries of data features, situational awareness and visualization. Ronald R Coifman Mathematics Yale University

Diffusion/Inference geometries of data features, situational awareness and visualization. Ronald R Coifman Mathematics Yale University Diffusion/Inference geometries of data features, situational awareness and visualization Ronald R Coifman Mathematics Yale University Digital data is generally converted to point clouds in high dimensional

More information

CSE 291. Assignment Spectral clustering versus k-means. Out: Wed May 23 Due: Wed Jun 13

CSE 291. Assignment Spectral clustering versus k-means. Out: Wed May 23 Due: Wed Jun 13 CSE 291. Assignment 3 Out: Wed May 23 Due: Wed Jun 13 3.1 Spectral clustering versus k-means Download the rings data set for this problem from the course web site. The data is stored in MATLAB format as

More information

Semi-Supervised Learning with Graphs. Xiaojin (Jerry) Zhu School of Computer Science Carnegie Mellon University

Semi-Supervised Learning with Graphs. Xiaojin (Jerry) Zhu School of Computer Science Carnegie Mellon University Semi-Supervised Learning with Graphs Xiaojin (Jerry) Zhu School of Computer Science Carnegie Mellon University 1 Semi-supervised Learning classification classifiers need labeled data to train labeled data

More information

Learning from Labeled and Unlabeled Data: Semi-supervised Learning and Ranking p. 1/31

Learning from Labeled and Unlabeled Data: Semi-supervised Learning and Ranking p. 1/31 Learning from Labeled and Unlabeled Data: Semi-supervised Learning and Ranking Dengyong Zhou zhou@tuebingen.mpg.de Dept. Schölkopf, Max Planck Institute for Biological Cybernetics, Germany Learning from

More information

Semi-Supervised Learning in Gigantic Image Collections. Rob Fergus (New York University) Yair Weiss (Hebrew University) Antonio Torralba (MIT)

Semi-Supervised Learning in Gigantic Image Collections. Rob Fergus (New York University) Yair Weiss (Hebrew University) Antonio Torralba (MIT) Semi-Supervised Learning in Gigantic Image Collections Rob Fergus (New York University) Yair Weiss (Hebrew University) Antonio Torralba (MIT) Gigantic Image Collections What does the world look like? High

More information

Non-linear Dimensionality Reduction

Non-linear Dimensionality Reduction Non-linear Dimensionality Reduction CE-725: Statistical Pattern Recognition Sharif University of Technology Spring 2013 Soleymani Outline Introduction Laplacian Eigenmaps Locally Linear Embedding (LLE)

More information

THE HIDDEN CONVEXITY OF SPECTRAL CLUSTERING

THE HIDDEN CONVEXITY OF SPECTRAL CLUSTERING THE HIDDEN CONVEXITY OF SPECTRAL CLUSTERING Luis Rademacher, Ohio State University, Computer Science and Engineering. Joint work with Mikhail Belkin and James Voss This talk A new approach to multi-way

More information

Semi-Supervised Learning with the Graph Laplacian: The Limit of Infinite Unlabelled Data

Semi-Supervised Learning with the Graph Laplacian: The Limit of Infinite Unlabelled Data Semi-Supervised Learning with the Graph Laplacian: The Limit of Infinite Unlabelled Data Boaz Nadler Dept. of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot, Israel 76 boaz.nadler@weizmann.ac.il

More information

A unified discrete framework for intrinsic and extrinsic Dirac operators for geometry processing

A unified discrete framework for intrinsic and extrinsic Dirac operators for geometry processing Eurographics Symposium on Geometry Processing 2018 T. Ju and A. Vaxman (Guest Editors) Volume 37 (2018), Number 5 A unified discrete framework for intrinsic and extrinsic Dirac operators for geometry processing

More information

Geometric and photometric data fusion in non-rigid shape analysis

Geometric and photometric data fusion in non-rigid shape analysis NUMERICAL MATHEMATICS: Theory, Methods and Applications Numer. Math. Theor. Meth. Appl., Vol. xx, No. x, pp. 1-28 (200x) Geometric and photometric data fusion in non-rigid shape analysis Artiom Kovnatsky

More information

Deformable Shape Retrieval by Learning Diffusion Kernels

Deformable Shape Retrieval by Learning Diffusion Kernels Deformable Shape Retrieval by Learning Diffusion Kernels Yonathan Aflalo 1, Alexander M. Bronstein 2, Michael M. Bronstein 3, and Ron Kimmel 1 1 Technion, Israel Institute of Technology, Haifa, Israel

More information

From graph to manifold Laplacian: The convergence rate

From graph to manifold Laplacian: The convergence rate Appl. Comput. Harmon. Anal. 2 (2006) 28 34 www.elsevier.com/locate/acha Letter to the Editor From graph to manifold Laplacian: The convergence rate A. Singer Department of athematics, Yale University,

More information

CMPSCI 791BB: Advanced ML: Laplacian Learning

CMPSCI 791BB: Advanced ML: Laplacian Learning CMPSCI 791BB: Advanced ML: Laplacian Learning Sridhar Mahadevan Outline! Spectral graph operators! Combinatorial graph Laplacian! Normalized graph Laplacian! Random walks! Machine learning on graphs! Clustering!

More information

Data dependent operators for the spatial-spectral fusion problem

Data dependent operators for the spatial-spectral fusion problem Data dependent operators for the spatial-spectral fusion problem Wien, December 3, 2012 Joint work with: University of Maryland: J. J. Benedetto, J. A. Dobrosotskaya, T. Doster, K. W. Duke, M. Ehler, A.

More information

Multiscale Analysis and Diffusion Semigroups With Applications

Multiscale Analysis and Diffusion Semigroups With Applications Multiscale Analysis and Diffusion Semigroups With Applications Karamatou Yacoubou Djima Advisor: Wojciech Czaja Norbert Wiener Center Department of Mathematics University of Maryland, College Park http://www.norbertwiener.umd.edu

More information

arxiv: v1 [cs.dm] 14 Feb 2013

arxiv: v1 [cs.dm] 14 Feb 2013 Eigenfunctions of the Edge-Based Laplacian on a Graph arxiv:1302.3433v1 [cs.dm] 14 Feb 2013 Richard C. Wilson, Furqan Aziz, Edwin R. Hancock Dept. of Computer Science University of York, York, UK March

More information

Semi-Supervised Learning

Semi-Supervised Learning Semi-Supervised Learning getting more for less in natural language processing and beyond Xiaojin (Jerry) Zhu School of Computer Science Carnegie Mellon University 1 Semi-supervised Learning many human

More information

Laplace-Beltrami Eigenfunctions for Deformation Invariant Shape Representation

Laplace-Beltrami Eigenfunctions for Deformation Invariant Shape Representation Eurographics ymposium on Geometry Processing (2007) Alexander Belyaev, Michael Garland (Editors) Laplace-Beltrami Eigenfunctions for Deformation Invariant hape Representation Raif M. Rustamov Purdue University,

More information

Connection of Local Linear Embedding, ISOMAP, and Kernel Principal Component Analysis

Connection of Local Linear Embedding, ISOMAP, and Kernel Principal Component Analysis Connection of Local Linear Embedding, ISOMAP, and Kernel Principal Component Analysis Alvina Goh Vision Reading Group 13 October 2005 Connection of Local Linear Embedding, ISOMAP, and Kernel Principal

More information

Data-dependent representations: Laplacian Eigenmaps

Data-dependent representations: Laplacian Eigenmaps Data-dependent representations: Laplacian Eigenmaps November 4, 2015 Data Organization and Manifold Learning There are many techniques for Data Organization and Manifold Learning, e.g., Principal Component

More information

Global vs. Multiscale Approaches

Global vs. Multiscale Approaches Harmonic Analysis on Graphs Global vs. Multiscale Approaches Weizmann Institute of Science, Rehovot, Israel July 2011 Joint work with Matan Gavish (WIS/Stanford), Ronald Coifman (Yale), ICML 10' Challenge:

More information

Exploiting Sparse Non-Linear Structure in Astronomical Data

Exploiting Sparse Non-Linear Structure in Astronomical Data Exploiting Sparse Non-Linear Structure in Astronomical Data Ann B. Lee Department of Statistics and Department of Machine Learning, Carnegie Mellon University Joint work with P. Freeman, C. Schafer, and

More information

Low-level Image Processing

Low-level Image Processing Low-level Image Processing In-Place Covariance Operators for Computer Vision Terry Caelli and Mark Ollila School of Computing, Curtin University of Technology, Perth, Western Australia, Box U 1987, Emaihtmc@cs.mu.oz.au

More information

Symmetry Factored Embedding And Distance

Symmetry Factored Embedding And Distance Symmetry Factored Embedding And Distance Yaron Lipman Xiaobai Chen Ingrid Daubechies Thomas Funkhouser Princeton University Abstract We introduce the Symmetry Factored Embedding (SFE) and the Symmetry

More information

Limits of Spectral Clustering

Limits of Spectral Clustering Limits of Spectral Clustering Ulrike von Luxburg and Olivier Bousquet Max Planck Institute for Biological Cybernetics Spemannstr. 38, 72076 Tübingen, Germany {ulrike.luxburg,olivier.bousquet}@tuebingen.mpg.de

More information

Graph-Based Semi-Supervised Learning

Graph-Based Semi-Supervised Learning Graph-Based Semi-Supervised Learning Olivier Delalleau, Yoshua Bengio and Nicolas Le Roux Université de Montréal CIAR Workshop - April 26th, 2005 Graph-Based Semi-Supervised Learning Yoshua Bengio, Olivier

More information

Regression on Manifolds Using Kernel Dimension Reduction

Regression on Manifolds Using Kernel Dimension Reduction Jens Nilsson JENSN@MATHS.LTH.SE Centre for Mathematical Sciences, Lund University, Box 118, SE-221 00 Lund, Sweden Fei Sha FEISHA@CS.BERKELEY.EDU Computer Science Division, University of California, Berkeley,

More information

Statistical and Computational Analysis of Locality Preserving Projection

Statistical and Computational Analysis of Locality Preserving Projection Statistical and Computational Analysis of Locality Preserving Projection Xiaofei He xiaofei@cs.uchicago.edu Department of Computer Science, University of Chicago, 00 East 58th Street, Chicago, IL 60637

More information

Semi Supervised Distance Metric Learning

Semi Supervised Distance Metric Learning Semi Supervised Distance Metric Learning wliu@ee.columbia.edu Outline Background Related Work Learning Framework Collaborative Image Retrieval Future Research Background Euclidean distance d( x, x ) =

More information

Filtering via a Reference Set. A.Haddad, D. Kushnir, R.R. Coifman Technical Report YALEU/DCS/TR-1441 February 21, 2011

Filtering via a Reference Set. A.Haddad, D. Kushnir, R.R. Coifman Technical Report YALEU/DCS/TR-1441 February 21, 2011 Patch-based de-noising algorithms and patch manifold smoothing have emerged as efficient de-noising methods. This paper provides a new insight on these methods, such as the Non Local Means or the image

More information

Geometric Modelling Summer 2016

Geometric Modelling Summer 2016 Geometric Modelling Summer 2016 Exercises Benjamin Karer M.Sc. http://gfx.uni-kl.de/~gm Benjamin Karer M.Sc. Geometric Modelling Summer 2016 1 Dierential Geometry Benjamin Karer M.Sc. Geometric Modelling

More information

Frequency, Vibration, and Fourier

Frequency, Vibration, and Fourier Lecture 22: Frequency, Vibration, and Fourier Computer Graphics CMU 15-462/15-662, Fall 2015 Last time: Numerical Linear Algebra Graphics via linear systems of equations Why linear? Have to solve BIG problems

More information

Predicting Graph Labels using Perceptron. Shuang Song

Predicting Graph Labels using Perceptron. Shuang Song Predicting Graph Labels using Perceptron Shuang Song shs037@eng.ucsd.edu Online learning over graphs M. Herbster, M. Pontil, and L. Wainer, Proc. 22nd Int. Conf. Machine Learning (ICML'05), 2005 Prediction

More information

Improved Graph Laplacian via Geometric Consistency

Improved Graph Laplacian via Geometric Consistency Improved Graph Laplacian via Geometric Consistency Dominique C. Perrault-Joncas Google, Inc. dominiquep@google.com Marina Meilă Department of Statistics University of Washington mmp2@uw.edu James McQueen

More information

Graphs in Machine Learning

Graphs in Machine Learning Graphs in Machine Learning Michal Valko Inria Lille - Nord Europe, France TA: Pierre Perrault Partially based on material by: Mikhail Belkin, Jerry Zhu, Olivier Chapelle, Branislav Kveton October 30, 2017

More information

Data Analysis and Manifold Learning Lecture 3: Graphs, Graph Matrices, and Graph Embeddings

Data Analysis and Manifold Learning Lecture 3: Graphs, Graph Matrices, and Graph Embeddings Data Analysis and Manifold Learning Lecture 3: Graphs, Graph Matrices, and Graph Embeddings Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline

More information

An Analysis of the Convergence of Graph Laplacians

An Analysis of the Convergence of Graph Laplacians Daniel Ting Department of Statistics, UC Berkeley Ling Huang Intel Labs Berkeley Michael I. Jordan Department of EECS and Statistics, UC Berkeley dting@stat.berkeley.edu ling.huang@intel.com jordan@cs.berkeley.edu

More information

Cortical Shape Analysis using the Anisotropic Global Point Signature

Cortical Shape Analysis using the Anisotropic Global Point Signature Cortical Shape Analysis using the Anisotropic Global Point Signature Anand A Joshi 1,3, Syed Ashrafulla 1, David W Shattuck 2, Hanna Damasio 3 and Richard M Leahy 1 1 Signal and Image Processing Institute,

More information

Hou, Ch. et al. IEEE Transactions on Neural Networks March 2011

Hou, Ch. et al. IEEE Transactions on Neural Networks March 2011 Hou, Ch. et al. IEEE Transactions on Neural Networks March 2011 Semi-supervised approach which attempts to incorporate partial information from unlabeled data points Semi-supervised approach which attempts

More information

Discrete Differential Geometry. Discrete Laplace-Beltrami operator and discrete conformal mappings.

Discrete Differential Geometry. Discrete Laplace-Beltrami operator and discrete conformal mappings. Discrete differential geometry. Discrete Laplace-Beltrami operator and discrete conformal mappings. Technische Universität Berlin Geometric Methods in Classical and Quantum Lattice Systems, Caputh, September

More information

The crucial role of statistics in manifold learning

The crucial role of statistics in manifold learning The crucial role of statistics in manifold learning Tyrus Berry Postdoc, Dept. of Mathematical Sciences, GMU Statistics Seminar GMU Feb., 26 Postdoctoral position supported by NSF ANALYSIS OF POINT CLOUDS

More information

Robust Laplacian Eigenmaps Using Global Information

Robust Laplacian Eigenmaps Using Global Information Manifold Learning and its Applications: Papers from the AAAI Fall Symposium (FS-9-) Robust Laplacian Eigenmaps Using Global Information Shounak Roychowdhury ECE University of Texas at Austin, Austin, TX

More information

Classification Semi-supervised learning based on network. Speakers: Hanwen Wang, Xinxin Huang, and Zeyu Li CS Winter

Classification Semi-supervised learning based on network. Speakers: Hanwen Wang, Xinxin Huang, and Zeyu Li CS Winter Classification Semi-supervised learning based on network Speakers: Hanwen Wang, Xinxin Huang, and Zeyu Li CS 249-2 2017 Winter Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions Xiaojin

More information