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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on signal processing Vol. 67; no. 21; pp. 5511 - 5526
Main Authors:	Wang, Fen, Cheung, Gene, Wang, Yongchao
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!