Skip to main navigation Skip to search Skip to main content

Greedy algorithm with approximation ratio for sampling noisy graph signals

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We study the optimal sampling set selection problem in sampling a noisy k-bandlimited graph signal. To minimize the effect of noise when trying to reconstruct a k-bandlimited graph signal from m samples, the optimal sampling set selection problem has been shown to be equivalent to finding a m×k submatrix with the maximum smallest singular value, σmin [3]. As the problem is NP-hard, we present a greedy algorithm inspired by a similar submatrix selection problem known in computer science and to which we add a local search refinement. We show that 1) in experiments, our algorithm finds a submatrix with larger σmin than prior greedy algorithm [3], and 2) has a proven worst-case approximation ratio of 1/(1+ϵ)k, where ϵ is a constant.

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

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume2018-April

Conference

Conference2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018
Country/TerritoryCanada
CityCalgary
Period4/15/18 → 4/20/18

Keywords

  • Approximation Ratio
  • Graph Signal Processing
  • Graph Signal Sampling
  • Greedy Algorithm
  • Noisy Graph Signal

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Greedy algorithm with approximation ratio for sampling noisy graph signals'. Together they form a unique fingerprint.

Cite this