Graph signal processing: Overview, challenges, and applications
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 …
defined on irregular graph domains. In this paper, we first provide an overview of core ideas …
Graph filters for signal processing and machine learning on graphs
Filters are fundamental in extracting information from data. For time series and image data
that reside on Euclidean domains, filters are the crux of many signal processing and …
that reside on Euclidean domains, filters are the crux of many signal processing and …
A framework of adaptive multiscale wavelet decomposition for signals on undirected graphs
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 …
tree (MST)-based downsampling and two-channel graph wavelet filter banks. In this work …
Data analytics on graphs part III: Machine learning on graphs, from graph topology to applications
Modern data analytics applications on graphs often operate on domains where graph
topology is not known a priori, and hence its determination becomes part of the problem …
topology is not known a priori, and hence its determination becomes part of the problem …
Introduction to graph signal processing
Graph signal processing deals with signals whose domain, defined by a graph, is irregular.
An overview of basic graph forms and definitions is presented first. Spectral analysis of …
An overview of basic graph forms and definitions is presented first. Spectral analysis of …
Graph signal denoising via trilateral filter on graph spectral domain
This paper presents a graph signal denoising method with the trilateral filter defined in the
graph spectral domain. The original trilateral filter (TF) is a data-dependent filter that is …
graph spectral domain. The original trilateral filter (TF) is a data-dependent filter that is …
Minimax design of graph filter using Chebyshev polynomial approximation
CC Tseng, SL Lee - IEEE Transactions on Circuits and Systems …, 2021 - ieeexplore.ieee.org
In this brief, the minimax design problem of graph filter using Chebyshev polynomial
approximation (CPA) is studied. First, conventional CPA graph filter design is investigated to …
approximation (CPA) is studied. First, conventional CPA graph filter design is investigated to …
Extending classical multirate signal processing theory to graphs—Part II: M-channel filter banks
O Teke, PP Vaidyanathan - IEEE Transactions on Signal …, 2016 - ieeexplore.ieee.org
This paper builds upon the basic theory of multirate systems for graph signals developed in
the companion paper (Part I) and studies M-channel polynomial filter banks on graphs. The …
the companion paper (Part I) and studies M-channel polynomial filter banks on graphs. The …
Extending classical multirate signal processing theory to graphs—Part I: Fundamentals
O Teke, PP Vaidyanathan - IEEE Transactions on Signal …, 2016 - ieeexplore.ieee.org
Signal processing on graphs finds applications in many areas. In recent years, renewed
interest on this topic was kindled by two groups of researchers. Narang and Ortega …
interest on this topic was kindled by two groups of researchers. Narang and Ortega …
Oversampled graph Laplacian matrix for graph filter banks
A Sakiyama, Y Tanaka - IEEE Transactions on Signal …, 2014 - ieeexplore.ieee.org
We describe a method of oversampling signals defined on a weighted graph by using an
oversampled graph Laplacian matrix. The conventional method of using critically sampled …
oversampled graph Laplacian matrix. The conventional method of using critically sampled …