{"title":"基于分布式维纳的图信号重构","authors":"E. Isufi, P. Lorenzo, P. Banelli, G. Leus","doi":"10.1109/SSP.2018.8450828","DOIUrl":null,"url":null,"abstract":"This paper proposes strategies for distributed Wiener-based reconstruction of graph signals from subsampled measurements. Given a stationary signal on a graph, we fit a distributed autoregressive moving average graph filter to a Wiener graph frequency response and propose two reconstruction strategies: i) reconstruction from a single temporal snapshot; ii) recursive signal reconstruction from a stream of noisy measurements. For both strategies, a mean square error analysis is performed to highlight the role played by the filter response and the sampled nodes, and to propose a graph sampling strategy. Our findings are validated with numerical results, which illustrate the potential of the proposed algorithms for distributed reconstruction of graph signals.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Distributed Wiener-Based Reconstruction of Graph Signals\",\"authors\":\"E. Isufi, P. Lorenzo, P. Banelli, G. Leus\",\"doi\":\"10.1109/SSP.2018.8450828\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes strategies for distributed Wiener-based reconstruction of graph signals from subsampled measurements. Given a stationary signal on a graph, we fit a distributed autoregressive moving average graph filter to a Wiener graph frequency response and propose two reconstruction strategies: i) reconstruction from a single temporal snapshot; ii) recursive signal reconstruction from a stream of noisy measurements. For both strategies, a mean square error analysis is performed to highlight the role played by the filter response and the sampled nodes, and to propose a graph sampling strategy. Our findings are validated with numerical results, which illustrate the potential of the proposed algorithms for distributed reconstruction of graph signals.\",\"PeriodicalId\":330528,\"journal\":{\"name\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSP.2018.8450828\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Statistical Signal Processing Workshop (SSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSP.2018.8450828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed Wiener-Based Reconstruction of Graph Signals
This paper proposes strategies for distributed Wiener-based reconstruction of graph signals from subsampled measurements. Given a stationary signal on a graph, we fit a distributed autoregressive moving average graph filter to a Wiener graph frequency response and propose two reconstruction strategies: i) reconstruction from a single temporal snapshot; ii) recursive signal reconstruction from a stream of noisy measurements. For both strategies, a mean square error analysis is performed to highlight the role played by the filter response and the sampled nodes, and to propose a graph sampling strategy. Our findings are validated with numerical results, which illustrate the potential of the proposed algorithms for distributed reconstruction of graph signals.