An efficient algorithm with fast convergence rate for sparse graph signal reconstruction

Abstract In this paper, we consider the graph signals are sparse in the graph Fourier domain and propose an iterative threshold compressed sensing reconstruction (ITCSR) algorithm to reconstruct sparse graph signals in the graph Fourier domain. The proposed ITCSR algorithm derives from the well-know...

Täydet tiedot

Bibliografiset tiedot

Päätekijät:	Yuting Cao, Xue-Qin Jiang, Jian Wang, Shubo Zhou, Xinxin Hou
Aineistotyyppi:	Artigo
Kieli:	Inglês
Julkaistu:	SpringerOpen 2024-03-01
Sarja:	EURASIP Journal on Advances in Signal Processing
Aiheet:	Sparse graph signals Iterative threshold compressed sensing reconstruction (ITCSR) Graph Fourier domain Compressed sensing (CS)
Linkit:	https://doi.org/10.1186/s13634-024-01133-3
Tagit:	Lisää tagi Ei tageja, Lisää ensimmäinen tagi!