English
Related papers

Related papers: Adaptive Non-uniform Compressive Sampling for Time…

200 papers

Periodic nonuniform sampling is a known method to sample spectrally sparse signals below the Nyquist rate. This strategy relies on the implicit assumption that the individual samplers are exposed to the entire frequency range. This…

Information Theory · Computer Science 2009-01-27 Moshe Mishali , Yonina C. Eldar , Joel A. Tropp

In this paper, we introduce a time-stampless adaptive nonuniform sampling (TANS) framework, in which time increments between samples are determined by a function of the $m$ most recent increments and sample values. Since only past samples…

Information Theory · Computer Science 2015-03-24 Soheil Feizi , Vivek K Goyal , Muriel Medard

Measurement samples are often taken in various monitoring applications. To reduce the sensing cost, it is desirable to achieve better sensing quality while using fewer samples. Compressive Sensing (CS) technique finds its role when the…

Information Theory · Computer Science 2016-11-18 Ying Li , Kun Xie , Xin Wang

In this work the dynamic compressive sensing (CS) problem of recovering sparse, correlated, time-varying signals from sub-Nyquist, non-adaptive, linear measurements is explored from a Bayesian perspective. While there has been a handful of…

Information Theory · Computer Science 2015-06-05 Justin Ziniel , Philip Schniter

Exploiting intrinsic structures in sparse signals underpins the recent progress in compressive sensing (CS). The key for exploiting such structures is to achieve two desirable properties: generality (\ie, the ability to fit a wide range of…

Signal Processing · Electrical Eng. & Systems 2018-12-26 Suwichaya Suwanwimolkul , Lei Zhang , Dong Gong , Zhen Zhang , Chao Chen , Damith C. Ranasinghe , Qinfeng Shi

Sparse signals can be recovered from a reduced set of samples by using compressive sensing algorithms. In common methods the signal is recovered in the sparse domain. A method for the reconstruction of sparse signal which reconstructs the…

Information Theory · Computer Science 2015-04-28 Ljubisa Stankovic , Milos Dakovic

We develop a Bayesian framework for sensing which adapts the sensing time and/or basis functions to the instantaneous sensing quality measured in terms of the expected posterior mean-squared error. For sparse Gaussian sources a significant…

Information Theory · Computer Science 2018-02-12 Ralf R. Müller , Ali Bereyhi , Christoph F. Mecklenbräuker

Compressed sensing is designed to measure sparse signals directly in a compressed form. However, most signals of interest are only "approximately sparse", i.e. even though the signal contains only a small fraction of relevant (large)…

Information Theory · Computer Science 2013-04-04 Jean Barbier , Florent Krzakala , Marc Mézard , Lenka Zdeborová

This paper presents a novel power spectral density estimation technique for band-limited, wide-sense stationary signals from sub-Nyquist sampled data. The technique employs multi-coset sampling and incorporates the advantages of compressed…

Information Theory · Computer Science 2012-05-18 Michael A. Lexa , Mike E. Davies , John S. Thompson

Wireless sensor networks are often designed to perform two tasks: sensing a physical field and transmitting the data to end-users. A crucial aspect of the design of a WSN is the minimization of the overall energy consumption. Previous…

Information Theory · Computer Science 2014-01-07 Zichong Chen , Juri Ranieri , Runwei Zhang , Martin Vetterli

In oversampled adaptive sensing (OAS), noisy measurements are collected in multiple subframes. The sensing basis in each subframe is adapted according to some posterior information exploited from previous measurements. The framework is…

Information Theory · Computer Science 2019-12-11 Ali Bereyhi , Ralf R. Müller

Recovery of arbitrarily positioned samples that are missing in sparse signals recently attracted significant research interest. Sparse signals with heavily corrupted arbitrary positioned samples could be analyzed in the same way as…

Information Theory · Computer Science 2013-09-24 Ljubisa Stankovic , Milos Dakovic , Stefan Vujovic

One-bit compressive sensing (CS) is an advanced version of sparse recovery in which the sparse signal of interest can be recovered from extremely quantized measurements. Namely, only the sign of each measurement is available to us. In many…

Information Theory · Computer Science 2019-10-22 Hossein Beheshti , Sajad Daei , Farzan Haddadi

Recent breakthrough results in compressed sensing (CS) have established that many high dimensional objects can be accurately recovered from a relatively small number of non- adaptive linear projection observations, provided that the objects…

Machine Learning · Statistics 2011-11-30 Akshay Soni , Jarvis Haupt

Oversampled adaptive sensing (OAS) is a recently proposed Bayesian framework which sequentially adapts the sensing basis. In OAS, estimation quality is, in each step, measured by conditional mean squared errors (MSEs), and the basis for the…

Information Theory · Computer Science 2018-11-16 Ralf R. Müller , Ali Bereyhi , Christoph F. Mecklenbräuker

Adaptive sampling results in dramatic improvements in the recovery of sparse signals in white Gaussian noise. A sequential adaptive sampling-and-refinement procedure called Distilled Sensing (DS) is proposed and analyzed. DS is a form of…

Statistics Theory · Mathematics 2010-05-31 Jarvis Haupt , Rui Castro , Robert Nowak

A traditional assumption underlying most data converters is that the signal should be sampled at a rate exceeding twice the highest frequency. This statement is based on a worst-case scenario in which the signal occupies the entire…

Information Theory · Computer Science 2015-05-13 Yonina C. Eldar

In compressive sensing, a small collection of linear projections of a sparse signal contains enough information to permit signal recovery. Distributed compressive sensing (DCS) extends this framework by defining ensemble sparsity models,…

Information Theory · Computer Science 2013-03-29 Marco F. Duarte , Michael B. Wakin , Dror Baron , Shriram Sarvotham , Richard G. Baraniuk

In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…

Information Theory · Computer Science 2021-08-25 Hanshen Xiao , Yaowen Zhang , Guoqiang Xiao

Recent breakthrough results in compressive sensing (CS) have established that many high dimensional signals can be accurately recovered from a relatively small number of non-adaptive linear observations, provided that the signals possess a…

Information Theory · Computer Science 2013-10-17 Akshay Soni , Jarvis Haupt
‹ Prev 1 2 3 10 Next ›