Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-848d4c4894-ttngx Total loading time: 0 Render date: 2024-06-07T13:23:00.099Z Has data issue: false hasContentIssue false

References

Published online by Cambridge University Press:  09 May 2022

Antonio Ortega
Antonio Ortega
Affiliation:
University of Southern California
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Introduction to Graph Signal Processing , pp. 286 - 296
Publisher: Cambridge University Press
Print publication year: 2022

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Strang, G., “The discrete cosine transform,” SIAM Review, vol. 41, no. 1, pp. 135–147, 1999. https://doi.org/10.1137/S0036144598336745Google Scholar
[2] Pennebaker, W. B. and Mitchell, J. L., JPEG: Still Image Data Compression Standard. Springer Science & Business Media, 1992.Google Scholar
[3] Tomasi, C. and Manduchi, R., “Bilateral filtering for gray and color images.” in Proc. International Conference on Computer Vision (ICCV), vol. 98, no. 1, 1998, p. 2. https://doi.org/10.1109/ICCV.1998.710815Google Scholar
[4] Page, L., Brin, S., Motwani, R., and Winograd, T., “The pagerank citation ranking: Bringing order to the web.” Stanford InfoLab, Tech. Rep., 1999. http://ilpubs.stanford.edu:8090/422/Google Scholar
[5] Liu, L. and Mitra, U., “Policy sampling and interpolation for wireless networks: A graph signal processing approach,” in Proc. 2019 IEEE Global Communications Conference (GLOBECOM). IEEE, 2019, pp. 1–6. https://doi.org/10.1109/GLOBECOM38437.2019.9013907CrossRefGoogle Scholar
[6] Kolaczyk, E. D. and Csárdi, G., Statistical Analysis of Network Data with R. Springer, 2014. https://doi.org/10.1007/978-1-4939-0983-4Google Scholar
[7] Chung, F. R., Spectral Graph Theory. American Mathematical Society, 1997, no. 92. https://doi.org/http://dx.doi.org/10.1090/cbms/092Google Scholar
[8] Van Mieghem, P., Graph Spectra for Complex Networks. Cambridge University Press, 2010. https://doi.org/10.1017/CBO9780511921681Google Scholar
[9] Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., and Vandergheynst, P., “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE Signal Processing Magazine, vol. 30, no. 3, pp. 83–98, 2013. https://doi.org/10.1109/MSP.2012.2235192Google Scholar
[10] Sandryhaila, A. and Moura, J. M. F., “Big data analysis with signal processing on graphs: Representation and processing of massive data sets with irregular structure,” IEEE Signal Processing Magazine, vol. 31, no. 5, pp. 80–90, 2014. https://doi.org/10.1109/MSP.2014.2329213CrossRefGoogle Scholar
[11] Ortega, A., Frossard, P., Kovačević, J., Moura, J. M. F., and Vandergheynst, P., “Graph signal processing: Overview, challenges, and applications,” Proceedings of the IEEE, vol. 106, no. 5, pp. 808–828, 2018. https://doi.org/10.1109/JPROC.2018.2820126Google Scholar
[12] Stanković, L., Mandic, D., Daković, M., Brajović, M., Scalzo, B., Li, S., and Constantinides, A. G., “Data analytics on graphs Part I: Graphs and spectra on graphs,” Foundations and Trends® in Machine Learning, vol. 13, no. 1, pp. 1–157, 2020. https://doi.org/10.1561/2200000078-1CrossRefGoogle Scholar
[13] Stanković, L., Mandic, D., Daković, M., Brajović, M., Scalzo, B., Li, S., and Constantinides, A. G., “Data analytics on graphs Part II: Signals on graphs,” Foundations and Trends® in Machine Learning, vol. 13, no. 2-3, pp. 158–331, 2020. https://doi.org/10.1561/2200000078-2Google Scholar
[14] Stanković, L., Mandic, D., Daković, M., Brajović, M., Scalzo, B., Li, S., and Constantinides, A. G., “Data analytics on graphs Part III: Machine learning on graphs, from graph topology to applications,” Foundations and Trends® in Machine Learning, vol. 13, no. 4, pp. 332–530, 2020. https://doi.org/10.1561/2200000078-3Google Scholar
[15] Sandryhaila, A. and Moura, J. M. F., “Discrete signal processing on graphs,” IEEE Transactions on Signal Processing, vol. 61, no. 7, pp. 1644–1656, 2013. https://doi.org/10.1109/TSP.2013.2238935CrossRefGoogle Scholar
[16] Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C., Introduction to Algorithms. MIT Press, 2009.Google Scholar
[17] Vetterli, M., Kovačević, J., and Goyal, V. K., Foundations of Signal Processing. Cambridge University Press, 2014. https://doi.org/10.1017/CBO9781139839099Google Scholar
[18] Golub, G. H. and Van Loan, C. F., Matrix Computations. Johns Hopkins University Press, 2012, vol. 3.Google Scholar
[19] Stewart, G. W., Matrix Algorithms: Eigensystems. SIAM, 2001, vol. 2. https://doi.org/10.1137/1.9780898718058CrossRefGoogle Scholar
[20] Girault, B., “Signal processing on graphs – contributions to an emerging field,” PhD dissertation, Ecole Normale Supérieure de Lyon, 2015. https://tel.archives-ouvertes.fr/tel-01256044Google Scholar
[21] Girault, B., Narayanan, S. S., Ortega, A., Gonçalves, P., and Fleury, E., “GraSP: A Matlab toolbox for graph signal processing,” in Proc. 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2017, pp. 6574–6575. https://doi.org/10.1109/ICASSP.2017.8005300CrossRefGoogle Scholar
[22] Deri, J. A. and Moura, J. M. F., “Spectral projector-based graph Fourier transforms,” IEEE Journal of Selected Topics in Signal Processing, vol. 11, no. 6, pp. 785–795, 2017. https://doi.org/10.1109/JSTSP.2017.2731599Google Scholar
[23] Agnarsson, G. and Greenlaw, R., Graph Theory: Modeling, Applications, and Algorithms. Pearson/Prentice Hall, 2007.Google Scholar
[24] Püschel, M. and Moura, J. M., “Algebraic signal processing theory: Foundation and 1D time,” IEEE Transactions on Signal Processing, vol. 56, no. 8, pp. 3572–3585, 2008. https://doi.org/10.1109/TSP.2008.925261CrossRefGoogle Scholar
[25] Püschel, M. and Moura, J. M. F., “Algebraic signal processing theory: Cooley–Tukey type algorithms for DCTs and DSTs,” IEEE Transactions on Signal Processing, vol. 56, no. 4, pp. 1502–1521, 2008. https://doi.org/10.1109/TSP.2007.907919Google Scholar
[26] Gantmacher, F. R., The Theory of Matrices. American Mathematical Soc., 2000, vol. 131.Google Scholar
[27] Saito, N., “How can we naturally order and organize graph Laplacian eigenvectors?” in Proc. 2018 IEEE Statistical Signal Processing Workshop (SSP). IEEE, 2018, pp. 483–487. https://doi.org/10.1109/SSP.2018.8450808Google Scholar
[28] Girault, B. and Ortega, A., “What’s in a frequency: New tools for graph Fourier transform visualization,” arXiv preprint arXiv:1903.08827, 2019. https://arxiv.org/abs/1903.08827Google Scholar
[29] Isufi, E., Loukas, A., Simonetto, A., and Leus, G., “Autoregressive moving average graph filtering,” IEEE Transactions on Signal Processing, vol. 65, no. 2, pp. 274–288, 2016. https://doi.org/10.1109/TSP.2016.2614793Google Scholar
[30] Tremblay, N., Gonçalves, P., and Borgnat, P., “Design of graph filters and filterbanks,” in Cooperative and Graph Signal Processing. Elsevier, 2018, pp. 299–324. https://doi.org/10.1016/B978-0-12-813677-5.00011-0Google Scholar
[31] Cvetković, D., Rowlinson, P., and Simić, S., An Introduction to the Theory of Graph Spectra. Cambridge University Press, 2001. https://doi.org/10.1017/CBO9780511801518Google Scholar
[32] Sandryhaila, A. and Moura, J. M. F., “Discrete signal processing on graphs: Frequency analysis,” IEEE Transactions on Signal Processing, vol. 62, no. 12, pp. 3042–3054, 2014. https://doi.org/10.1109/TSP.2014.2321121Google Scholar
[33] Milanfar, P., “A tour of modern image filtering: New insights and methods, both practical and theoretical,” IEEE Signal Processing Magazine, vol. 30, no. 1, pp. 106–128, 2013. https://doi.org/10.1109/MSP.2011.2179329Google Scholar
[34] Milanfar, P., “Symmetrizing smoothing filters,” SIAM Journal on Imaging Sciences, vol. 6, no. 1, pp. 263–284, 2013. https://doi.org/10.1137/120875843Google Scholar
[35] Sinkhorn, R., “A relationship between arbitrary positive matrices and doubly stochastic matrices,” Annals of Mathematical Statistics, vol. 35, no. 2, pp. 876–879, 1964. https://www.jstor.org/stable/2238545Google Scholar
[36] Girault, B., Ortega, A., and Narayanan, S. S., “Irregularity-aware graph Fourier transforms,” IEEE Transactions on Signal Processing, vol. 66, no. 21, pp. 5746–5761, 2018. https://doi.org/10.1109/TSP.2018.2870386Google Scholar
[37] Lu, K.-S., Ortega, A., Mukherjee, D., and Chen, Y., “Perceptually inspired weighted MSE optimization using irregularity-aware graph fourier transform,” in Proc. 2020 IEEE International Conference on Image Processing, 2020. https://doi.org/10.1109/ICIP40778. 2020.9190876Google Scholar
[38] Beineke, L. W., Wilson, R. J., Cameron, P. J. et al., Topics in Algebraic Graph Theory. Cambridge University Press, 2004.Google Scholar
[39] Eldar, Y. C., Sampling Theory: Beyond Bandlimited Systems. Cambridge University Press, 2015. https://doi.org/10.1017/CBO9780511762321Google Scholar
[40] Chen, S., Varma, R., Sandryhaila, A., and Kovacevic, J., “Discrete signal processing on graphs: Sampling theory,” IEEE Transactions on Signal Processing, vol. 63, pp. 6510–6523, 2015. https://doi.org/10.1109/TSP.2015.2469645Google Scholar
[41] Chen, S., Varma, R., Singh, A., and Kovačević, J., “Signal representations on graphs: Tools and applications,” arXiv preprint arXiv:1512.05406, 2015. https://arxiv.org/abs/1512.05406Google Scholar
[42] Girault, B., “Stationary graph signals using an isometric graph translation,” in Proc. 2015 23rd European Signal Processing Conference (EUSIPCO). IEEE, 2015, pp. 1516–1520. https://doi.org/10.1109/EUSIPCO.2015.7362637CrossRefGoogle Scholar
[43] Perraudin, N. and Vandergheynst, P., “Stationary signal processing on graphs,” IEEE Transactions on Signal Processing, vol. 65, no. 13, pp. 3462–3477, 2017. https://doi.org/10.1109/TSP.2017.2690388Google Scholar
[44] Girault, B., Narayanan, S. S., and Ortega, A., “Towards a definition of local stationarity for graph signals,” in Proc. 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2017, pp. 4139–4143. https://doi.org/10.1109/ICASSP.2017.7952935CrossRefGoogle Scholar
[45] Cressie, N., Statistics for Spatial Data. John Wiley & Sons, 2015.Google Scholar
[46] Serrano, A., Girault, B., and Ortega, A., “Graph variogram: A novel tool to measure spatial stationarity,” in Proc. 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2018, pp. 753–757. https://doi.org/10.1109/GlobalSIP.2018.8646692Google Scholar
[47] Marques, A. G., Segarra, S., Leus, G., and Ribeiro, A., “Stationary graph processes and spectral estimation,” IEEE Transactions on Signal Processing, vol. 65, no. 22, pp. 5911–5926, 2017. https://doi.org/10.1109/TSP.2017.2739099Google Scholar
[48] Marques, A. G., Segarra, S., Leus, G., and Ribeiro, A., “Sampling of graph signals with successive local aggregations,” IEEE Transactions on Signal Processing, vol. 64, no. 7, pp. 1832–1843, 2016. https://doi.org/10.1109/TSP.2015.2507546Google Scholar
[49] Tanaka, Y., “Spectral domain sampling of graph signals,” IEEE Transactions on Signal Processing, vol. 66, no. 14, pp. 3752–3767, 2018. https://doi.org/10.1109/TSP.2018.2839620CrossRefGoogle Scholar
[50] Pesenson, I., “Sampling in Paley–Wiener spaces on combinatorial graphs,” Transactions of the American Mathematical Society, vol. 360, no. 10, pp. 5603–5627, 2008. https://doi.org/10.1090/S0002-9947-08-04511-XGoogle Scholar
[51] Narang, S. K., Gadde, A., Sanou, E., and Ortega, A., “Localized iterative methods for interpolation in graph structured data,” in Proc. 2013 IEEE Global Conference on Signal and Information Processing. IEEE, 2013, pp. 491–494. https://doi.org/10.1109/GlobalSIP.2013.6736922Google Scholar
[52] Wang, X., Liu, P., and Gu, Y., “Local-set-based graph signal reconstruction,” IEEE Transactions on Signal Processing, vol. 63, no. 9, pp. 2432–2444, 2015. https://doi.org/10.1109/TSP.2015.2411217Google Scholar
[53] Tanaka, Y., Eldar, Y. C., Ortega, A., and Cheung, G., “Sampling signals on graphs: From theory to applications,” IEEE Signal Processing Magazine, vol. 37, no. 6, pp. 14–30, 2020. https://doi.org/10.1109/MSP.2020.3016908Google Scholar
[54] Bai, Y., Wang, F., Cheung, G., Nakatsukasa, Y., and Gao, W., “Fast graph sampling set selection using Gershgorin disc alignment,” IEEE Transactions on Signal Processing, vol. 68, pp. 2419–2434, 2020. https://doi.org/10.1109/TSP.2020.2981202Google Scholar
[55] Shomorony, H. and Avestimehr, A. S., “Sampling large data on graphs,” in Proc. 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2014, pp. 933–936. https://doi.org/10.1109/GlobalSIP.2014.7032257Google Scholar
[56] Sakiyama, A., Tanaka, Y., Tanaka, T., and Ortega, A., “Eigendecomposition-free sampling set selection for graph signals,” IEEE Transactions on Signal Processing, vol. 67, no. 10, pp. 2679–2692, 2019. https://doi.org/10.1109/TSP.2019.2908129Google Scholar
[57] Anis, A., Gadde, A., and Ortega, A., “Efficient sampling set selection for bandlimited graph signals using graph spectral proxies,” IEEE Transactions on Signal Processing, vol. 64, no. 14, pp. 3775–3789, 2016. https://doi.org/10.1109/TSP.2016.2546233CrossRefGoogle Scholar
[58] Tsitsvero, M., Barbarossa, S., and Di Lorenzo, P., “Signals on graphs: Uncertainty principle and sampling,” IEEE Transactions on Signal Processing, vol. 64, no. 18, pp. 4845–4860, 2016. https://doi.org/10.1109/TSP.2016.2573748Google Scholar
[59] Puy, G., Tremblay, N., Gribonval, R., and Vandergheynst, P., “Random sampling of bandlimited signals on graphs,” Applied and Computational Harmonic Analysis, vol. 44, no. 2, pp. 446–475, 2018. https://doi.org/10.1016/j.acha.2016.05.005Google Scholar
[60] Chen, S., Varma, R., Singh, A., and Kovačević, J., “Signal recovery on graphs: Fundamental limits of sampling strategies,” IEEE Transactions on Signal and Information Processing over Networks, vol. 2, no. 4, pp. 539–554, 2016. https://doi.org/10.1109/TSIPN.2016.2614903Google Scholar
[61] Eldar, Y. C., “Sampling with arbitrary sampling and reconstruction spaces and oblique dual frame vectors,” Journal of Fourier Analysis and Applications, vol. 9, no. 1, pp. 77–96, 2003. https://doi.org/10.1007/s00041-003-0004-2Google Scholar
[62] Agaskar, A. and Lu, Y. M., “A spectral graph uncertainty principle,” IEEE Transactions on Information Theory, vol. 59, no. 7, pp. 4338–4356, 2013. https://doi.org/10.1109/TIT.2013.2252233Google Scholar
[63] Pasdeloup, B., Gripon, V., Alami, R., and Rabbat, M. G., “Uncertainty principle on graphs,” in Vertex–Frequency Analysis of Graph Signals. Springer, 2019, pp. 317–340. https://doi.org/10.1007/978-3-030-03574-7_9Google Scholar
[64] Pasdeloup, B., Alami, R., Gripon, V., and Rabbat, M., “Toward an uncertainty principle for weighted graphs,” in Proc. 2015 23rd European Signal Processing Conference (EUSIPCO). IEEE, 2015, pp. 1496–1500. https://doi.org/10.1109/EUSIPCO.2015.7362633Google Scholar
[65] Van De Ville, D., Demesmaeker, R., and Preti, M. G., “When Slepian meets Fiedler: Putting a focus on the graph spectrum,” IEEE Signal Processing Letters, vol. 24, no. 7, pp. 1001–1004, 2017. https://doi.org/10.1109/LSP.2017.2704359Google Scholar
[66] Crovella, M. and Kolaczyk, E., “Graph wavelets for spatial traffic analysis,” in Proc. INFO-COM 2003, 22nd Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, 2003, pp. 1848–1857. https://doi.org/10.1109/INFCOM.2003.1209207Google Scholar
[67] Vetterli, M. and Kovačević, J., Wavelets and Subband Coding. Prentice Hall, 1995. https://waveletsandsubbandcoding.org/Google Scholar
[68] Narang, S. K. and Ortega, A., “Lifting based wavelet transforms on graphs,” in Proc. 2009 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2009, pp. 441–444. http://hdl.handle.net/2115/39737Google Scholar
[69] Daubechies, I. and Sweldens, W., “Factoring wavelet transforms into lifting steps,” Journal of Fourier Analysis and Applications, vol. 4, no. 3, pp. 247–269, 1998. https://doi.org/10.1007/BF02476026Google Scholar
[70] Tay, D. B. and Ortega, A., “Bipartite graph filter banks: Polyphase analysis and generalization,” IEEE Transactions on Signal Processing, vol. 65, no. 18, pp. 4833–4846, 2017. https://doi.org/10.1109/TSP.2017.2718969Google Scholar
[71] Stollnitz, E. J., DeRose, T. D., DeRose, A. D., and Salesin, D. H., Wavelets for Computer Graphics: Theory and Applications. Morgan Kaufmann, 1996.Google Scholar
[72] Schröder, P. and Sweldens, W., “Spherical wavelets: Efficiently representing functions on the sphere,” in Proc. 22nd Annual Conference on Computer Graphics and Interactive Techniques, 1995, pp. 161–172. https://doi.org/10.1145/218380.218439Google Scholar
[73] Tremblay, N. and Borgnat, P., “Subgraph-based filterbanks for graph signals,” IEEE Transactions on Signal Processing, vol. 64, no. 15, pp. 3827–3840, 2016. https://doi.org/10.1109/TSP.2016.2544747Google Scholar
[74] Hammond, D. K., Vandergheynst, P., and Gribonval, R., “Wavelets on graphs via spectral graph theory,” Applied and Computational Harmonic Analysis, vol. 30, no. 2, pp. 129–150, 2011. https://doi.org/10.1016/j.acha.2010.04.005Google Scholar
[75] Pesenson, I., “Variational splines and paley–wiener spaces on combinatorial graphs,” Constructive Approximation, vol. 29, no. 1, pp. 1–21, 2009. https://doi.org/10.1007/s00365-007-9004-9Google Scholar
[76] Leonardi, N. and Van De Ville, D., “Tight wavelet frames on multislice graphs,” IEEE Transactions on Signal Processing, vol. 61, no. 13, pp. 3357–3367, 2013. https://doi.org/10.1109/TSP.2013.2259825CrossRefGoogle Scholar
[77] Shuman, D. I., Wiesmeyr, C., Holighaus, N., and Vandergheynst, P., “Spectrum-adapted tight graph wavelet and vertex-frequency frames,” IEEE Transactions on Signal Processing, vol. 63, no. 16, pp. 4223–4235, 2015. https://doi.org/10.1109/TSP.2015.2424203Google Scholar
[78] Teke, O. and Vaidyanathan, P. P., “Extending classical multirate signal processing theory to graphs – Part I: Fundamentals,” IEEE Transactions on Signal Processing, vol. 65, no. 2, pp. 409–422, 2016. https://doi.org/10.1109/TSP.2016.2617833CrossRefGoogle Scholar
[79] Teke, O. and Vaidyanathan, P. P., “Extending classical multirate signal processing theory to graphs – Part II: M-channel filter banks,” IEEE Transactions on Signal Processing, vol. 65, no. 2, pp. 423–437, 2016. https://doi.org/10.1109/TSP.2016.2620111Google Scholar
[80] Anis, A. and Ortega, A., “Critical sampling for wavelet filterbanks on arbitrary graphs,” in Proc. 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2017, pp. 3889–3893. https://doi.org/10.1109/ICASSP.2017.7952885Google Scholar
[81] Narang, S. K. and Ortega, A., “Perfect reconstruction two-channel wavelet filter banks for graph structured data,” IEEE Transactions on Signal Processing, vol. 60, no. 6, pp. 2786–2799, 2012. https://doi.org/10.1109/TSP.2012.2188718Google Scholar
[82] Narang, S. K. and Ortega, A., “Compact support biorthogonal wavelet filterbanks for arbitrary undirected graphs,” IEEE Transactions on Signal Processing, vol. 61, no. 19, pp. 4673–4685, 2013. https://doi.org/10.1109/TSP.2013.2273197Google Scholar
[83] Tay, D. B., Tanaka, Y., and Sakiyama, A., “Critically sampled graph filter banks with polynomial filters from regular domain filter banks,” Signal Processing, vol. 131, pp. 66–72, 2017. https://doi.org/10.1016/j.sigpro.2016.07.003Google Scholar
[84] Tanaka, Y. and Sakiyama, A., “M-channel oversampled graph filter banks,” IEEE Transactions on Signal Processing, vol. 62, no. 14, pp. 3578–3590, 2014. https://doi.org/10.1109/TSP.2014.2328983Google Scholar
[85] Shuman, D. I., Faraji, M. J., and Vandergheynst, P., “A multiscale pyramid transform for graph signals,” IEEE Transactions on Signal Processing, vol. 64, no. 8, pp. 2119–2134, 2015. https://doi.org/10.1109/TSP.2015.2512529Google Scholar
[86] Burt, P. and Adelson, E., “The laplacian pyramid as a compact image code,” IEEE Transactions on Communications, vol. 31, no. 4, pp. 532–540, 1983. https://doi.org/10.1109/TCOM.1983.1095851CrossRefGoogle Scholar
[87] Coifman, R. R. and Maggioni, M., “Diffusion wavelets,” Applied and Computational Harmonic Analysis, vol. 21, no. 1, pp. 53–94, 2006. https://doi.org/10.1016/j.acha.2006.04.004Google Scholar
[88] Shuman, D. I., “Localized spectral graph filter frames: A unifying framework, survey of design considerations, and numerical comparison,” IEEE Signal Processing Magazine, vol. 37, no. 6, pp. 43–63, 2020. https://doi.org/10.1109/MSP.2020.3015024Google Scholar
[89] Spielman, D. A. and Teng, S.-H., “Spectral sparsification of graphs,” SIAM Journal on Computing, vol. 40, no. 4, pp. 981–1025, 2011. https://doi.org/10.1137/08074489XGoogle Scholar
[90] Spielman, D. A. and Srivastava, N., “Graph sparsification by effective resistances,” SIAM Journal on Computing, vol. 40, no. 6, pp. 1913–1926, 2011. https://doi.org/10.1137/080734029Google Scholar
[91] Lu, K.-S. and Ortega, A., “Fast graph Fourier transforms based on graph symmetry and bipartition,” IEEE Transactions on Signal Processing, vol. 67, no. 18, pp. 4855–4869, 2019. https://doi.org/10.1109/TSP.2019.2932882CrossRefGoogle Scholar
[92] Le Magoarou, L., Gribonval, R., and Tremblay, N., “Approximate fast graph Fourier transforms via multilayer sparse approximations,” IEEE Transactions on Signal and Information Processing over Networks, vol. 4, no. 2, pp. 407–420, 2017. https://doi.org/10.1109/TSIPN.2017.2710619Google Scholar
[93] Zeng, J., Cheung, G., and Ortega, A., “Bipartite approximation for graph wavelet signal decomposition,” IEEE Transactions on Signal Processing, vol. 65, pp. 5466–5480, 2017. https://doi.org/10.1109/TSP.2017.2733489Google Scholar
[94] Pavez, E., Egilmez, H. E., and Ortega, A., “Learning graphs with monotone topology properties and multiple connected components,” IEEE Transactions on Signal Processing, vol. 66, no. 9, pp. 2399–2413, 2018. https://doi.org/10.1109/TSP.2018.2813337Google Scholar
[95] Dörfler, F. and Bullo, F., “Kron reduction of graphs with applications to electrical networks,” IEEE Transactions on Circuits and Systems, vol. 60, no. 1, pp. 150–163, 2013. https://doi.org/10.1109/TCSI.2012.2215780Google Scholar
[96] Chen, G. H. and Shah, D., “Explaining the success of nearest neighbor methods in prediction,” Foundations and Trends in Machine Learning, vol. 10, no. 5-6, pp. 337–588, 2018. https://doi.org/10.1561/2200000064Google Scholar
[97] Roweis, S. T. and Saul, L. K., “Nonlinear dimensionality reduction by locally linear embedding,” Science, vol. 290, no. 5500, pp. 2323–2326, 2000. https://doi.org/10.1126/science.290.5500.2323Google Scholar
[98] Shekkizhar, S. and Ortega, A., “Graph construction from data by non-negative kernel regression,” in Proc. 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2020, pp. 3892–3896. https://doi.org/10.1109/ICASSP40776.2020.9054425Google Scholar
[99] Dempster, A. P., “Covariance selection,” Biometrics, pp. 157–175, 1972. https://doi.org/10.2307/2528966Google Scholar
[100] Uhler, C., “Geometry of maximum likelihood estimation in gaussian graphical models,” Annals of Statistics, vol. 40, no. 1, pp. 238–261, 2012. https://www.jstor.org/stable/41713634Google Scholar
[101] Friedman, J., Hastie, T., and Tibshirani, R., “Sparse inverse covariance estimation with the graphical lasso,” Biostatistics, vol. 9, no. 3, pp. 432–441, 2008. https://doi.org/10.1093/biostatistics/kxm045Google Scholar
[102] Meinshausen, N. and Bühlmann, P., “High-dimensional graphs and variable selection with the Lasso,” Annals of Statistics, vol. 34, no. 3, pp. 1436 – 1462, 2006. https://doi.org/10.1214/009053606000000281Google Scholar
[103] Dong, X., Thanou, D., Frossard, P., and Vandergheynst, P., “Learning laplacian matrix in smooth graph signal representations,” IEEE Transactions on Signal Processing, vol. 64, no. 23, pp. 6160–6173, 2016. https://doi.org/10.1109/TSP.2016.2602809Google Scholar
[104] Kalofolias, V., “How to learn a graph from smooth signals,” in Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, ser. Proc. of Machine Learning Research, vol. 51. PMLR, 09–11 May 2016, pp. 920–929.http://proceedings.mlr.press/v51/kalofolias16.htmlGoogle Scholar
[105] Slawski, M. and Hein, M., “Estimation of positive definite M-matrices and structure learning for attractive Gaussian–Markov random fields,” Linear Algebra and its Applications, vol. 473, pp. 145–179, 2015. https://doi.org/10.1016/j.laa.2014.04.020Google Scholar
[106] Lake, B. and Tenenbaum, J., “Discovering structure by learning sparse graphs,” in Proceedings of the Annual Meeting of the Cognitive Science Society, 2010, pp. 778–784. http://hdl.handle.net/1721.1/112759Google Scholar
[107] Egilmez, H. E., Pavez, E., and Ortega, A., “Graph learning from data under laplacian and structural constraints,” IEEE Journal of Selected Topics in Signal Processing, vol. 11, no. 6, pp. 825–841, 2017. https://doi.org/10.1109/JSTSP.2017.2726975Google Scholar
[108] Segarra, S., Marques, A. G., Mateos, G., and Ribeiro, A., “Network topology inference from spectral templates,” IEEE Transactions on Signal and Information Processing over Networks, vol. 3, no. 3, pp. 467–483, 2017. https://doi.org/10.1109/TSIPN.2017.2731051Google Scholar
[109] Dong, X., Thanou, D., Rabbat, M., and Frossard, P., “Learning graphs from data: A signal representation perspective,” IEEE Signal Processing Magazine, vol. 36, no. 3, pp. 44–63, 2019. https://doi.org/10.1109/MSP.2018.2887284Google Scholar
[110] Mateos, G., Segarra, S., Marques, A. G., and Ribeiro, A., “Connecting the dots: Identifying network structure via graph signal processing,” IEEE Signal Processing Magazine, vol. 36, no. 3, pp. 16–43, 2019. https://doi.org/10.1109/MSP.2018.2890143Google Scholar
[111] Li, Y., Yu, R., Shahabi, C., and Liu, Y., “Diffusion convolutional recurrent neural network: Data-driven traffic forecasting,” in International Conference on Learning Representations, 2018. https://openreview.net/forum?id=SJiHXGWAZGoogle Scholar
[112] Hasanzadeh, A., Liu, X., Duffield, N., Narayanan, K. R., and Chigoy, B., “A graph signal processing approach for real-time traffic prediction in transportation networks,” arXiv preprint arXiv:1711.06954, 2017. https://arxiv.org/abs/1711.06954v1Google Scholar
[113] Drayer, E. and Routtenberg, T., “Detection of false data injection attacks in smart grids based on graph signal processing,” IEEE Systems Journal, 2019. https://doi.org/10.1109/JSYST.2019.2927469Google Scholar
[114] He, K., Stankovic, L., Liao, J., and Stankovic, V., “Non-intrusive load disaggregation using graph signal processing,” IEEE Transactions on Smart Grid, vol. 9, no. 3, pp. 1739–1747, 2016. https://doi.org/10.1109/TSG.2016.2598872Google Scholar
[115] Huang, W., Bolton, T. A., Medaglia, J. D., Bassett, D. S., Ribeiro, A., and Van De Ville, D., “A graph signal processing perspective on functional brain imaging,” Proceedings of the IEEE, vol. 106, no. 5, pp. 868–885, 2018. https://doi.org/10.1109/JPROC.2018.2798928Google Scholar
[116] Medaglia, J. D., Huang, W., Karuza, E. A., Kelkar, A., Thompson-Schill, S. L., Ribeiro, A., and Bassett, D. S., “Functional alignment with anatomical networks is associated with cognitive flexibility,” Nature Human Behaviour, vol. 2, no. 2, p. 156, 2018. https://doi.org/10.1038/s41562-017-0260-9Google Scholar
[117] Rui, L., Nejati, H., Safavi, S. H., and Cheung, N.-M., “Simultaneous low-rank component and graph estimation for high-dimensional graph signals: Application to brain imaging,” in Proc. 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2017, pp. 4134–4138. https://doi.org/10.1109/ICASSP.2017.7952934Google Scholar
[118] Ménoret, M., Farrugia, N., Pasdeloup, B., and Gripon, V., “Evaluating graph signal processing for neuroimaging through classification and dimensionality reduction,” in Proc. 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2017, pp. 618–622. https://doi.org/10.1109/GlobalSIP.2017.8309033Google Scholar
[119] Monti, F., Bronstein, M., and Bresson, X., “Geometric matrix completion with recurrent multi-graph neural networks,” in Advances in Neural Information Processing Systems, 2017, pp. 3697–3707. https://arxiv.org/abs/1704.06803Google Scholar
[120] Lee, S. and Ortega, A., “Efficient data-gathering using graph-based transform and compressed sensing for irregularly positioned sensors,” in Proc. 2013 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference. IEEE, 2013, pp. 1–4. https://doi.org/10.1109/APSIPA.2013.6694166Google Scholar
[121] Shen, G. and Ortega, A., “Transform-based distributed data gathering,” IEEE Transactions on Signal Processing, vol. 58, no. 7, pp. 3802–3815, 2010. https://doi.org/10.1109/TSP.2010.2047640Google Scholar
[122] Wagner, R., Choi, H., Baraniuk, R., and Delouille, V., “Distributed wavelet transform for irregular sensor network grids,” in Proc. IEEE/SP 13th Workshop on Statistical Signal Processing, 2005. IEEE, 2005, pp. 1196–1201. https://doi.org/10.1109/SSP.2005.1628777Google Scholar
[123] Duarte, M. F., Shen, G., Ortega, A., and Baraniuk, R. G., “Signal compression in wireless sensor networks,” Philosophical Transactions of the Royal Society A, vol. 370, no. 1958, pp. 118–135, 2012. https://doi.org/10.1098/rsta.2011.0247Google Scholar
[124] Egilmez, H. E. and Ortega, A., “Spectral anomaly detection using graph-based filtering for wireless sensor networks,” in Proc. 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2014, pp. 1085–1089. https://doi.org/10.1109/ICASSP.2014.6853764Google Scholar
[125] Cheung, G., Magli, E., Tanaka, Y., and Ng, M. K., “Graph spectral image processing,” Proceedings of the IEEE, vol. 106, no. 5, pp. 907–930, 2018. https://doi.org/10.1109/JPROC.2018.2799702Google Scholar
[126] Kao, J.-Y., Ortega, A., Tian, D., Mansour, H., and Vetro, A., “Graph based skeleton modeling for human activity analysis,” in Proc. 2019 IEEE International Conference on Image Processing (ICIP). IEEE, 2019, pp. 2025–2029. https://doi.org/10.1109/ICIP. 2019.8803186Google Scholar
[127] Püschel, M. and Moura, J. M. F., “The algebraic approach to the discrete cosine and sine transforms and their fast algorithms,” SIAM Journal on Computing, vol. 32, no. 5, pp. 1280–1316, 2003. https://doi.org/10.1137/S009753970139272XGoogle Scholar
[128] Egilmez, H. E., Chao, Y.-H., and Ortega, A., “Graph-based transforms for video coding,” IEEE Transactions on Image Processing, vol. 29, pp. 9330–9344, 2020. https://doi.org/10.1109/TIP.2020.3026627Google Scholar
[129] Buades, A., Coll, B., and Morel, J.-M., “A non-local algorithm for image denoising,” in Proc. 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), vol. 2. IEEE, 2005, pp. 60–65. https://doi.org/10.1109/CVPR.2005.38CrossRefGoogle Scholar
[130] Takeda, H., Farsiu, S., and Milanfar, P., “Kernel regression for image processing and reconstruction,” IEEE Transactions on Image Processing, vol. 16, pp. 349–366, 2007. https://doi.org/10.1109/TIP.2006.888330Google Scholar
[131] Gadde, A., Narang, S. K., and Ortega, A., “Bilateral filter: Graph spectral interpretation and extensions,” in Proc. 2013 IEEE International Conference on Image Processing. IEEE, 2013, pp. 1222–1226. https://doi.org/10.1109/ICIP.2013.6738252Google Scholar
[132] Fracastoro, G., Fosson, S. M., and Magli, E., “Steerable discrete cosine transform,” IEEE Transactions on Image Processing, vol. 26, no. 1, pp. 303–314, 2017. https://doi.org/10.1109/TIP.2016.2623489Google Scholar
[133] Daribo, I., Florencio, D., and Cheung, G., “Arbitrarily shaped motion prediction for depth video compression using arithmetic edge coding,” IEEE Transactions on Image Processing, vol. 23, no. 11, pp. 4696–4708, 2014. https://doi.org/10.1109/TIP.2014.2353817Google Scholar
[134] Ortega, A. and Ramchandran, K., “Rate-distortion methods for image and video compression,” IEEE Signal Processing Magazine, vol. 15, no. 6, pp. 23–50, 1998. https://doi.org/10.1109/79.733495Google Scholar
[135] Shen, G., Kim, W.-S., Ortega, A., Lee, J., and Wey, H., “Edge-aware intra prediction for depth-map coding,” in Proc. 2010 IEEE International Conference on Image Processing (ICIP), 2010, pp. 3393–3396. https://doi.org/10.1109/ICIP.2010.5652792Google Scholar
[136] Hu, W., Cheung, G., and Ortega, A., “Intra-prediction and generalized graph Fourier transform for image coding,” IEEE Signal Processing Letters, vol. 22, no. 11, pp. 1913–1917, 2015. https://doi.org/10.1109/LSP.2015.2446683CrossRefGoogle Scholar
[137] Hu, W., Cheung, G., Ortega, A., and Au, O. C., “Multiresolution graph Fourier transform for compression of piecewise smooth images,” IEEE Transactions on Image Processing, vol. 24, no. 1, pp. 419–433, 2015. https://doi.org/10.1109/TIP.2014.2378055Google Scholar
[138] Chao, Y.-H., Ortega, A., Hu, W., and Cheung, G., “Edge-adaptive depth map coding with lifting transform on graphs,” in Proc. 2015 Picture Coding Symposium (PCS). IEEE, 2015, pp. 60–64. https://doi.org/10.1109/PCS.2015.7170047Google Scholar
[139] Martínez-Enríquez, E., Cid-Sueiro, J., Diaz-De-Maria, F., and Ortega, A., “Directional transforms for video coding based on lifting on graphs,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 28, no. 4, pp. 933–946, 2018. https://doi.org/10.1109/TCSVT.2016.2633418Google Scholar
[140] Pavez, E., Ortega, A., and Mukherjee, D., “Learning separable transforms by inverse covariance estimation,” in Proc. 2017 IEEE International Conference on Image Processing (ICIP). IEEE, 2017, pp. 285–289. https://doi.org/10.1109/ICIP.2017.8296288Google Scholar
[141] Egilmez, H. E., Chao, Y.-H., Ortega, A., Lee, B., and Yea, S., “GBST: Separable transforms based on line graphs for predictive video coding,” in Proc. 2016 IEEE International Conference on Image Processing (ICIP). IEEE, 2016, pp. 2375–2379. https://doi.org/10.1109/ICIP.2016.7532784Google Scholar
[142] Lu, K.-S. and Ortega, A., “A graph laplacian matrix learning method for fast implementation of graph Fourier transform,” in Proc. 2017 IEEE International Conference on Image Processing (ICIP). IEEE, 2017, pp. 1677–1681. https://doi.org/10.1109/ICIP. 2017.8296567Google Scholar
[143] Egilmez, H. E., Teke, O., Said, A., Seregin, V., and Karczewicz, M., “Parametric graph-based separable transforms for video coding,” in Proc. 2020 IEEE International Conference on Image Processing (ICIP). IEEE, 2020, pp. 1306–1310. https://doi.org/10.1109/ICIP40778.2020.9191299Google Scholar
[144] Pang, J. and Cheung, G., “Graph laplacian regularization for image denoising: Analysis in the continuous domain,” IEEE Transactions on Image Processing, vol. 26, no. 4, pp. 1770–1785, 2017. https://doi.org/10.1109/TIP.2017.2651400Google Scholar
[145] Wu, Z. and Leahy, R., “An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation,” IEEE Transactions on Pattern Analysis & Machine Intelligence, no. 11, pp. 1101–1113, 1993. https://doi.org/10.1109/34.244673Google Scholar
[146] Shi, J. and Malik, J., “Normalized cuts and image segmentation,” IEEE Transactions on pattern analysis and machine intelligence, vol. 22, no. 8, pp. 888–905, 2000. https://ieeexplore.ieee.org/document/868688Google Scholar
[147] Lowe, D. G., “Distinctive image features from scale-invariant keypoints,” International Journal of Computer Vision, vol. 60, no. 2, pp. 91–110, 2004. https://doi.org/10.1023/B:VISI.0000029664.99615.94Google Scholar
[148] Gadde, A., Anis, A., and Ortega, A., “Active semi-supervised learning using sampling theory for graph signals,” in Proc. 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2014, pp. 492–501. https://doi.org/10. 1145/2623330.2623760Google Scholar
[149] Gripon, V., Ortega, A., and Girault, B., “An inside look at deep neural networks using graph signal processing,” in Proc. 2018 Information Theory and Applications Workshop (ITA). IEEE, 2018, pp. 1–9. https://hal.inria.fr/hal-01959770/Google Scholar
[150] Zhu, X., Ghahramani, Z., and Lafferty, J. D., “Semi-supervised learning using gaussian fields and harmonic functions,” in Proc. 20th International Conference on Machine Learning (ICML03), 2003, pp. 912–919. https://www.aaai.org/Papers/ICML/2003/ICML03-118.pdfGoogle Scholar
[151] Bruna, J., Zaremba, W., Szlam, A., and LeCun, Y., “Spectral networks and locally connected networks on graphs,” arXiv preprint arXiv:1312.6203, 2013. https://arxiv.org/abs/1312. 6203Google Scholar
[152] Defferrard, M., Bresson, X., and Vandergheynst, P., “Convolutional neural networks on graphs with fast localized spectral filtering,” in Advances in Neural Information Processing Systems, 2016, pp. 3844–3852. https://arxiv.org/abs/1606.09375Google Scholar
[153] Kipf, T. N. and Welling, M., “Semi-supervised classification with graph convolutional networks,” arXiv preprint arXiv:1609.02907, 2016. https://arxiv.org/abs/1609.02907Google Scholar
[154] Gama, F., Bruna, J., and Ribeiro, A., “Stability properties of graph neural networks,” IEEE Transactions on Signal Processing, vol. 68, pp. 5680–5695, 2020. https://doi.org/10.1109/TSP.2020.3026980Google Scholar
[155] Bronstein, M. M., Bruna, J., LeCun, Y., Szlam, A., and Vandergheynst, P., “Geometric deep learning: Going beyond Euclidean data,” IEEE Signal Processing Magazine, vol. 34, no. 4, pp. 18–42, 2017. https://doi.org/10.1109/MSP.2017.2693418Google Scholar
[156] Gama, F., Isufi, E., Leus, G., and Ribeiro, A., “Graphs, convolutions, and neural networks: From graph filters to graph neural networks,” IEEE Signal Processing Magazine, vol. 37, no. 6, pp. 128–138, 2020. https://doi.org/10.1109/MSP.2020.3016143Google Scholar
[157] Perraudin, N., Paratte, J., Shuman, D., Martin, L., Kalofolias, V., Vandergheynst, P., and Hammond, D. K., “GSPBOX: A toolbox for signal processing on graphs,” arXiv preprint arXiv:1408.5781, 2014. http://arxiv.org/abs/1408.5781Google Scholar
[158] Defferrard, M., Martin, L., Pena, R., and Perraudin, N., “PyGSP: Graph signal processing in python.” https://doi.org/10.5281/zenodo.1003157Google Scholar
[159] Chapelle, O., Schölkopf, B., and Zien, A., Semi-Supervised Learning. MIT Press, 2006. https://doi.org/10.7551/mitpress/9780262033589.001.0001Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • References
  • Antonio Ortega, University of Southern California
  • Book: Introduction to Graph Signal Processing
  • Online publication: 09 May 2022
  • Chapter DOI: https://doi.org/10.1017/9781108552349.013
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • References
  • Antonio Ortega, University of Southern California
  • Book: Introduction to Graph Signal Processing
  • Online publication: 09 May 2022
  • Chapter DOI: https://doi.org/10.1017/9781108552349.013
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • References
  • Antonio Ortega, University of Southern California
  • Book: Introduction to Graph Signal Processing
  • Online publication: 09 May 2022
  • Chapter DOI: https://doi.org/10.1017/9781108552349.013
Available formats
×