Sampling of Graph Signals via Randomized Local Aggregations

@article{Valsesia2018SamplingOG,
  title={Sampling of Graph Signals via Randomized Local Aggregations},
  author={Diego Valsesia and Giulia Fracastoro and Enrico Magli},
  journal={IEEE Transactions on Signal and Information Processing over Networks},
  year={2018},
  volume={5},
  pages={348-359}
}
Sampling of signals defined over the nodes of a graph is one of the crucial problems in graph signal processing, whereas in classical signal processing, sampling is a well-defined operation; when we consider a graph signal, many new challenges arise and defining an efficient sampling strategy is not straightforward. Recently, several works have addressed this problem. The most common techniques select a subset of nodes to reconstruct the entire signal. However, such methods often require the… CONTINUE READING
1
Twitter Mention

Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 42 REFERENCES

Signals on Graphs: Uncertainty Principle and Sampling

  • IEEE Transactions on Signal Processing
  • 2016
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Compressive Sensing Based Data Gathering in Clustered Wireless Sensor Networks

  • 2014 IEEE International Conference on Distributed Computing in Sensor Systems
  • 2014
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Decoding by linear programming

  • IEEE Transactions on Information Theory
  • 2005
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Greedy Sampling of Graph Signals

  • IEEE Transactions on Signal Processing
  • 2018
VIEW 1 EXCERPT

Accelerated sensor position selection using graph localization operator

  • 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2017
VIEW 3 EXCERPTS