Low-complexity Graph Sampling With Noise and Signal Reconstruction via Neumann Series

Graph sampling addresses the problem of selecting a node subset in a graph to collect samples, so that a K-bandlimited signal can be reconstructed with high fidelity. Assuming an independent and identically distributed (i.i.d.) noise model, minimizing the expected mean square error (MMSE) leads to t...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on signal processing Ročník 67; číslo 21; s. 5511 - 5526
Hlavní autori:	Wang, Fen, Cheung, Gene, Wang, Yongchao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.11.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Approximation Complexity theory Covariance matrices Fourier transforms Graph signal processing Inversions Laplace equations Matrix decomposition matrix inversion Neumann series theorem Noise Optimality criteria Optimization Robustness (mathematics) Sampling Sampling methods Signal reconstruction Strategy
ISSN:	1053-587X, 1941-0476
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!