Two subspace methods for frequency sparse graph signals

DOI10.1016/J.ACHA.2024.101711MaRDI QIDQ6652571zbMATH OpenFDO

Authors Tarek Emmrich, Martina Juhnke, Stefan Kunis

Publication date 12 December 2024

Published in Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ACHA.2024.101711

zbMATH Keywords

signal processing on graphssparse graph Fourier transform

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Approximation by other special function classes (41A30)

Review text

The authors investigate signals which are sparse in the graph's spectral domain. They develop explicit algorithms to not only reconstruct the support set but also partial components from samples arising from a few graph vertices. The number of required samples is independent of the total size of the graph and takes only local properties of the graph into account. The derived results are based on an operator-theoretic framework for subspace methods and are shown to become effective if the spectral eigenfunctions are zero-free or linearly independent on a small set of graph vertices.

Recommendations

• Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
• What's the frequency, Kenneth?: Sublinear Fourier sampling off the grid
• The dual graph shift operator: identifying the support of the frequency domain
• Structured sampling and fast reconstruction of smooth graph signals

Cites work

• A mathematical introduction to compressive sensing
• An uncertainty principle for cyclic groups of prime order
• Combinatorial sublinear-time Fourier algorithms
• Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
• Hadamard powers and kernel perceptrons
• scientific article; zbMATH DE number 7053345 (Why is no real title available?)
• Multivariate exponential analysis from the minimal number of samples
• Nonvanishing minors of eigenvector matrices and consequences
• Rank of a Hadamard product
• Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
• Sampling of Graph Signals With Successive Local Aggregations
• Short Communication: Weak Sparse Superresolution is Well-Conditioned
• Signal Processing on Simplicial Complexes
• Stability and super-resolution of MUSIC and ESPRIT for multi-snapshot spectral estimation
• Tensor Decompositions and Applications
• The generalized operator based Prony method
• Transferability of spectral graph convolutional neural networks
• Vertex-frequency analysis on graphs

Cited in

(1)

• Sparse graph signals -- uncertainty principles and recovery

This page was built for publication: Two subspace methods for frequency sparse graph signals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652571)