Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Sampling Set Selection for Bandlimited Signals over Perturbed Graph Pei LI Haiyang ZHANG Fan CHU Wei WU Juan ZHAO Baoyun WANG Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E103-A No.6 pp.845-849 Publication Date: 2020/06/01 Online ISSN: 1745-1337 DOI: 10.1587/transfun.2019EAL2135 Type of Manuscript: LETTER Category: Graphs and Networks Keyword: graph signal processing, sampling set, mean square error, reconstruction, Full Text: PDF(393.7KB)>>
Summary: This paper proposes a sampling strategy for bandlimited graph signals over perturbed graph, in which we assume the edge between any pair of the nodes may be deleted randomly. Considering the mismatch between the true graph and the presumed graph, we derive the mean square error (MSE) of the reconstructed bandlimited graph signals. To minimize the MSE, we propose a greedy-based algorithm to obtain the optimal sampling set. Furthermore, we use Neumann series to avoid the pseudo-inverse computing. An efficient algorithm with low-complexity is thus proposed. Finally, numerical results show the superiority of our proposed algorithms over the other existing algorithms. | ||||||||||
| ||||||||||
