Sparse Sensing for Statistical Inference
S. P. Chepuri, G. Leus
{"title":"Sparse Sensing for Statistical Inference","authors":"S. P. Chepuri, G. Leus","doi":"10.1561/2000000069","DOIUrl":null,"url":null,"abstract":"In today’s society, we are flooded with massive volumes of data in the order of a billion gigabytes on a daily basis from pervasive sensors. It is becoming increasingly challenging to sense, store, transport, or process (i.e., for inference) the acquired data. To alleviate these problems, it is evident that there is an urgent need to significantly reduce the sensing cost (i.e., the number of expensive sensors) as well as the related memory and bandwidth requirements by developing unconventional sensing mechanisms to extract as much information as possible yet collecting fewer data. The aim of this monograph is therefore to develop theory and algorithms for smart data reduction. We develop a data reduction tool called sparse sensing, which consists of a deterministic and structured sensing function (guided by a sparse vector) that is optimally designed to achieve a desired inference performance with the reduced number of data samples. We develop sparse sensing mechanisms, convex programs, and greedy algorithms to efficiently design sparse sensing functions, where we assume that the data is not yet available and the model information is perfectly known. Sparse sensing offers a number of advantages over compressed sensing (a state-of-the-art data reduction method for sparse signal recovery). One of the major differences is that in sparse sensing the underlying signals need not be sparse. This allows for general signal processing tasks (not just sparse signal recovery) under the proposed sparse sensing framework. Specifically, we focus on fundamental statistical inference tasks, like estimation, filtering, and detection. In essence, we present topics that transform classical (e.g., random or uniform) sensing methods to low-cost data acquisition mechanisms tailored for specific inference tasks. The developed framework can be applied to sensor selection, sensor placement, or sensor scheduling, for example. S.P. Chepuri and G. Leus. Sparse Sensing for Statistical Inference. Foundations and Trends R © in Signal Processing, vol. 9, no. 3-4, pp. 233–386, 2015. DOI: 10.1561/2000000069. Full text available at: http://dx.doi.org/10.1561/2000000069","PeriodicalId":12340,"journal":{"name":"Found. Trends Signal Process.","volume":"88 2 1","pages":"233-368"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Found. Trends Signal Process.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1561/2000000069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 27
Abstract
In today’s society, we are flooded with massive volumes of data in the order of a billion gigabytes on a daily basis from pervasive sensors. It is becoming increasingly challenging to sense, store, transport, or process (i.e., for inference) the acquired data. To alleviate these problems, it is evident that there is an urgent need to significantly reduce the sensing cost (i.e., the number of expensive sensors) as well as the related memory and bandwidth requirements by developing unconventional sensing mechanisms to extract as much information as possible yet collecting fewer data. The aim of this monograph is therefore to develop theory and algorithms for smart data reduction. We develop a data reduction tool called sparse sensing, which consists of a deterministic and structured sensing function (guided by a sparse vector) that is optimally designed to achieve a desired inference performance with the reduced number of data samples. We develop sparse sensing mechanisms, convex programs, and greedy algorithms to efficiently design sparse sensing functions, where we assume that the data is not yet available and the model information is perfectly known. Sparse sensing offers a number of advantages over compressed sensing (a state-of-the-art data reduction method for sparse signal recovery). One of the major differences is that in sparse sensing the underlying signals need not be sparse. This allows for general signal processing tasks (not just sparse signal recovery) under the proposed sparse sensing framework. Specifically, we focus on fundamental statistical inference tasks, like estimation, filtering, and detection. In essence, we present topics that transform classical (e.g., random or uniform) sensing methods to low-cost data acquisition mechanisms tailored for specific inference tasks. The developed framework can be applied to sensor selection, sensor placement, or sensor scheduling, for example. S.P. Chepuri and G. Leus. Sparse Sensing for Statistical Inference. Foundations and Trends R © in Signal Processing, vol. 9, no. 3-4, pp. 233–386, 2015. DOI: 10.1561/2000000069. Full text available at: http://dx.doi.org/10.1561/2000000069
稀疏感知用于统计推断
在当今社会,我们每天都被来自无处不在的传感器的大量数据所淹没,这些数据的数量级达到10亿千兆字节。对获取的数据进行感知、存储、传输或处理(即进行推理)正变得越来越具有挑战性。为了缓解这些问题,显然迫切需要通过开发非常规的传感机制来显著降低传感成本(即昂贵传感器的数量)以及相关的内存和带宽要求,以提取尽可能多的信息,同时收集尽可能少的数据。因此,本专著的目的是为智能数据简化开发理论和算法。我们开发了一种称为稀疏感知的数据约简工具,它由确定性和结构化感知函数(由稀疏向量引导)组成,该函数经过优化设计,可以在减少数据样本数量的情况下实现所需的推理性能。我们开发了稀疏感知机制,凸程序和贪婪算法来有效地设计稀疏感知函数,其中我们假设数据尚未可用并且模型信息是完全已知的。与压缩感知(一种用于稀疏信号恢复的最新数据缩减方法)相比,稀疏感知提供了许多优点。其中一个主要的区别是,在稀疏传感中,底层信号不需要稀疏。这允许在提出的稀疏感知框架下进行一般的信号处理任务(不仅仅是稀疏信号恢复)。具体来说,我们专注于基本的统计推理任务,如估计、过滤和检测。从本质上讲,我们提出了将经典(例如,随机或均匀)传感方法转换为针对特定推理任务量身定制的低成本数据采集机制的主题。例如,开发的框架可以应用于传感器选择、传感器放置或传感器调度。S.P. Chepuri和G. Leus。稀疏感知用于统计推断。基础与趋势R©in Signal Processing, vol. 9, no. 5。3-4, pp. 233-386, 2015。DOI: 10.1561 / 2000000069。全文可在:http://dx.doi.org/10.1561/2000000069
本文章由计算机程序翻译,如有差异,请以英文原文为准。