Sampling theory for graph signals

Siheng Chen, Aliaksei Sandryhaila, Jelena Kovacevic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose a sampling theory for finite-dimensional vectors with a generalized bandwidth restriction, which follows the same paradigm of the classical sampling theory. We use this general result to derive a sampling theorem for bandlimited graph signals in the framework of discrete signal processing on graphs. By imposing a specific structure on the graph, graph signals reduce to finite discrete-time or discrete-space signals, effectively ensuring that the proposed sampling theory works for such signals. The proposed sampling theory is applicable to both directed and undirected graphs, the assumption of perfect recovery is easy both to check and to satisfy, and, under that assumption, perfect recovery is guaranteed without any probability constraints or any approximation.

Original languageEnglish (US)
Title of host publication2015 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3392-3396
Number of pages5
Volume2015-August
ISBN (Electronic)9781467369978
DOIs
StatePublished - Jan 1 2015
Event40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Brisbane, Australia
Duration: Apr 19 2014Apr 24 2014

Other

Other40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015
CountryAustralia
CityBrisbane
Period4/19/144/24/14

Fingerprint

Sampling
Recovery
Signal processing
Bandwidth

Keywords

  • discrete signal processing on graphs
  • Sampling theory

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Chen, S., Sandryhaila, A., & Kovacevic, J. (2015). Sampling theory for graph signals. In 2015 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Proceedings (Vol. 2015-August, pp. 3392-3396). [7178600] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICASSP.2015.7178600

Sampling theory for graph signals. / Chen, Siheng; Sandryhaila, Aliaksei; Kovacevic, Jelena.

2015 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Proceedings. Vol. 2015-August Institute of Electrical and Electronics Engineers Inc., 2015. p. 3392-3396 7178600.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chen, S, Sandryhaila, A & Kovacevic, J 2015, Sampling theory for graph signals. in 2015 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Proceedings. vol. 2015-August, 7178600, Institute of Electrical and Electronics Engineers Inc., pp. 3392-3396, 40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015, Brisbane, Australia, 4/19/14. https://doi.org/10.1109/ICASSP.2015.7178600
Chen S, Sandryhaila A, Kovacevic J. Sampling theory for graph signals. In 2015 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Proceedings. Vol. 2015-August. Institute of Electrical and Electronics Engineers Inc. 2015. p. 3392-3396. 7178600 https://doi.org/10.1109/ICASSP.2015.7178600
Chen, Siheng ; Sandryhaila, Aliaksei ; Kovacevic, Jelena. / Sampling theory for graph signals. 2015 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Proceedings. Vol. 2015-August Institute of Electrical and Electronics Engineers Inc., 2015. pp. 3392-3396
@inproceedings{e70e657b879b4c6e91f3996115855c89,
title = "Sampling theory for graph signals",
abstract = "We propose a sampling theory for finite-dimensional vectors with a generalized bandwidth restriction, which follows the same paradigm of the classical sampling theory. We use this general result to derive a sampling theorem for bandlimited graph signals in the framework of discrete signal processing on graphs. By imposing a specific structure on the graph, graph signals reduce to finite discrete-time or discrete-space signals, effectively ensuring that the proposed sampling theory works for such signals. The proposed sampling theory is applicable to both directed and undirected graphs, the assumption of perfect recovery is easy both to check and to satisfy, and, under that assumption, perfect recovery is guaranteed without any probability constraints or any approximation.",
keywords = "discrete signal processing on graphs, Sampling theory",
author = "Siheng Chen and Aliaksei Sandryhaila and Jelena Kovacevic",
year = "2015",
month = "1",
day = "1",
doi = "10.1109/ICASSP.2015.7178600",
language = "English (US)",
volume = "2015-August",
pages = "3392--3396",
booktitle = "2015 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Sampling theory for graph signals

AU - Chen, Siheng

AU - Sandryhaila, Aliaksei

AU - Kovacevic, Jelena

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We propose a sampling theory for finite-dimensional vectors with a generalized bandwidth restriction, which follows the same paradigm of the classical sampling theory. We use this general result to derive a sampling theorem for bandlimited graph signals in the framework of discrete signal processing on graphs. By imposing a specific structure on the graph, graph signals reduce to finite discrete-time or discrete-space signals, effectively ensuring that the proposed sampling theory works for such signals. The proposed sampling theory is applicable to both directed and undirected graphs, the assumption of perfect recovery is easy both to check and to satisfy, and, under that assumption, perfect recovery is guaranteed without any probability constraints or any approximation.

AB - We propose a sampling theory for finite-dimensional vectors with a generalized bandwidth restriction, which follows the same paradigm of the classical sampling theory. We use this general result to derive a sampling theorem for bandlimited graph signals in the framework of discrete signal processing on graphs. By imposing a specific structure on the graph, graph signals reduce to finite discrete-time or discrete-space signals, effectively ensuring that the proposed sampling theory works for such signals. The proposed sampling theory is applicable to both directed and undirected graphs, the assumption of perfect recovery is easy both to check and to satisfy, and, under that assumption, perfect recovery is guaranteed without any probability constraints or any approximation.

KW - discrete signal processing on graphs

KW - Sampling theory

UR - http://www.scopus.com/inward/record.url?scp=84946067345&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84946067345&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2015.7178600

DO - 10.1109/ICASSP.2015.7178600

M3 - Conference contribution

AN - SCOPUS:84946067345

VL - 2015-August

SP - 3392

EP - 3396

BT - 2015 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -