Robust estimation of smooth graph signals from randomized space-time samples
From MaRDI portal
Recommendations
Cites work
- Adaptive greedy approximations
- Discrete Signal Processing on Graphs: Sampling Theory
- Dynamical sampling
- Dynamical sampling in shift-invariant spaces
- Dynamical sampling on finite index sets
- Dynamical sampling: time-space trade-off
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Estimating Localized Sources of Diffusion Fields Using Spatiotemporal Sensor Measurements
- Frame properties of systems arising via iterated actions of operators
- Frames induced by the action of continuous powers of an operator
- Greedy Sampling of Graph Signals
- Phaseless reconstruction from space-time samples
- Random sampling of bandlimited signals on graphs
- Reconstruction of Graph Signals Through Percolation from Seeding Nodes
- Reconstruction of bandlimited functions from space-time samples
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Sampling of Graph Signals With Successive Local Aggregations
- Sampling the flow of a bandlimited function
- Sampling, filtering and sparse approximations on combinatorial graphs
- Semi-Supervised Multiresolution Classification Using Adaptive Graph Filtering With Application to Indirect Bridge Structural Health Monitoring
- Signals on Graphs: Uncertainty Principle and Sampling
- Universal Spatiotemporal Sampling Sets for Discrete Spatially Invariant Evolutionary Systems
- User-friendly tail bounds for sums of random matrices
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
Cited in
(1)
This page was built for publication: Robust estimation of smooth graph signals from randomized space-time samples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663355)