• Corpus ID: 13105613

Signal Representations on Graphs: Tools and Applications

  title={Signal Representations on Graphs: Tools and Applications},
  author={Siheng Chen and Rohan Varma and Aarti Singh and Jelena Kovacevic},
We present a framework for representing and modeling data on graphs. Based on this framework, we study three typical classes of graph signals: smooth graph signals, piecewise-constant graph signals, and piecewise-smooth graph signals. For each class, we provide an explicit definition of the graph signals and construct a corresponding graph dictionary with desirable properties. We then study how such graph dictionary works in two standard tasks: approximation and sampling followed with recovery… 
Signal Localization, Decomposition and Dictionary Learning on Graphs
This work considers three critical problems in graph signal processing: localization, decomposition and dictionary learning, and proposes a specific graph signal model, an optimization problem and a computationally efficient solver for each.
Smooth Signal Recovery on Product Graphs
  • R. Varma, J. Kovacevic
  • Computer Science
    ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2019
This work studies the reconstruction or estimation of smooth signals on product graphs from noisy measurements and develops and presents representations and algorithms that exploit the inherent structure in product graphs for better and more computationally efficient recovery.
Localization, Decomposition, and Dictionary Learning of Piecewise-Constant Signals on Graphs
An extensive empirical study is conducted to validate the proposed methods on both simulated and real data including the analysis of a large volume of spatio-temporal Manhattan urban data, which validates the effectiveness of the approach and suggests that graph signal processing tools may aid in urban planning and traffic forecasting.
This work presents a novel (co)sparse graph Laplacian-based signal model and characterize the underlying (structured) ( co)sparsity, smoothness and localization of its solution subspaces on undirected graphs, while providing more refined statements for special cases such as circulant graphs.
Vector-Valued Graph Trend Filtering With Non-Convex Penalties
This article studies the denoising of piecewise smooth graph signals that exhibit inhomogeneous levels of smoothness over a graph, where the value at each node can be vector-valued, and presents an ADMM-based algorithm to solve the proposed non-convex method and establish its convergence.
Graph Signal Processing: Overview, Challenges, and Applications
An overview of core ideas in GSP and their connection to conventional digital signal processing are provided, along with a brief historical perspective to highlight how concepts recently developed build on top of prior research in other areas.
Data Science with Graphs: A Signal Processing Perspective
This thesis considers five fundamental tasks on graphs from the perspective of graph signal processing: representation, sampling, recovery, detection and localization, and illustrates the power of the proposed tools on two real-world problems: fast resampling of 3D point clouds and mining of urban traffic data.
Fractional spectral graph wavelets and their applications
A novel transform named spectral graph fractional wavelet transform (SGFRWT) is defined, which is a generalized and extended version of spectral graph wavelet Transform (SGWT) and some potential applications are presented.
Kernel-based Inference of Functions over Graphs
Semi-parametric graph kernel-based reconstruction
The present contribution advocates an efficient semi-parametric approach capable of incorporating known signal structure without sacrificing the flexibility of the overall model and leads to markedly improved signal reconstruction performance.


Signals on Graphs: Uncertainty Principle and Sampling
An uncertainty principle for graph signals is derived and the conditions for the recovery of band-limited signals from a subset of samples are illustrated and shown, showing an interesting link between uncertainty principle and sampling and proposing alternative signal recovery algorithms.
Learning Graphs from Signal Observations under Smoothness Prior
This paper adopts a factor analysis model for the graph signals and imposes a Gaussian probabilistic prior on the latent variables that control these graph signals, and proposes an algorithm for learning graphs that enforce such smoothness property for the signal observations by minimizing the variations of the signals on the learned graph.
The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains
This tutorial overview outlines the main challenges of the emerging field of signal processing on graphs, discusses different ways to define graph spectral domains, which are the analogs to the classical frequency domain, and highlights the importance of incorporating the irregular structures of graph data domains when processing signals on graphs.
Signal Recovery on Graphs: Variation Minimization
This work formulate graph signal recovery as an optimization problem, for which it provides a general solution through the alternating direction methods of multipliers through which it relates to signal inpainting, matrix completion, robust principal component analysis, and anomaly detection.
Discrete Signal Processing on Graphs: Frequency Analysis
A definition of total variation for graph signals that naturally leads to a frequency ordering on graphs is proposed and defines low-, high-, and band-pass graph signals and filters.
Reconstruction of Graph Signals Through Percolation from Seeding Nodes
This paper focuses on reconstructing bandlimited graph signals, which are signals that admit a sparse representation in a frequency domain related to the structure of the graph, and proposes new schemes to recover signals defined in the nodes of a graph.
Discrete Signal Processing on Graphs: Sampling Theory
It is shown that perfect recovery is possible for graph signals bandlimited under the graph Fourier transform and the connection to the sampling theory of finite discrete-time signal processing and previous work on signal recovery on graphs is established.
Vertex-Frequency Analysis on Graphs
Learning Parametric Dictionaries for Signals on Graphs
This work proposes a parametric dictionary learning algorithm to design data-adapted, structured dictionaries that sparsely represent graph signals that feature localized atoms and can be implemented in a computationally efficient manner in signal processing tasks such as compression, denoising, and classification.
Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
This work introduces quantities called graph spectral proxies, defined using the powers of the variation operator, in order to approximate the spectral content of graph signals, and forms a direct sampling set selection approach that does not require the computation and storage of the basis elements.