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

Size: px
Start display at page:

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

Transcription

1 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 Bronstein, Advanced topics in vision Michael Bronstein, 200 Processing and Analysis of Geometric Shapes tosca.cs.technion.ac.il/book EE Technion, Spring A mathematical exercise A mathematical exercise Since the canonical form is defined up to isometry, we can arbitrarily set Element of a matrix Element matrix of an Conclusion: if points then are isometrically embeddable into Note: can be defined in different ways! 5 6 Gram matrices Back to our problem A matrix of inner products of the form If points with the metric is called a Gram matrix can be isometrically embedded into, then can be realized as a Gram matrix of rank, Properties: which is positive semidefinite (positive semidefinite) Jørgen Pedersen Gram (850-96) A positive semidefinite matrix can be written as of rank Isaac Schoenberg ( ) giving the canonical form [Schoenberg, 935]: Points with the metric can be isometrically embedded into a Euclidean space if and only if

2 5/25/ Classic MDS Properties of classic MDS Usually, a shape is not isometrically embeddable into a Eucludean space, Nested dimensions: the first dimensions of an -dimensional implying that (has negative eignevalues) canonical form are equal to an -dimensional canonical form We can approximate by a Gram matrix of rank The error introduced by taking instead of can be quantified as Classic MDS minimizes the strain Keep m largest eignevalues Global optimization problem no local convergence Canonical form computed as Method known as classic MDS (or classical scaling) Requires computing a few largest eigenvalues of a real symmetric matrix, which can be efficiently solved numerically (e.g. Arnoldi and Lanczos) 9 0 Classical scaling example B A B D C A 2 C MATLAB intermezzo Classic MDS Canonical forms A B C D A 2 B C 2 D D 2 Topological invariance Local methods Make the embedding preserve local properties of the shape Map neighboring points to neighboring points If, then is small. We want the corresponding distance in the embedding space to be small Deformation Deformation +Topology 2

3 5/25/ Local methods Think globally, act locally David Brower Laplacian matrix Matrix formulation Recall stress derivation in LS-MDS Local criterion how far apart the embedding takes neighboring points where is an matrix with elements Global criterion is called the Laplacian matrix where has zero eigenvalue 5 6 Local methods Minimum eigenvalue problems Compute canonical form by solving the optimization problem Lets look at a simplified case: one-dimensional embedding Trivial solution ( collapse to a single point ): points can Introduce a constraint avoiding trivial solution Express the problem using eigendecomposition Geometric intuition: find a unit vector shortened the most by the action of the matrix 7 8 Minimum eigenvalue problems Laplacian eigenmaps Solution of the problem Compute the canonical form by finding the eigenvectors of smallest non-trivial is given as the smallest non-trivial eigenvectors of The smallest eigenvalue is zero and the corresponding eigenvector is constant (collapsing to a point) Method called Laplacian eigenmap [Belkin&Niyogi] is sparse (computational advantage for eigendecomposition) We need the lower part of the spectrum of Nested dimensions like in classic MDS 3

4 5/25/ Laplacian eigenmaps example Continuous case Consider a one-dimensional embedding (due to nested dimension property, each dimension can be considered separately) We were trying to find a map points to neighboring points In the continuous case, we have a smooth map that maps neighboring on surface Classic MDS Laplacian eigenmap Let be a point on and be a point obtained by an infinitesimal displacement from by a vector in the tangent plane By Taylor expansion, Inner product on tangent space (metric tensor) 2 22 Continuous case Continuous analog of Laplacian eigenmaps By the Cauchy-Schwarz inequality Canonical form computed as the minimization problem implying that is small if is small: i.e., points close to are mapped close to where: Continuous local criterion: is the space of square-integrable functions on Continuous global criterion: We can rewrite Stokes theorem Laplace-Beltrami operator Laplace-Beltrami The operator is called Laplace-Beltrami operator Note: we define Laplace-Beltrami operator with minus, unlike many books Laplace-Beltrami operator is a generalization of Laplacian to manifolds In the Euclidean plane, In coordinate notation Intrinsic property of the shape (invariant to isometries) Pierre Simon de Laplace ( ) Eugenio Beltrami ( ) 4

5 5/25/ Properties of Laplace-Beltrami operator Continuous vs discrete problem Let be smooth functions on the surface. Then the Continuous: Laplace-Beltrami operator has the following properties Constant eigenfunction: for any Symmetry: Locality: is independent of for any points Euclidean case: if is Euclidean plane and then Positive semidefinite: Discrete: Laplace-Beltrami operator Laplacian To see the sound Chladni plates Ernst Chladni ['kladnɪ] (75-782) Patterns seen by Chladni are solutions to stationary Helmholtz equation Chladni s experimental setup allowing to visualize acoustic waves Solutions of this equation are eigenfunction of Laplace-Beltrami operator E. Chladni, Entdeckungen über die Theorie des Klanges Laplace-Beltrami operator Laplace-Beltrami eigenfunctions The first eigenfunctions of the Laplace-Beltrami operator An eigenfunction of the Laplace-Beltrami operator computed on different deformations of the shape, showing the invariance of the Laplace-Beltrami operator to isometries 5

6 5/25/ Laplace-Beltrami spectrum Shape DNA Eigendecomposition of Laplace-Beltrami operator of a compact shape gives a discrete set of eigenvalues and eigenfunctions [Reuter et al. 2006]: use the Laplace-Beltrami spectrum isometry-invariant shape descriptor ( shape DNA ) as an Since the Laplace-Beltrami operator is symmetric, eigenfunctions form an orthogonal basis for The eigenvalues and eigenfunctions are isometry invariant Images: Reuter et al. Laplace-Beltrami spectrum Shape DNA Uniqueness of representation ISOMETRIC SHAPES ARE ISOSPECTRAL ARE ISOSPECTRAL SHAPES ISOMETRIC? Shape similarity using Laplace-Beltrami spectrum Images: Reuter et al. Can one hear the shape of the drum? To hear the shape In Chladni s experiments, the spectrum describes acoustic characteristics of the plates ( modes of vibrations) What can be heard from the spectrum: Total Gaussian curvature Euler characteristic Area Mark Kac (94-984) Can we hear the metric? More prosaically: can one reconstruct the shape (up to an isometry) from its Laplace-Beltrami spectrum? 6

7 5/25/ One cannot hear the shape of the drum! Discrete Laplace-Beltrami operator [Gordon et al. 99]: Let the surface be sampled at points and represented as a triangular mesh, and let Discrete version of the Laplace-Beltrami operator In matrix notation where Counter-example of isospectral but not isometric shapes Discrete Laplace-Beltrami eigenfunctions Discrete vs discretized Find the discrete eigenfunctions of the Laplace-Beltrami operator by solving the generalized eigenvalue problem Continuous surface Laplace-Beltrami operator Continuous eigenfunctions and eigenvalues where is an matrix whose columns are the eigenfunctions is a diagonal matrix of corresponding eigenvalues Discretize the surface as a graph Discretize Laplace-Beltrami operator, preserving some of the continuous properties Discretize eigenfunctions and eigenvalues Graph Laplacian Eigendecomposition Eigendecomposition Levy 2006 Reuter, Biasotti, Giorgi, Patane & Spagnuolo 2009 Discrete Laplacian Discretized Laplacian FEM 4 42 Discrete Laplace-Beltrami operator Properties of discrete Laplace-Beltrami operator The discrete analog of the properties of the continuous Laplace-Betrami operator is Discrete Laplacian Cotangent weight 2 Symmetry: Locality: if are not directly connected Euclidean case: if is Euclidean plane, (umbrella operator); or valence of vertex (Tutte) sum of areas of triangles sharing vertex Positive semidefinite: In order for the discretization to be consistent,. Tutte 963; Zhang Pinkall 993; Meyer 2003 Convergence: solution of discrete PDE with of continuous PDE with for converges to the solution 7

8 5/25/ No free lunch Finite elements method Laplacian matrix we used in Laplacian eigenmaps does not converge to the continuous Laplace-Beltrami operator Eigendecomposition problem in the weak form for any smooth There exist many other approximations of the Laplace-Beltrami operator, satisfying different properties [Wardetzky et al. 2007]: there is no discretization of the Laplace- Beltrami operator satisfying simultaneously all the desired properties Given a finite basis can be expanded as Write a system of equation spanning a subspace of posed as a generalized eigenvalue problem Reuter, Biasotti, Giorgi, Patane & Spagnuolo

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

IFT LAPLACIAN APPLICATIONS. Mikhail Bessmeltsev

IFT LAPLACIAN APPLICATIONS.   Mikhail Bessmeltsev IFT 6112 09 LAPLACIAN APPLICATIONS http://www-labs.iro.umontreal.ca/~bmpix/teaching/6112/2018/ Mikhail Bessmeltsev Rough Intuition http://pngimg.com/upload/hammer_png3886.png You can learn a lot about

More information

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

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

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

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

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

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

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

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

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

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

Introduction to Spectral Geometry

Introduction to Spectral Geometry Chapter 1 Introduction to Spectral Geometry From P.-S. Laplace to E. Beltrami The Laplace operator was first introduced by P.-S. Laplace (1749 1827) for describing celestial mechanics (the notation is

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

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

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

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

Directional Field. Xiao-Ming Fu

Directional Field. Xiao-Ming Fu Directional Field Xiao-Ming Fu Outlines Introduction Discretization Representation Objectives and Constraints Outlines Introduction Discretization Representation Objectives and Constraints Definition Spatially-varying

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

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

Geometry for Physicists

Geometry for Physicists Hung Nguyen-Schafer Jan-Philip Schmidt Tensor Analysis and Elementary Differential Geometry for Physicists and Engineers 4 i Springer Contents 1 General Basis and Bra-Ket Notation 1 1.1 Introduction to

More information

Duke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014

Duke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014 Duke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014 Linear Algebra A Brief Reminder Purpose. The purpose of this document

More information

Math 302 Outcome Statements Winter 2013

Math 302 Outcome Statements Winter 2013 Math 302 Outcome Statements Winter 2013 1 Rectangular Space Coordinates; Vectors in the Three-Dimensional Space (a) Cartesian coordinates of a point (b) sphere (c) symmetry about a point, a line, and a

More information

Linear Algebra Massoud Malek

Linear Algebra Massoud Malek CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product

More information

Applied Linear Algebra in Geoscience Using MATLAB

Applied Linear Algebra in Geoscience Using MATLAB Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in

More information

INNER PRODUCT SPACE. Definition 1

INNER PRODUCT SPACE. Definition 1 INNER PRODUCT SPACE Definition 1 Suppose u, v and w are all vectors in vector space V and c is any scalar. An inner product space on the vectors space V is a function that associates with each pair of

More information

14 Singular Value Decomposition

14 Singular Value Decomposition 14 Singular Value Decomposition For any high-dimensional data analysis, one s first thought should often be: can I use an SVD? The singular value decomposition is an invaluable analysis tool for dealing

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

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

Lecture 1 Introduction

Lecture 1 Introduction Lecture 1 Introduction 1 The Laplace operator On the 3-dimensional Euclidean space, the Laplace operator (or Laplacian) is the linear differential operator { C 2 (R 3 ) C 0 (R 3 ) : f 2 f + 2 f + 2 f,

More information

Focus was on solving matrix inversion problems Now we look at other properties of matrices Useful when A represents a transformations.

Focus was on solving matrix inversion problems Now we look at other properties of matrices Useful when A represents a transformations. Previously Focus was on solving matrix inversion problems Now we look at other properties of matrices Useful when A represents a transformations y = Ax Or A simply represents data Notion of eigenvectors,

More information

Lecture: Some Practical Considerations (3 of 4)

Lecture: Some Practical Considerations (3 of 4) Stat260/CS294: Spectral Graph Methods Lecture 14-03/10/2015 Lecture: Some Practical Considerations (3 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough.

More information

How curvature shapes space

How curvature shapes space How curvature shapes space Richard Schoen University of California, Irvine - Hopf Lecture, ETH, Zürich - October 30, 2017 The lecture will have three parts: Part 1: Heinz Hopf and Riemannian geometry Part

More information

Numerical optimization. Numerical optimization. Longest Shortest where Maximal Minimal. Fastest. Largest. Optimization problems

Numerical optimization. Numerical optimization. Longest Shortest where Maximal Minimal. Fastest. Largest. Optimization problems 1 Numerical optimization Alexander & Michael Bronstein, 2006-2009 Michael Bronstein, 2010 tosca.cs.technion.ac.il/book Numerical optimization 048921 Advanced topics in vision Processing and Analysis of

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

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

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

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra. DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1

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

Curvatures, Invariants and How to Get Them Without (M)Any Derivatives

Curvatures, Invariants and How to Get Them Without (M)Any Derivatives Curvatures, Invariants and How to Get Them Without (M)Any Derivatives Mathieu Desbrun & Peter Schröder 1 Classical Notions Curves arclength parameterization center of osculating ( kissing ) circle (also

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

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

2. Review of Linear Algebra

2. Review of Linear Algebra 2. Review of Linear Algebra ECE 83, Spring 217 In this course we will represent signals as vectors and operators (e.g., filters, transforms, etc) as matrices. This lecture reviews basic concepts from linear

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

L26: Advanced dimensionality reduction

L26: Advanced dimensionality reduction L26: Advanced dimensionality reduction The snapshot CA approach Oriented rincipal Components Analysis Non-linear dimensionality reduction (manifold learning) ISOMA Locally Linear Embedding CSCE 666 attern

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

Nonlinear Dimensionality Reduction

Nonlinear Dimensionality Reduction Nonlinear Dimensionality Reduction Piyush Rai CS5350/6350: Machine Learning October 25, 2011 Recap: Linear Dimensionality Reduction Linear Dimensionality Reduction: Based on a linear projection of the

More information

Response to reviewer comments

Response to reviewer comments Response to reviewer comments Paper Number: 07C27 Author(s): Hao Zhang Oliver van Kaick Ramsay Dyer Paper Title: Spectral mesh processing Dear Editor and reviewers: We greatly appreciate the thorough and

More information

Dimension Reduction Techniques. Presented by Jie (Jerry) Yu

Dimension Reduction Techniques. Presented by Jie (Jerry) Yu Dimension Reduction Techniques Presented by Jie (Jerry) Yu Outline Problem Modeling Review of PCA and MDS Isomap Local Linear Embedding (LLE) Charting Background Advances in data collection and storage

More information

THE UNIFORMISATION THEOREM OF RIEMANN SURFACES

THE UNIFORMISATION THEOREM OF RIEMANN SURFACES THE UNIFORISATION THEORE OF RIEANN SURFACES 1. What is the aim of this seminar? Recall that a compact oriented surface is a g -holed object. (Classification of surfaces.) It can be obtained through a 4g

More information

Functional Analysis Review

Functional Analysis Review Outline 9.520: Statistical Learning Theory and Applications February 8, 2010 Outline 1 2 3 4 Vector Space Outline A vector space is a set V with binary operations +: V V V and : R V V such that for all

More information

Lecture Notes 1: Vector spaces

Lecture Notes 1: Vector spaces Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector

More information

Geometric Constraints II

Geometric Constraints II Geometric Constraints II Realizability, Rigidity and Related theorems. Embeddability of Metric Spaces Section 1 Given the matrix D d i,j 1 i,j n corresponding to a metric space, give conditions under which

More information

Lecture 3: Review of Linear Algebra

Lecture 3: Review of Linear Algebra ECE 83 Fall 2 Statistical Signal Processing instructor: R Nowak Lecture 3: Review of Linear Algebra Very often in this course we will represent signals as vectors and operators (eg, filters, transforms,

More information

Lecture 3: Review of Linear Algebra

Lecture 3: Review of Linear Algebra ECE 83 Fall 2 Statistical Signal Processing instructor: R Nowak, scribe: R Nowak Lecture 3: Review of Linear Algebra Very often in this course we will represent signals as vectors and operators (eg, filters,

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

Review problems for MA 54, Fall 2004.

Review problems for MA 54, Fall 2004. Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on

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

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

Inner product spaces. Layers of structure:

Inner product spaces. Layers of structure: Inner product spaces Layers of structure: vector space normed linear space inner product space The abstract definition of an inner product, which we will see very shortly, is simple (and by itself is pretty

More information

Introduction to Spectral Theory

Introduction to Spectral Theory P.D. Hislop I.M. Sigal Introduction to Spectral Theory With Applications to Schrodinger Operators Springer Introduction and Overview 1 1 The Spectrum of Linear Operators and Hilbert Spaces 9 1.1 TheSpectrum

More information

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,

More information

Some Planar Isospectral Domains. Peter Buser, John Conway, Peter Doyle, and Klaus-Dieter Semmler. 1 Introduction

Some Planar Isospectral Domains. Peter Buser, John Conway, Peter Doyle, and Klaus-Dieter Semmler. 1 Introduction IMRN International Mathematics Research Notices 1994, No. 9 Some Planar Isospectral Domains Peter Buser, John Conway, Peter Doyle, and Klaus-Dieter Semmler 1 Introduction In 1965, Mark Kac [6] asked, Can

More information

Global (ISOMAP) versus Local (LLE) Methods in Nonlinear Dimensionality Reduction

Global (ISOMAP) versus Local (LLE) Methods in Nonlinear Dimensionality Reduction Global (ISOMAP) versus Local (LLE) Methods in Nonlinear Dimensionality Reduction A presentation by Evan Ettinger on a Paper by Vin de Silva and Joshua B. Tenenbaum May 12, 2005 Outline Introduction The

More information

The Laplace-Beltrami-Operator on Riemannian Manifolds. 1 Why do we need the Laplace-Beltrami-Operator?

The Laplace-Beltrami-Operator on Riemannian Manifolds. 1 Why do we need the Laplace-Beltrami-Operator? Frank Schmidt Computer Vision Group - Technische Universität ünchen Abstract This report mainly illustrates a way to compute the Laplace-Beltrami-Operator on a Riemannian anifold and gives information

More information

Riemann Surface. David Gu. SMI 2012 Course. University of New York at Stony Brook. 1 Department of Computer Science

Riemann Surface. David Gu. SMI 2012 Course. University of New York at Stony Brook. 1 Department of Computer Science Riemann Surface 1 1 Department of Computer Science University of New York at Stony Brook SMI 2012 Course Thanks Thanks for the invitation. Collaborators The work is collaborated with Shing-Tung Yau, Feng

More information

Upon successful completion of MATH 220, the student will be able to:

Upon successful completion of MATH 220, the student will be able to: MATH 220 Matrices Upon successful completion of MATH 220, the student will be able to: 1. Identify a system of linear equations (or linear system) and describe its solution set 2. Write down the coefficient

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

In English, this means that if we travel on a straight line between any two points in C, then we never leave C.

In English, this means that if we travel on a straight line between any two points in C, then we never leave C. Convex sets In this section, we will be introduced to some of the mathematical fundamentals of convex sets. In order to motivate some of the definitions, we will look at the closest point problem from

More information

Discrete Euclidean Curvature Flows

Discrete Euclidean Curvature Flows Discrete Euclidean Curvature Flows 1 1 Department of Computer Science SUNY at Stony Brook Tsinghua University 2010 Isothermal Coordinates Relation between conformal structure and Riemannian metric Isothermal

More information

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

MATH 240 Spring, Chapter 1: Linear Equations and Matrices MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear

More information

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column

More information

Quantifying Shape Deformations by Variation of Geometric Spectrum

Quantifying Shape Deformations by Variation of Geometric Spectrum Quantifying Shape Deformations by Variation of Geometric Spectrum Hajar Hamidian, Jiaxi Hu, Zichun Zhong, and Jing Hua Wayne State University, Detroit, MI 48202, USA Abstract. This paper presents a registration-free

More information

Data Analysis and Manifold Learning Lecture 7: Spectral Clustering

Data Analysis and Manifold Learning Lecture 7: Spectral Clustering Data Analysis and Manifold Learning Lecture 7: Spectral Clustering Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline of Lecture 7 What is spectral

More information

Spectral Graph Theory and its Applications. Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity

Spectral Graph Theory and its Applications. Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity Spectral Graph Theory and its Applications Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity Outline Adjacency matrix and Laplacian Intuition, spectral graph drawing

More information

Applied Linear Algebra in Geoscience Using MATLAB

Applied Linear Algebra in Geoscience Using MATLAB Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in

More information

CE-570 Advanced Structural Mechanics - Arun Prakash

CE-570 Advanced Structural Mechanics - Arun Prakash Ch1-Intro Page 1 CE-570 Advanced Structural Mechanics - Arun Prakash The BIG Picture What is Mechanics? Mechanics is study of how things work: how anything works, how the world works! People ask: "Do you

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

Using heat invariants to hear the geometry of orbifolds. Emily Dryden CAMGSD

Using heat invariants to hear the geometry of orbifolds. Emily Dryden CAMGSD Using heat invariants to hear the geometry of orbifolds Emily Dryden CAMGSD 7 March 2006 1 The Plan 1. Historical motivation 2. Orbifolds 3. Heat kernel and heat invariants 4. Applications 2 Historical

More information

GEOPHYSICAL INVERSE THEORY AND REGULARIZATION PROBLEMS

GEOPHYSICAL INVERSE THEORY AND REGULARIZATION PROBLEMS Methods in Geochemistry and Geophysics, 36 GEOPHYSICAL INVERSE THEORY AND REGULARIZATION PROBLEMS Michael S. ZHDANOV University of Utah Salt Lake City UTAH, U.S.A. 2OO2 ELSEVIER Amsterdam - Boston - London

More information

Mobile Robotics 1. A Compact Course on Linear Algebra. Giorgio Grisetti

Mobile Robotics 1. A Compact Course on Linear Algebra. Giorgio Grisetti Mobile Robotics 1 A Compact Course on Linear Algebra Giorgio Grisetti SA-1 Vectors Arrays of numbers They represent a point in a n dimensional space 2 Vectors: Scalar Product Scalar-Vector Product Changes

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

Lecture 10: Dimension Reduction Techniques

Lecture 10: Dimension Reduction Techniques Lecture 10: Dimension Reduction Techniques Radu Balan Department of Mathematics, AMSC, CSCAMM and NWC University of Maryland, College Park, MD April 17, 2018 Input Data It is assumed that there is a set

More information

Spectral Theorem for Self-adjoint Linear Operators

Spectral Theorem for Self-adjoint Linear Operators Notes for the undergraduate lecture by David Adams. (These are the notes I would write if I was teaching a course on this topic. I have included more material than I will cover in the 45 minute lecture;

More information

Apprentissage non supervisée

Apprentissage non supervisée Apprentissage non supervisée Cours 3 Higher dimensions Jairo Cugliari Master ECD 2015-2016 From low to high dimension Density estimation Histograms and KDE Calibration can be done automacally But! Let

More information

Applied Linear Algebra

Applied Linear Algebra Applied Linear Algebra Peter J. Olver School of Mathematics University of Minnesota Minneapolis, MN 55455 olver@math.umn.edu http://www.math.umn.edu/ olver Chehrzad Shakiban Department of Mathematics University

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

15 Singular Value Decomposition

15 Singular Value Decomposition 15 Singular Value Decomposition For any high-dimensional data analysis, one s first thought should often be: can I use an SVD? The singular value decomposition is an invaluable analysis tool for dealing

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

Linear Systems. Class 27. c 2008 Ron Buckmire. TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5.4

Linear Systems. Class 27. c 2008 Ron Buckmire. TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5.4 Linear Systems Math Spring 8 c 8 Ron Buckmire Fowler 9 MWF 9: am - :5 am http://faculty.oxy.edu/ron/math//8/ Class 7 TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5. Summary

More information

Contents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2

Contents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2 Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition

More information

Last Time. Social Network Graphs Betweenness. Graph Laplacian. Girvan-Newman Algorithm. Spectral Bisection

Last Time. Social Network Graphs Betweenness. Graph Laplacian. Girvan-Newman Algorithm. Spectral Bisection Eigenvalue Problems Last Time Social Network Graphs Betweenness Girvan-Newman Algorithm Graph Laplacian Spectral Bisection λ 2, w 2 Today Small deviation into eigenvalue problems Formulation Standard eigenvalue

More information

Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University

Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009 Preface The title of the book sounds a bit mysterious. Why should anyone read this

More information

University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012

University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012 University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012 Name: Exam Rules: This is a closed book exam. Once the exam

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

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

8 Eigenvectors and the Anisotropic Multivariate Gaussian Distribution

8 Eigenvectors and the Anisotropic Multivariate Gaussian Distribution Eigenvectors and the Anisotropic Multivariate Gaussian Distribution Eigenvectors and the Anisotropic Multivariate Gaussian Distribution EIGENVECTORS [I don t know if you were properly taught about eigenvectors

More information

METHODS OF ENGINEERING MATHEMATICS

METHODS OF ENGINEERING MATHEMATICS METHODS OF ENGINEERING MATHEMATICS Edward J. Hang Kyung K. Choi Department of Mechanical Engineering College of Engineering The University of Iowa Iowa City, Iowa 52242 METHODS OF ENGINEERING MATHEMATICS

More information

Index. C 2 ( ), 447 C k [a,b], 37 C0 ( ), 618 ( ), 447 CD 2 CN 2

Index. C 2 ( ), 447 C k [a,b], 37 C0 ( ), 618 ( ), 447 CD 2 CN 2 Index advection equation, 29 in three dimensions, 446 advection-diffusion equation, 31 aluminum, 200 angle between two vectors, 58 area integral, 439 automatic step control, 119 back substitution, 604

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