Hilbert Transform, Analytic Signal, and Modulation Analysis for Graph Signal Processing
arXiv:1611.05269
Abstract
We propose Hilbert transform (HT) and analytic signal (AS) construction for signals over graphs. This is motivated by the popularity of HT, AS, and modulation analysis in conventional signal processing, and the observation that complementary insight is often obtained by viewing conventional signals in the graph setting. Our definitions of HT and AS use a conjugate-symmetry-like property exhibited by the graph Fourier transform (GFT). We show that a real graph signal (GS) can be represented using smaller number of GFT coefficients than the signal length. We show that the graph HT (GHT) and graph AS (GAS) operations are linear and shift-invariant over graphs. Using the GAS, we define the amplitude, phase, and frequency modulations for a graph signal (GS). Further, we use convex optimization to develop an alternative definition of envelope for a GS. We illustrate the proposed concepts by showing applications to synthesized and real-world signals. For example, we show that the GHT is suitable for anomaly detection/analysis over networks and that GAS reveals complementary information in speech signals.
References in corpus (14)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Sampling Theory
- Perfect Reconstruction Two-Channel Wavelet Filter-Banks for Graph Structured Data
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Signals on Graphs: Uncertainty Principle and Sampling
- Signal Recovery on Graphs: Variation Minimization
- Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
- Kernel-based Reconstruction of Graph Signals
- Learning parametric dictionaries for graph signals
- Fast Robust PCA on Graphs
- Splines and Wavelets on Circulant Graphs
- Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI
- Signal processing on graphs: Transforms and tomograms