Two subspace methods for frequency sparse graph signals
From MaRDI portal
Publication:6652571
DOI10.1016/J.ACHA.2024.101711MaRDI QIDQ6652571FDOQ6652571
Authors: Tarek Emmrich, Martina Juhnke, Stefan Kunis 
Publication date: 12 December 2024
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Approximation by other special function classes (41A30)
Cites Work
- Tensor Decompositions and Applications
- A mathematical introduction to compressive sensing
- An uncertainty principle for cyclic groups of prime order
- Title not available (Why is that?)
- Combinatorial sublinear-time Fourier algorithms
- Rank of a Hadamard product
- Sampling of Graph Signals With Successive Local Aggregations
- Vertex-frequency analysis on graphs
- Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
- Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
- Multivariate exponential analysis from the minimal number of samples
- The generalized operator based Prony method
- Signal Processing on Simplicial Complexes
- Title not available (Why is that?)
- Hadamard powers and kernel perceptrons
- Short Communication: Weak Sparse Superresolution is Well-Conditioned
- Stability and super-resolution of MUSIC and ESPRIT for multi-snapshot spectral estimation
- Nonvanishing minors of eigenvector matrices and consequences
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)
