Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
Toward an uncertainty principle for weighted...
Transcript of Toward an uncertainty principle for weighted...
![Page 1: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/1.jpg)
EUSIPCO 2015
Toward an uncertainty principlefor weighted graphs
02/09/2015
Bastien Pasdeloup*, Réda Alami*, Vincent Gripon*, Michael Rabbat**
![Page 2: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/2.jpg)
Signal processing on graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
1Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Generalization of classical Fourier analysis to more complex domains
Normalized Laplacian:
![Page 3: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/3.jpg)
Signal processing on graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
1Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Generalization of classical Fourier analysis to more complex domains
Normalized Laplacian:
Assumption: normalized signals
![Page 4: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/4.jpg)
Graph Fourier transform
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
2Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Diagonalization of
( real and symmetric)
Graph Fourier transform
Inverse graph Fourier transform
Graph domain Spectral domain
![Page 5: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/5.jpg)
A portage of tools
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
3Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Filtering
Convolution
Translation
Modulation
Dilatation
…
Reference paper: Shuman et. al – The emerging field on signal processing on graphs – 2013
![Page 6: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/6.jpg)
The tool that interests us here
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
4Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Heisenberg principle A signal cannot be both fully localized in thetime and frequency domains
On graphs A signal cannot be both fully localized in thegraph and spectral domains
![Page 7: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/7.jpg)
The uncertainty principle applied to graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
5Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Reference paper: Agaskar & Lu – A spectral graph uncertainty principle – 2013
![Page 8: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/8.jpg)
The uncertainty principle applied to graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
5Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Reference paper: Agaskar & Lu – A spectral graph uncertainty principle – 2013
Graph spread: – Around a particular node – Use of the geodesic (i.e shortest path) distance
![Page 9: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/9.jpg)
The uncertainty principle applied to graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
5Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Reference paper: Agaskar & Lu – A spectral graph uncertainty principle – 2013
Spectral spread: – Around the smallest eigenvalue (=0) – This choice is often discussed, but corresponds to the steady state
![Page 10: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/10.jpg)
The uncertainty principle applied to graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
5Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Reference paper: Agaskar & Lu – A spectral graph uncertainty principle – 2013
Spectral spread: – Around the smallest eigenvalue (=0) – This choice is often discussed, but corresponds to the steady state
x
0 diffusion steps
![Page 11: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/11.jpg)
The uncertainty principle applied to graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
5Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Reference paper: Agaskar & Lu – A spectral graph uncertainty principle – 2013
Spectral spread: – Around the smallest eigenvalue (=0) – This choice is often discussed, but corresponds to the steady state
x
1 diffusion steps
![Page 12: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/12.jpg)
The uncertainty principle applied to graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
5Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Reference paper: Agaskar & Lu – A spectral graph uncertainty principle – 2013
Spectral spread: – Around the smallest eigenvalue (=0) – This choice is often discussed, but corresponds to the steady state
x
2 diffusion steps
![Page 13: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/13.jpg)
The uncertainty principle applied to graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
5Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Reference paper: Agaskar & Lu – A spectral graph uncertainty principle – 2013
Spectral spread: – Around the smallest eigenvalue (=0) – This choice is often discussed, but corresponds to the steady state
x
3 diffusion steps
![Page 14: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/14.jpg)
The uncertainty principle applied to graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
5Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Reference paper: Agaskar & Lu – A spectral graph uncertainty principle – 2013
Spectral spread: – Around the smallest eigenvalue (=0) – This choice is often discussed, but corresponds to the steady state
x
k diffusion steps
![Page 15: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/15.jpg)
The uncertainty principle applied to graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
5Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Reference paper: Agaskar & Lu – A spectral graph uncertainty principle – 2013
Spectral spread: – Around the smallest eigenvalue (=0) – This choice is often discussed, but corresponds to the steady state
x
Convergence
![Page 16: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/16.jpg)
The uncertainty principle applied to graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
5Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Reference paper: Agaskar & Lu – A spectral graph uncertainty principle – 2013
Spectral spread: – Around the smallest eigenvalue (=0) – This choice is often discussed, but corresponds to the steady state
x
Convergence
Coincides with the observation thatdiffusion concentrates the signal in
the frequency domain, but smoothes itin the graph domain (i.e decreases thegraph Laplacian quadratic form: )
![Page 17: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/17.jpg)
Current limitations of their work
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
6Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
– Currently addresses unweighted graphs only
– Arbitrarily uses the geodesic distance
– Does not give any hint on the choice of the reference node
![Page 18: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/18.jpg)
Current limitations of their work
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
6Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
– Currently addresses unweighted graphs only
– Arbitrarily uses the geodesic distance
– Does not give any hint on the choice of the reference node
Addressed in this paper
![Page 19: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/19.jpg)
A naive extension to weighted graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
7Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Idea #1: Let's do the same with a weighted adjacency matrix!
Geodesic distance is also defined for weighted graphs
The normalized Laplacian is still real and symmetric
![Page 20: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/20.jpg)
A naive extension to weighted graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
7Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Idea #1: Let's do the same with a weighted adjacency matrix!
Geodesic distance is also defined for weighted graphs
The normalized Laplacian is still real and symmetric
This leads to a discontinuity of the graph spreadwith respect to the graph structure
![Page 21: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/21.jpg)
Illustration of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
7Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
![Page 22: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/22.jpg)
Illustration of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
7Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
![Page 23: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/23.jpg)
Illustration of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
7Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
![Page 24: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/24.jpg)
Illustration of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
7Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
![Page 25: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/25.jpg)
Illustration of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
7Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
![Page 26: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/26.jpg)
Explanation of the discontinuity
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
8Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
?
![Page 27: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/27.jpg)
Source of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
9Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
![Page 28: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/28.jpg)
Source of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
9Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Distance function(since we want the spread to
increase as the signal is far away)
![Page 29: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/29.jpg)
Source of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
9Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Distance function(since we want the spread to
increase as the signal is far away)
Recall that this definition of spectral spread is acceptable
because it is minimized for completely diffused signals (that are smooth in the graph domain)
![Page 30: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/30.jpg)
Source of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
9Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Distance function(since we want the spread to
increase as the signal is far away)
Recall that this definition of spectral spread is acceptable
because it is minimized for completely diffused signals (that are smooth in the graph domain)
Laplacian quadratic form:
![Page 31: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/31.jpg)
Source of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
9Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Distance function(since we want the spread to
increase as the signal is far away)
Recall that this definition of spectral spread is acceptable
because it is minimized for completely diffused signals (that are smooth in the graph domain)
Laplacian quadratic form:
To be minimized (i.e localized in the spectral domain),high values in should be associated to very similar nodes
![Page 32: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/32.jpg)
Source of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
9Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Distance function(since we want the spread to
increase as the signal is far away)
Recall that this definition of spectral spread is acceptable
because it is minimized for completely diffused signals (that are smooth in the graph domain)
To be minimized (i.e localized in the spectral domain),high values in should be associated to very similar nodes
Laplacian quadratic form:
![Page 33: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/33.jpg)
Source of the problem
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
9Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Distance function(since we want the spread to
increase as the signal is far away)
Recall that this definition of spectral spread is acceptable
because it is minimized for completely diffused signals (that are smooth in the graph domain)
To be minimized (i.e localized in the spectral domain),high values in should be associated to very similar nodes
Laplacian quadratic form:
From now on, will be regarded as a similarity matrix
![Page 34: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/34.jpg)
A change of distance function
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
10Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
New definition of graph spread:
– Similar to the previous definition
– We need to change the distance function so that we do not use as distances
Proposed requirements on the distance function :
1°)
2°)
3°) is continuous, and if we increase for a single edge , then does not increase
![Page 35: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/35.jpg)
A change of distance function
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
10Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
New definition of graph spread:
– Similar to the previous definition
– We need to change the distance function so that we do not use as distances
Proposed requirements on the distance function :
1°)
2°)
3°) is continuous, and if we increase for a single edge , then does not increase
The spread should be a positive quantity
![Page 36: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/36.jpg)
A change of distance function
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
10Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
New definition of graph spread:
– Similar to the previous definition
– We need to change the distance function so that we do not use as distances
Proposed requirements on the distance function :
1°)
2°)
3°) is continuous, and if we increase for a single edge , then does not increase
To have for and only for a signallocalized on
The spread should be a positive quantity
![Page 37: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/37.jpg)
A change of distance function
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
10Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
New definition of graph spread:
– Similar to the previous definition
– We need to change the distance function so that we do not use as distances
Proposed requirements on the distance function :
1°)
2°)
3°) is continuous, and if we increase for a single edge , then does not increase
Similar graphs shouldhave similar spreads
The spread should be a positive quantity
To have for and only for a signallocalized on
![Page 38: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/38.jpg)
A change of distance function
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
10Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
New definition of graph spread:
– Similar to the previous definition
– We need to change the distance function so that we do not use as distances
Proposed requirements on the distance function :
1°)
2°)
3°) is continuous, and if we increase for a single edge , then does not increase
Similar graphs shouldhave similar spreads
is considered as a matrix of similarities
The spread should be a positive quantity
To have for and only for a signallocalized on
![Page 39: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/39.jpg)
Some compliant functions
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
11Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Inverse similarity matrix:
– Use of the squared geodesic distance with instead of :
– Simple correction of the discontinuity
– Basically, can be replaced by any positive non-increasing function
(eg. Gaussian kernel)
Diffusion distance:
– is a signal fully localized on node
![Page 40: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/40.jpg)
Associated uncertainty curves
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
12Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Mean uncertainty curves for various graphs, for 100 random weights
![Page 41: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/41.jpg)
Associated uncertainty curves
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
12Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Mean uncertainty curves for various graphs, for 100 random weights
softer than
![Page 42: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/42.jpg)
Associated uncertainty curves
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
12Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Mean uncertainty curves for various graphs, for 100 random weights
softer than
Same curves order
![Page 43: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/43.jpg)
Application to semi-localized graphs
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
13Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
![Page 44: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/44.jpg)
Conclusion
Introduction & motivation – Uncertainty on graphs – Extension to weighted graphs – Conclusion
14Bastien Pasdeloup – Toward an uncertainty principle for weighted graphs – EUSIPCO 2015 – 02/09/2015
Summary of the paper:
– Extension of the uncertainty principle to weighted graphs
– Highlight of the confusion when using as a distances matrix
– Statement of requirements on the distance functions used in
Future work:
– Study of the impact of the choice for the distance function
– Obtention of the analytical expressions of the curves
– Study of the impact of the choice of the central node (eg. to compare graphs)
– Use the uncertainty principle to guide a graph reconstruction process
![Page 45: Toward an uncertainty principle for weighted graphsbastien-pasdeloup.com/wp-content/uploads/2017/04/2015_eusipco_slides.pdf · Signal processing on graphs Introduction & motivation](https://reader030.fdocuments.net/reader030/viewer/2022040807/5e48a692a5805e2353698c77/html5/thumbnails/45.jpg)
EUSIPCO 2015
Toward an uncertainty principlefor weighted graphs
02/09/2015
Bastien Pasdeloup*, Réda Alami*, Vincent Gripon*, Michael Rabbat**