REVIEW 4 cited by
Graph Signal Processing: Modulation, Convolution, and Sampling
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
To analyze data supported by arbitrary graphs G, DSP has been extended to Graph Signal Processing (GSP) by redefining traditional DSP concepts like shift, filtering, and Fourier transform among others. This paper revisits modulation, convolution, and sampling of graph signals as appropriate natural extensions of the corresponding DSP concepts. To define these for both the vertex and the graph frequency domains, we associate with generic data graph G and its graph shift A, a graph spectral shift M and a spectral graph Gs. This leads to a spectral GSP theory that parallels in the graph frequency domain the existing GSP theory in the vertex domain. The paper applies this to design and recovery sampling techniques for data supported by arbitrary directed graphs.
Forward citations
Cited by 4 Pith papers
-
Tight Wavelet Frames on Graphs via Isometric Group Embedding
A spectral band-pass wavelet construction on an isometric abelian-Cayley host gives exact tight-frame reconstruction for any graph signal, with a harmonic-extension completion rule.
-
Harmonic Analysis on Graphs via Isometric Group Embedding: A Canonical Fourier Transform, Shift, and Convolution for Network Signals
By embedding any network into a symmetric group graph, graph Fourier analysis becomes exact and translation-like, at the cost of host size.
-
Hilbert Transform on Graphs: Let There Be Phase
A graph Hilbert transform is defined on directed graphs after minimal edge addition, which provably creates a cycle cover that supports phase analysis.
-
Optimal Sampling and Reconstruction of Graph Signals in the Fractional Fourier Domain
Searching over fractional Fourier orders before graph-signal sampling reduces reconstruction error on the tested signals, but the optimal order is chosen using the true signal itself.
Discussion (0). Continue with ORCID to comment.