Graph signal processing: Overview, challenges, and applications

A Ortega, P Frossard, J Kovačević… - Proceedings of the …, 2018 - ieeexplore.ieee.org
Research in graph signal processing (GSP) aims to develop tools for processing data
defined on irregular graph domains. In this paper, we first provide an overview of core ideas …

Graph learning: A survey

F Xia, K Sun, S Yu, A Aziz, L Wan… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Graphs are widely used as a popular representation of the network structure of connected
data. Graph data can be found in a broad spectrum of application domains such as social …

Fourier could be a data scientist: From graph Fourier transform to signal processing on graphs

B Ricaud, P Borgnat… - Comptes …, 2019 - comptes-rendus.academie-sciences …
Dealing with data and observations has always been an important aspect of discovery in
science. The idea that science is related to data was brilliantly summarised by Fourier in his …

Efficient sampling set selection for bandlimited graph signals using graph spectral proxies

A Anis, A Gadde, A Ortega - IEEE Transactions on Signal …, 2016 - ieeexplore.ieee.org
We study the problem of selecting the best sampling set for bandlimited reconstruction of
signals on graphs. A frequency domain representation for graph signals can be defined …

Sampling signals on graphs: From theory to applications

Y Tanaka, YC Eldar, A Ortega… - IEEE Signal Processing …, 2020 - ieeexplore.ieee.org
The study of sampling signals on graphs, with the goal of building an analog of sampling for
standard signals in the time and spatial domains, has attracted considerable attention …

[图书][B] Modern algorithms of cluster analysis

ST Wierzchoń, MA Kłopotek - 2018 - Springer
This chapter characterises the scope of this book. It explains the reasons why one should be
interested in cluster analysis, lists major application areas, basic theoretical and practical …

Fast resampling of three-dimensional point clouds via graphs

S Chen, D Tian, C Feng, A Vetro… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
To reduce the cost of storing, processing, and visualizing a large-scale point cloud, we
propose a randomized resampling strategy that selects a representative subset of points …

Transferability of spectral graph convolutional neural networks

R Levie, W Huang, L Bucci, M Bronstein… - Journal of Machine …, 2021 - jmlr.org
This paper focuses on spectral graph convolutional neural networks (ConvNets), where
filters are defined as elementwise multiplication in the frequency domain of a graph. In …

Graph reduction with spectral and cut guarantees

A Loukas - Journal of Machine Learning Research, 2019 - jmlr.org
Can one reduce the size of a graph without significantly altering its basic properties? The
graph reduction problem is hereby approached from the perspective of restricted spectral …

A framework of adaptive multiscale wavelet decomposition for signals on undirected graphs

X Zheng, YY Tang, J Zhou - IEEE Transactions on Signal …, 2019 - ieeexplore.ieee.org
The state-of-the-art graph wavelet decomposition was constructed by maximum spanning
tree (MST)-based downsampling and two-channel graph wavelet filter banks. In this work …