Uncertainty principles for signals defined on graphs: Bounds and characterizations

@article{Agaskar2012UncertaintyPF,
  title={Uncertainty principles for signals defined on graphs: Bounds and characterizations},
  author={Ameya Agaskar and Yue M. Lu},
  journal={2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
  year={2012},
  pages={3493-3496}
}
The classical uncertainty principle provides a fundamental tradeoff in the localization of a signal in the time and frequency domains. In this paper we describe a similar tradeoff for signals defined on graphs. We describe the notions of “spread” in the graph and spectral domains, using the eigenvectors of the graph Laplacian as a surrogate Fourier basis. We then describe how to find signals that, among all signals with the same spectral spread, have the smallest graph spread about a given… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Problems of learning on manifolds

  • M. Belkin
  • Ph.D. di ssertation, University of Chicago…
  • 2003
Highly Influential
4 Excerpts

Uncertainty principles for signals defined on grap hs

  • ——
  • to be submitted, .
  • 2011
1 Excerpt

Chung,Spectral graph theory

  • R K.F.
  • Providence, RI: American Mathematical Society,
  • 1997
1 Excerpt