Number of compressed measurements needed for noisy distributed compressed sensing

Sangjun Park, Heung-no Lee
{"title":"Number of compressed measurements needed for noisy distributed compressed sensing","authors":"Sangjun Park, Heung-no Lee","doi":"10.1109/ISIT.2012.6283555","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a data collection network (DCN) system where sensors take samples and transmit them to a Fusion Center (FC). Signal correlation is modeled with signal sparseness. The number of compressed measurements which allows correct signal recovery at FC is investigated. This is done by studying the probability of signal recovery failure. The joint typical decoder (JT decoder) similar to the one proposed by Akcakaya and Tarokh is used to avoid dependence on particular choice of recovery routines. The following interesting results have been obtained: 1) The detection failure probability linearly converges to zero as the number of sensors increases. 2) The number of compressed measurements per sensor (PSM) needed for successful recovery converges to sparsity as the number of sensors increases.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2012.6283555","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we consider a data collection network (DCN) system where sensors take samples and transmit them to a Fusion Center (FC). Signal correlation is modeled with signal sparseness. The number of compressed measurements which allows correct signal recovery at FC is investigated. This is done by studying the probability of signal recovery failure. The joint typical decoder (JT decoder) similar to the one proposed by Akcakaya and Tarokh is used to avoid dependence on particular choice of recovery routines. The following interesting results have been obtained: 1) The detection failure probability linearly converges to zero as the number of sensors increases. 2) The number of compressed measurements per sensor (PSM) needed for successful recovery converges to sparsity as the number of sensors increases.
噪声分布式压缩感知所需的压缩测量数
在本文中,我们考虑了一个数据采集网络(DCN)系统,其中传感器采集样本并将其传输到融合中心(FC)。利用信号稀疏性对信号相关进行建模。研究了允许在FC处正确恢复信号的压缩测量的数量。这是通过研究信号恢复失败的概率来实现的。采用了类似Akcakaya和Tarokh提出的联合典型解码器(JT解码器),避免了对特定恢复程序选择的依赖。得到了以下有趣的结果:1)随着传感器数量的增加,检测失败概率线性收敛于零。2)随着传感器数量的增加,成功恢复所需的每个传感器(PSM)压缩测量的数量收敛到稀疏性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书