Graph Spectral Image Processing. Gene Cheung

P.P. (1993). Multirate Systems and Filter Banks. Prentice Hall, New Jersey.

      Vallet, B. and Lévy, B. (2008). Spectral geometry processing with manifold harmonics. Computer Graphics Forum, 27, 251–260.

      Vetterli, M. and Kovacevic, J. (1995). Wavelets and Subband Coding. Prentice Hall, New Jersey.

      Vetterli, M., Kovacevi, J., Goyal, V.K. (2014). Foundations of Signal Processing. Cambridge University Press, Cambridge.

      Weickert, J. (1998). Anisotropic Diffusion in Image Processing 1, Teubner, Stuttgart.

      Xu, L., Lu, C., Xu, Y., Jia, J. (2011). Image smoothing via l0 gradient minimization. ACM Transactions on Graphics (TOG), 30, 174.

      Zhang, F. and Hancock, E.R. (2008). Graph spectral image smoothing using the heat kernel. Pattern Recognition, 41(11), 3328–3342.

      Zhang, D. and Liang, J. (2017). Graph-based transform for 2D piecewise smooth signals with random discontinuity locations. IEEE Transactions on Image Processing, 26(4), 1679–1693.

      Zhang, H., Van Kaick, O., Dyer, R. (2010). Spectral mesh processing. Computer Graphics Forum, 29, 1865–1894.

1 Here, we assume both x and y are finite length signals and their boundaries are extended or filtered by a boundary filter to ensure that the equation is valid.

2 While the computation cost for eigendecomposition of a sparse matrix is generally lower than , it still requires a high computational complexity, especially for large graphs.

3 The term “graph signal” was first introduced in Taubin et al. (1996), to the best of our knowledge.

4 In fact, this R can also be used for the reconstruction of the undersampled systems.