Vertex-frequency analysis on graphs

Applied and Computational Harmonic Analysis

Volumn 40, Issue 2, 2016, Pages 260-291

  Shuman, David I ^a   Ricaud, Benjamin ^b   Vandergheynst, Pierre ^b  

^a MACALESTER COLLEGE   (United States)

^b EPFL   (Switzerland)

Author keywords

Clustering; Generalized translation and modulation; Localization; Signal processing on graphs; Spectral graph theory; Time frequency analysis

Indexed keywords

FOURIER ANALYSIS; GRAPHIC METHODS; MODULATION; SIGNAL PROCESSING;

CLUSTERING; GENERALIZED TRANSLATION AND MODULATIONS; LOCALIZATION; SIGNAL PROCESSING ON GRAPHS; SPECTRAL GRAPH THEORY; TIME FREQUENCY ANALYSIS;

GRAPH THEORY;

EID: 84953636550     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2015.02.005     Document Type: Article

References (40)

1. R. Rubinstein, A.M. Bruckstein, and M. Elad Dictionaries for sparse representation modeling Proc. IEEE 98 6 2010 1045 1057
2. D.I Shuman, S.K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains IEEE Signal Process. Mag. 30 2013 83 98
3. D.I Shuman, B. Ricaud, and P. Vandergheynst A windowed graph Fourier tranform Proc. IEEE Stat. Signal Process. Wkshp Ann Arbor, MI 2012 133 136
4. D. Gleich The MatlabBGL Matlab library http://www.cs.purdue.edu/homes/dgleich/packages/matlab-bgl/index.html
5. P. Flandrin Time-Frequency/Time-Scale Analysis 1999 Academic Press
6. K. Gröchenig Foundations of Time-Frequency Analysis 2001 Birkhäuser
7. S.G. Mallat A Wavelet Tour of Signal Processing 3rd ed. 2008 Academic Press
8. F.K. Chung Spectral Graph Theory CBMS Reg. Conf. Ser. Math. vol. 92 1997 AMS Bokstore
9. U. von Luxburg A tutorial on spectral clustering Stat. Comput. 17 4 2007 395 416
10. O. Chapelle, B. Schölkopf, and A. Zien Semi-Supervised Learning 2006 MIT Press
11. A. Elmoataz, O. Lezoray, and S. Bougleux Nonlocal discrete regularization on weighted graphs: a framework for image and manifold processing IEEE Trans. Image Process. 17 2008 1047 1060
12. X. Zhu, and M. Rabbat Approximating signals supported on graphs Proc. IEEE Int. Conf. Acc., Speech, and Signal Process Kyoto, Japan 2012 3921 3924
13. Y. Dekel, J.R. Lee, and N. Linial Eigenvectors of random graphs: nodal domains Random Structures Algorithms 39 1 2011 39 58
14. I. Dumitriu, and S. Pal Sparse regular random graphs: spectral density and eigenvectors Ann. Probab. 40 5 2012 2197 2235
15. L.V. Tran, V.H. Vu, and K. Wang Sparse random graphs: eigenvalues and eigenvectors Random Structures Algorithms 42 1 2013 110 134
16. S. Brooks, and E. Lindenstrauss Non-localization of eigenfunctions on large regular graphs Israel J. Math. 193 1 2013 1 14
17. G. Strang The discrete cosine transform SIAM Rev. 41 1 1999 135 147
18. N. Saito, and E. Woei On the phase transition phenomenon of graph Laplacian eigenfunctions on trees RIMS Kokyuroku 1743 2011 77 90
19. R.M. Gray Toeplitz and Circulant Matrices: A Review 2006 Now Publishers
20. R. Olfati-Saber Algebraic connectivity ratio of Ramanujan graphs Proc. Amer. Control Conf New York, NY 2007 4619 4624
21. P.N. McGraw, and M. Menzinger Laplacian spectra as a diagnostic tool for network structure and dynamics Phys. Rev. E 77 3 2008 031102-1 031102-14
22. D.K. Hammond, P. Vandergheynst, and R. Gribonval Wavelets on graphs via spectral graph theory Appl. Comput. Harmon. Anal. 30 2 2011 129 150
23. N.J. Higham Functions of Matrices 2008 Society for Industrial and Applied Mathematics
24. L.J. Grady, and J.R. Polimeni Discrete Calculus 2010 Springer
25. K.E. Atkinson An Introduction to Numerical Analysis 1989 John Wiley & Sons
26. M. Abramowitz, and I. Stegun Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables tenth edition 1972 Dover
27. B. Metzger, and P. Stollmann Heat kernel estimates on weighted graphs Bull. Lond. Math. Soc. 32 4 2000 477 483
28. A. Agaskar, and Y.M. Lu An uncertainty principle for functions defined on graphs Proc. SPIE San Diego, CA vol. 8138 2011 pp. 81380T-1-81380T-11
29. A. Agaskar, and Y.M. Lu Uncertainty principles for signals defined on graphs: bounds and characterizations Proc. IEEE Int. Conf. Acc., Speech, and Signal Process Kyoto, Japan 2012 3493 3496
30. R.M. Corless, G.H. Gonnet, D.E. Hare, D.J. Jeffrey, and D.E. Knuth On the Lambert W function Adv. Comput. Math. 5 1 1996 329 359
31. D.I Shuman, B. Ricaud, and P. Vandergheynst Vertex-frequency analysis on graphs arXiv:1307.5708 2013
32. O. Christensen Frames and Bases 2008 Birkhäuser
33. J. Kovačević, and A. Chebira Life beyond bases: the advent of frames (part I) IEEE Signal Process. Mag. 24 2007 86 104
34. J. Kovačević, and A. Chebira Life beyond bases: the advent of frames (part II) IEEE Signal Process. Mag. 24 2007 115 125
35. A.K. Jain, and F. Farrokhnia Unsupervised texture segmentation using Gabor filters Pattern Recognit. 24 12 1991 1167 1186
36. P.L. Combettes, and J.-C. Pesquet Proximal splitting methods in signal processing H.H. Bauschke, R. Burachik, P.L. Combettes, V. Elser, D.R. Luke, H. Wolkowicz, Fixed-Point Algorithms for Inverse Problems in Science and Engineering 2011 Springer-Verlag 185 212
37. M. Benzi, and G.H. Golub Bounds for the entries of matrix functions with applications to preconditioning BIT 39 1999 417 438
38. M. Benzi, and N. Razouk Decay bounds and O(n) algorithms for approximating functions of sparse matrices Electron. Trans. Numer. Anal. 28 2007 16 39
39. G.H. Golub, and G. Meurant Matrices, Moments and Quadrature with Applications 2010 Princeton University Press
40. F.R.K. Chung, and S.-T. Yau Eigenvalues of graphs and Sobolev inequalities Combin. Probab. Comput. 4 1 1995 11 26