A Multiscale Pyramid Transform for Graph Signals

IEEE Transactions on Signal Processing

Volumn 64, Issue 8, 2016, Pages 2119-2134

  Shuman, David I ^a   Faraji, Mohammad Javad ^b   Vandergheynst, Pierre ^b  

^a MACALESTER COLLEGE   (United States)

^b EPFL   (Switzerland)

Author keywords

graph downsampling; interpolation; Kron reduction; Laplacian pyramid; multiresolution; Signal processing on graphs; spectral graph theory; spectral sparsification

Indexed keywords

CLUSTERING ALGORITHMS; GRAPHIC METHODS; INTERPOLATION; LAPLACE TRANSFORMS; SIGNAL PROCESSING; SIGNAL SAMPLING; TOPOLOGY;

DOWNSAMPLING; KRON REDUCTION; LAPLACIAN PYRAMID; MULTIRESOLUTION; SIGNAL PROCESSING ON GRAPHS; SPARSIFICATION; SPECTRAL GRAPH THEORY;

GRAPH THEORY;

EID: 84963622932     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2015.2512529     Document Type: Article

References (72)

1. M. J. Faraji, "A Laplacian pyramid scheme in graph signal processing," Master's thesis, Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland, Jun. 2011.
2. N. Perraudin, J. Paratte, D. I. Shuman, V. Kalofolias, P. Vandergheynst, and D. K. Hammond, "GSPBOX: A toolbox for signal processing on graphs," Aug. 2014 [Online]. Available: http://arxiv.org/abs/1408.5781
3. 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., vol. 30, pp. 83-98, May 2013.
4. M. Crovella and E. Kolaczyk, "Graph wavelets for spatial traffic analysis," in Proc. IEEE Infocom., Mar. 2003, vol. 3, pp. 1848-1857.
5. R. R. Coifman and M. Maggioni, "Diffusion wavelets," Appl. Comput. Harmon. Anal., vol. 21, no. 1, pp. 53-94, Jul. 2006.
6. D. K. Hammond, P. Vandergheynst, and R. Gribonval, "Wavelets on graphs via spectral graph theory," Appl. Comput. Harmon. Anal., vol. 30, no. 2, pp. 129-150, Mar. 2011.
7. M. Jansen, G. P. Nason, and B. W. Silverman, "Multiscale methods for data on graphs and irregular multidimensional situations," J. R. Statist. Soc. Ser. B Stat. Methodol., vol. 71, no. 1, pp. 97-125, 2009.
8. S. K. Narang and A. Ortega, "Lifting based wavelet transforms on graphs," in Proc. APSIPA ASC, Sapporo, Japan, Oct. 2009, pp. 441-444.
9. S. K. Narang and A. Ortega, "Local two-channel critically sampled filter-banks on graphs," in Proc. Int. Conf. Image Process., Hong Kong, Sep. 2010, pp. 333-336.
10. V. N. Ekambaram, G. C. Fanti, B. Ayazifar, and K. Ramchandran, "Critically-sampled perfect-reconstruction spline-wavelet filter banks for graph signals," in Proc. Glob. Conf. Signal Inf. Process., Austin, TX, USA, Dec. 2013, pp. 475-478.
11. M. Gavish, B. Nadler, and R. R. Coifman, "Multiscale wavelets on trees, graphs and high dimensional data: Theory and applications to semi supervised learning," in Proc. Int. Conf.Mach. Learn., Haifa, Israel, Jun. 2010, pp. 367-374.
12. S.-H. Teng, "Coarsening, sampling, and smoothing: Elements of the multilevel method," in Parallel Processing, IMA Volumes in Mathematics and Its Applications, 105. New York, NY, USA: Springer-Verlag, 1999, pp. 247-276.
13. A. Brandt, "Multiscale scientific computation: Review 2001," in Multiscale and Multiresolution Methods: Theory and Applications, Lecture Notes in Comput. Sci. 20, T. J. Barth, T. Chan, and R. Haimes, Eds. New York, NY, USA: Springer-Verlag, 2001, pp. 3-96.
14. D. Ron, I. Safro, and A. Brandt, "Relaxation-based coarsening and multiscale graph organization," Multiscale Model. Simul., vol. 9, no. 1, pp. 407-423, Sep. 2011.
15. N. K. Vishnoi,, ser. Foundations and Trends in Computer Science. Norwell, MA, USA: Now Publishers, 2013.
16. P. J. Burt and E. H. Adelson, "The Laplacian pyramid as a compact image code," IEEE Trans. Commun., vol. 31, pp. 532-540, Apr. 1983.
17. R. Roth, "On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph," Linear Algebra Appl., vol. 118, pp. 1-10, June 1989.
18. T. Biyikoglu, J. Leydold, and P. F. Stadler, Laplacian Eigenvectors of Graphs, ser. Lecture Notes in Mathematics. New York, NY, USA: Springer, 2007, vol. 1915.
19. S. K. Narang and A. Ortega, "Downsampling graphs using spectral theory," in Proc. IEEE Int. Conf. Acc., Speech, and Signal Process., Prague, Czech Republic, May 2011, pp. 4208-4211.
20. S. K. Narang and A. Ortega, "Perfect reconstruction two-channel wavelet filter banks for graph structured data," IEEE Trans. Signal Process., vol. 60, no. 6, pp. 2786-2799, Jun. 2012.
21. G. Shen and A. Ortega, "Tree-based wavelets for image coding: Orthogonalization and tree selection," in Proc. Picture Coding Symp., Chicago, IL, USA, May 2009, pp. 1-4.
22. B. Aspvall and J. R. Gilbert, "Graph coloring using eigenvalue decomposition," SIAM J. Algebra Disc. Meth., vol. 5, no. 4, pp. 526-538, 1984.
23. U. von Luxburg, "A tutorial on spectral clustering," Statist. Comput., vol. 17, no. 4, pp. 395-416, 2007.
24. E. B. Davies, G. M. L. Gladwell, J. Leydold, and P. F. Stadler, "Discrete nodal domain theorems," Linear Algebra Appl., vol. 336, no. 1-3, pp. 51-60, Oct. 2001.
25. G. Berkolaiko, "A lower bound for nodal count on discrete and metric graphs," Commun. Math. Phys., vol. 278, no. 3, pp. 803-819, 2008.
26. I. Oren, "Nodal domain counts and the chromatic number of graphs," J. Phys. A, Math. Theor., vol. 40, no. 32, pp. 9825-9832, 2007.
27. S. T. Barnard and H. D. Simon, "Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems," Concurrency: Practice Exper., vol. 6, no. 2, pp. 101-117, Apr. 1994.
28. F. Dörfler and F. Bullo, "Kron reduction of graphs with applications to electrical networks," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 60, no. 1, pp. 150-163, Jan. 2013.
29. F. Zhang, The Schur Complement and Its Applications. New York, NY, USA: Springer, 2005.
30. D. J. Klein and M. Randic, "Resistance distance," J. Math. Chem., vol. 12, pp. 81-95, 1993.
31. D. A. Spielman and N. Srivastava, "Graph sparsification by effective resistances," SIAM J. Comput., vol. 40, no. 6, pp. 1913-1926, 2011.
32. S. Lafon and A. B. Lee, "Diffusion maps and coarse-graining: A unified framework for dimensionality reduction, graph partitioning, and data set parameterization," IEEE Trans. Pattern Anal.Mach. Intell., vol. 28, no. 9, pp. 1393-1403, Sept. 2006.
33. O. E. Livne and A. Brandt, "Lean algebraic multigrid (LAMG): Fast graph Laplacian linear solver," SIAM J. Sci. Comput., vol. 34, no. 4, pp. B499-B522, 2012.
34. G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 359-392, 1998.
35. I. Dhillon, Y. Guan, and B. Kulis, "Weighted graph cuts without eigenvectors a multilevel approach," IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 11, pp. 1944-1957, Nov. 2007.
36. C. Walshaw, "The graph partitioning archive," [Online]. Available: http://staffweb.cms.gre.ac.uk/~wc06/partition/
37. F. K. Chung, Spectral Graph Theory, ser. CBMS Regional Conference Series in Mathematics. Providence, RI, USA: AMS, 1997, vol. 92.
38. N. J. Higham, Functions of Matrices. Philadelphia, PA, USA: SIAM, 2008.
39. A. Sandryhaila and J. M. F. Moura, "Discrete signal processing on graphs," IEEE Trans. Signal Process., vol. 61, no. 7, pp. 1644-1656, Apr. 2013.
40. A. Sandryhaila and J. M. F. Moura, "Discrete signal processing on graphs: Frequency analysis," IEEE. Trans. Signal Process., vol. 62, no. 12, pp. 3042-3054, June 2014.
41. I. Pesenson, "Variational splines and Paley-Wiener spaces on combinatorial graphs," Constr. Approx., vol. 29, no. 1, pp. 1-21, Feb. 2009.
42. M. Belkin, I. Matveeva, and P. Niyogi, "Regularization and semi-supervised learning on large graphs," in Learning Theory, ser. Lecture Notes in Computer Science. New York, NY, USA: Springer-Verlag, 2004, pp. 624-638.
43. A. J. Smola and R. Kondor, "Kernels and regularization on graphs," in Proc. Annu. Conf. Comp. Learn. Theory, B. Schölkopf and M. Warmuth, Eds., 2003, pp. 144-158, ser. Lecture Notes in Computer Science, Springer.
44. D. Zhou and B. Schölkopf, "Regularization on discrete spaces," in Pattern Recognition, ser. Lecture Notes in Computer Science, W. G. Kropatsch, R. Sablatnig, and A. Hanbury, Eds. New York, NY, USA: Springer, 2005, vol. 3663, pp. 361-368.
45. X. Zhu and Z. Ghahramani, "Semi-supervised learning using Gaussian fields and harmonic functions," inProc. Int. Conf.Mach. Learn., Washington, DC, USA, Aug. 2003, pp. 912-919.
46. D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Schölkopf, "Learning with local and global consistency," in Advances in Neural Information Processing Systems, S. Thrun, L. Saul, and B. Schölkopf, Eds. Cambridge, MA, USA: MIT Press, 2004, vol. 16, pp. 321-328.
47. Semi-Supervised Learning, O. Chapelle, B. Schölkopf, and A. Zien, Eds. Cambridge, MA, USA: MIT Press, 2006.
48. L. Grady and E. L. Schwartz, Anisotropic Interpolation on Graphs: The Combinatorial Dirichlet Problem Cognitive and Neural Syst. Dept., Boston Univ., Boston, MA, USA, Tech. Rep., CAS/CNS-TR-03-014, 2003.
49. S. K. Narang, A. Gadde, and A. Ortega, "Signal processing techniques for interpolation in graph structured data," in Proc. IEEE Int. Conf. Acc., Speech, Signal Process., Vancouver, BC, Canada, May 2013, pp. 5445-5449.
50. S. K. Narang, A. Gadde, and A. Ortega, "Localized iterative methods for interpolation of graph structured data," in Proc. IEEE Glob. Conf. Signal Inform. Process., Austin, TX, USA, Dec. 2013, pp. 491-494.
51. M. N. Do and M. Vetterli, "Frame reconstruction of the Laplacian pyramid," in Proc. IEEE Int. Conf. Accoust., Speech, Signal Process., Salt Lake City, UT, USA, May 2001, vol. 6, pp. 3641-3644.
52. M. N. Do and M. Vetterli, "Framing pyramids," IEEE Trans. Signal Process., vol. 51, no. 9, pp. 2329-2342, Sep. 2003.
53. O. Christensen, Frames and Bases. Cambridge, MA, USA: Birkhaüser, 2008.
54. D. Gleich, The MatlabBGL Matlab Library, [Online]. Available: http:/ /www.cs.purdue.edu/homes/dgleich/packages/matlab-bgl/index.html
55. Stanford University Computer Graphics Laboratory, The Stanford 3D Scanning Repository [Online]. Available: http://graphics.stanford.edu/ data/3Dscanrep/
56. H. W. Engl, M. Hanke, and A. Neubauer, Regularization of Inverse Problems. Norwell, MA, USA: Kluwer Academic, 1996.
57. B. Ricaud, D. I. Shuman, and P. Vandergheynst, "On the sparsity of wavelet coefficients for signals on graphs," in SPIEWavelets and Sparsity, San Diego, CA, USA, Aug. 2013.
58. A. Sakiyama and Y. Tanaka, "Oversampled graph Laplacian matrix for graph filter banks," IEEE Trans. Signal Process., vol. 62, no. 24, pp. 6425-6437, Dec. 2014.
59. S. K. Narang and A. Ortega, "Compact support biorthogonal wavelet filterbanks for arbitrary undirected graphs," IEEE Trans. Signal Process., vol. 61, no. 19, pp. 4673-4685, Oct. 2013.
60. X. Dong, A. Ortega, P. Frossard, and P. Vandergheynst, "Inference of mobility patterns via spectral graph wavelets," in Proc. IEEE Int. Conf. Accoust., Speech, Signal Process., Vancouver, Canada, May 2013, pp. 3118-3122.
61. D. Thanou, D. I. Shuman, and P. Frossard, "Learning parametric dictionaries for signals on graphs," IEEE Trans. Signal Process., vol. 62, no. 15, pp. 3849-3862, Aug. 2014.
62. D. I Shuman, B. Ricaud, and P. Vandergheynst, "Vertex-frequency analysis on graphs," Appl. Comput. Harmon. Anal., vol. 40, no. 2, pp. 260-291, Mar. 2016.
63. M. Elad, Sparse and Redundant Representations. New York, NY, USA: Springer, 2010.
64. G. H. Golub and C. F. Van Loan, Matrix Computations. Baltimore, MD, USA: The Johns Hopkins Univ. Press, 1996.
65. D. S. Watkins, The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods. Philadelphia, PA, USA: SIAM, 2007.
66. Y. Saad, Iterative Methods for Sparse Linear Systems. Philadelphia, PA, USA: SIAM, 2003.
67. S. Balay, J. Brown, K. Buschelman, W. D. Gropp, D. Kaushik, M. G. Knepley, L. C. McInnes, B. F. Smith, and H. Zhang, PETSc web page, 2013 [Online]. Available: http://www.mcs.anl.gov/petsc
68. D. I. Shuman, P. Vandergheynst, and P. Frossard, "Chebyshev polynomial approximation for distributed signal processing," in Int. Conf. Distrib. Comput. Sensor Syst., Barcelona, Spain, Jun. 2011.
69. I. Koutis, G. L. Miller, and R. Peng, "Approaching optimality for solving SDD linear systems," in Proc. IEEE Symp. Found. Comp. Sci., Las Vegas, NV, USA, Oct. 2010, pp. 235-244.
70. D. A. Spielman, "Laplacian linear equations, graph sparsification, local clustering, low-stretch trees, etc.," [Online]. Available: http://www.cs. yale.edu/homes/spielman/precon/precon.html
71. H. Q. Nguyen and M. N. Do, "Downsampling of signals on graphs via maximum spanning trees," IEEE Trans. Signal Process., vol. 63, no. 1, pp. 182-191, Jan. 2015.
72. P. Liu, X. Wang, and Y. Gu, "Coarsening graph signal with spectral invariance," in Proc. IEEE Int. Conf. Accoust., Speech, Signal Process., Florence, Italy, May 2014, pp. 1070-1074.