The nystrom extension for signals defined on a graph

Ayelet Heimowitz, Yonina C. Eldar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

In this paper we introduce a computationally efficient solution to the problem of graph signal interpolation. Our solution is derived using the Nyström extension and is due to the properties of the Markov matrix which we use as our graph shift operator, inspired by diffusion maps. We focus on graph signals that are smooth over the graph. This assumption cements the relationship between the graph and the graph signal. We experimentally verify our suggested framework on the MNIST data set of handwritten digits.

Original languageEnglish
Title of host publication2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4199-4203
Number of pages5
ISBN (Print)9781538646588
DOIs
StatePublished - 10 Sep 2018
Externally publishedYes
Event2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Calgary, Canada
Duration: 15 Apr 201820 Apr 2018

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume2018-April
ISSN (Print)1520-6149

Conference

Conference2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018
Country/TerritoryCanada
CityCalgary
Period15/04/1820/04/18

Keywords

  • Diffusion maps
  • Nyström extension
  • Signal processing on graphs

Fingerprint

Dive into the research topics of 'The nystrom extension for signals defined on a graph'. Together they form a unique fingerprint.

Cite this