A first-round discussion* on

Slides:



Advertisements
Similar presentations
FRACTAL DIMENSION OF BIOFILM IMAGES
Advertisements

Window Fourier and wavelet transforms. Properties and applications of the wavelets. A.S. Yakovlev.
Ordinary Least-Squares
Self-Organizing Maps Projection of p dimensional observations to a two (or one) dimensional grid space Constraint version of K-means clustering –Prototypes.
Intel Research Internet Coordinate Systems - 03/03/2004 Internet Coordinate Systems Marcelo Pias Intel Research Cambridge
Nonlinear Dimension Reduction Presenter: Xingwei Yang The powerpoint is organized from: 1.Ronald R. Coifman et al. (Yale University) 2. Jieping Ye, (Arizona.
Princeton University Using the computer to select the right variables Rationale: Lake Carnegie, Princeton, NJ Straight Line Distance Actual transition.
MRA basic concepts Jyun-Ming Chen Spring Introduction MRA (multi- resolution analysis) –Construct a hierarchy of approximations to functions in.
1 Numerical Geometry of Non-Rigid Shapes Diffusion Geometry Diffusion geometry © Alexander & Michael Bronstein, © Michael Bronstein, 2010 tosca.cs.technion.ac.il/book.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Shape Space Exploration of Constrained Meshes Yongliang Yang, Yijun Yang, Helmut Pottmann, Niloy J. Mitra.
Topographic Maps. 1.This is what you call the vertical distance between the contour lines. 2.These connect points of equal elevation. 3.Gently sloping.
10/11/2001Random walks and spectral segmentation1 CSE 291 Fall 2001 Marina Meila and Jianbo Shi: Learning Segmentation by Random Walks/A Random Walks View.
Ronald R. Coifman , Stéphane Lafon, 2006
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,
With thanks to Zhijun Wu An introduction to the algorithmic problems of Distance Geometry.
Lecture 21: Spectral Clustering
A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts Dhillon, Inderjit S., Yuqiang Guan, and Brian Kulis.
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.
Improving Image registration accuracy Narendhran Vijayakumar 02/29/2008.
A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts
1 Data Analysis  Data Matrix Variables ObjectsX1X1 X2X2 X3X3 …XPXP n.
Amos Storkey, School of Informatics. Density Traversal Clustering and Generative Kernels a generative framework for spectral clustering Amos Storkey, Tom.
Texture Mapping using Surface Flattening via Multi-Dimensional Scaling G.Zigelman, R.Kimmel, N.Kiryati IEEE Transactions on Visualization and Computer.
Diffusion Geometries, and multiscale Harmonic Analysis on graphs and complex data sets. Multiscale diffusion geometries, “Ontologies and knowledge building”
Clustering Vertices of 3D Animated Meshes
Diffusion Maps and Spectral Clustering
C HAPTER 4 Inner Product & Orthogonality. C HAPTER O UTLINE Introduction Norm of the Vector, Examples of Inner Product Space - Euclidean n-space - Function.
Presented By Wanchen Lu 2/25/2013
Orthogonal moments Motivation for using OG moments Stable calculation by recurrent relations Easier and stable image reconstruction - set of orthogonal.
Clustering methods Course code: Pasi Fränti Speech & Image Processing Unit School of Computing University of Eastern Finland Joensuu,
MMDS- Stanford 2008 Harmonic Analysis, diffusion geometries and Multi Scale organizations of data and matrices. R.R Coifman Department of Mathematics,Yale.
Image Segmentation Seminar III Xiaofeng Fan. Today ’ s Presentation Problem Definition Problem Definition Approach Approach Segmentation Methods Segmentation.
Linear Image Reconstruction Bart Janssen 13-11, 2007 Eindhoven.
Wavelet Packets  Shortcomings of standard orthogonal (bi-orthogonal) multi-resolution structure of DWT,  Insufficient flexibility for the analysis of.
Computer Vision Lab. SNU Young Ki Baik Nonlinear Dimensionality Reduction Approach (ISOMAP, LLE)
Markov Cluster (MCL) algorithm Stijn van Dongen.
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
Learning Spectral Clustering, With Application to Speech Separation F. R. Bach and M. I. Jordan, JMLR 2006.
Class 26: Question 1 1.An orthogonal basis for A 2.An orthogonal basis for the column space of A 3.An orthogonal basis for the row space of A 4.An orthogonal.
D. Rincón, M. Roughan, W. Willinger – Towards a Meaningful MRA of Traffic Matrices 1/36 Towards a Meaningful MRA for Traffic Matrices D. Rincón, M. Roughan,
Math 285 Project Diffusion Maps Xiaoyan Chong Department of Mathematics and Statistics San Jose State University.
Value Function Approximation with Diffusion Wavelets and Laplacian Eigenfunctions by S. Mahadevan & M. Maggioni Discussion led by Qi An ECE, Duke University.
Multivariate time series analysis Bijan Pesaran Center for Neural Science New York University.
3.3 Network-Centric Community Detection  Network-Centric Community Detection –consider the global topology of a network. –It aims to partition nodes of.
Geometric diffusions as a tool for harmonic analysis and structure definition of data By R. R. Coifman et al. The second-round discussion* on * The first-round.
Chapter 61 Chapter 7 Review of Matrix Methods Including: Eigen Vectors, Eigen Values, Principle Components, Singular Value Decomposition.
An inner product on a vector space V is a function that, to each pair of vectors u and v in V, associates a real number and satisfies the following.
By Poornima Balakrishna Rajesh Ganesan George Mason University A Comparison of Classical Wavelet with Diffusion Wavelets.
Random Walk for Similarity Testing in Complex Networks
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Intrinsic Data Geometry from a Training Set
Multi-resolution image processing & Wavelet
Elementary Linear Algebra
Markov Chains Mixing Times Lecture 5
SDE: Graph Drawing Using Spectral Distance Embedding
Neural Odometry: The Discrete Charm of the Entorhinal Cortex
Wahlund Wahlund et al (1990) The brain in healthy aged individuals: MR imaging. Radiology 174: Image© J Wardlaw, Univ of Edinburgh.
Signal & Weight Vector Spaces
Ilan Ben-Bassat Omri Weinstein
Lecture 13 Operations in Graphics and Geometric Modeling I: Projection, Rotation, and Reflection Shang-Hua Teng.
Signal & Weight Vector Spaces
Neural Odometry: The Discrete Charm of the Entorhinal Cortex
Embedding Metrics into Geometric Spaces
Lecture 13 Operations in Graphics and Geometric Modeling I: Projection, Rotation, and Reflection Shang-Hua Teng.
Clusters and Densities
Clusters and Densities
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Presentation transcript:

A first-round discussion* on Geometric diffusions as a tool for harmonic analysis and structure definition of data By R. R. Coifman et al. *The second-round discussion is to be led by Shihao

Spectral clustering Markov random walk – the diffusion operator Spectral decomposition Diffusion maps

Spectral decomposition of m-step random walk The diffusion map embeds the data into a Euclidean space in which the Euclidean distance is equal to the diffusion distance. Diffusion distance of m-step random walk The diffusion distance measures the rate of connectivity between xi and xj.

Multi-scale analysis of diffusion Interpret A as a dilation operator Discretize the semi-group {At:t>0} of the powers of A at a logarithmic scale which satisfy

Downsampling, orthogonalization, and operator compression The detail subspaces Downsampling, orthogonalization, and operator compression A - diffusion operator, G – Gram-Schmidt ortho-normalization, M - AG - diffusion maps: X is the data set

Diffusion multi-resolution analysis on the circle Diffusion multi-resolution analysis on the circle. Consider 256 points on the unit circle, starting with 0,k=k and with the standard diffusion. Plot several scaling functions in each approximation space Vj.

To be discussed a second-round led by Shihao Thanks!