1,380 research outputs found
Recommended from our members
Variational Bayesian algorithm for distributed compressive sensing
Distributed compressive sensing (DCS) concerns the reconstruction of multiple sensor signals with reduced numbers of measurements, which exploits both intra- and inter-signal correlations. In this paper, we propose a novel Bayesian DCS algorithm based on variational Bayesian inference. The proposed algorithm decouples the common component, that characterizes inter-signal correlation, from innovation components, that represent intra-signal correlation. Such an operation results in a computational complexity of reconstruction which is linear with the number of signals. The superior performance of the algorithm, in terms of the computing time and reconstruction quality, is demonstrated by numerical simulations in comparison with other existing reconstruction methods.This work is supported by EPSRC Research Grant (EP/K033700/1); the Natural Science Foundation of China (61401018, U1334202); the State Key Laboratory of Rail Traffic Control and Safety (RCS2014ZT08), Beijing Jiaotong University; the Fundamental Research Funds for the Central Universities (2014JBM149); the Key Grant Project of Chinese Ministry of Education (313006); the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education MinistryThis is the author accepted manuscript. The final version is available from IEEE via http://dx.doi.org/10.1109/ICC.2015.724909
Variational Bayesian algorithm for quantized compressed sensing
Compressed sensing (CS) is on recovery of high dimensional signals from their
low dimensional linear measurements under a sparsity prior and digital
quantization of the measurement data is inevitable in practical implementation
of CS algorithms. In the existing literature, the quantization error is modeled
typically as additive noise and the multi-bit and 1-bit quantized CS problems
are dealt with separately using different treatments and procedures. In this
paper, a novel variational Bayesian inference based CS algorithm is presented,
which unifies the multi- and 1-bit CS processing and is applicable to various
cases of noiseless/noisy environment and unsaturated/saturated quantizer. By
decoupling the quantization error from the measurement noise, the quantization
error is modeled as a random variable and estimated jointly with the signal
being recovered. Such a novel characterization of the quantization error
results in superior performance of the algorithm which is demonstrated by
extensive simulations in comparison with state-of-the-art methods for both
multi-bit and 1-bit CS problems.Comment: Accepted by IEEE Trans. Signal Processing. 10 pages, 6 figure
Adaptive Non-uniform Compressive Sampling for Time-varying Signals
In this paper, adaptive non-uniform compressive sampling (ANCS) of
time-varying signals, which are sparse in a proper basis, is introduced. ANCS
employs the measurements of previous time steps to distribute the sensing
energy among coefficients more intelligently. To this aim, a Bayesian inference
method is proposed that does not require any prior knowledge of importance
levels of coefficients or sparsity of the signal. Our numerical simulations
show that ANCS is able to achieve the desired non-uniform recovery of the
signal. Moreover, if the signal is sparse in canonical basis, ANCS can reduce
the number of required measurements significantly.Comment: 6 pages, 8 figures, Conference on Information Sciences and Systems
(CISS 2017) Baltimore, Marylan
- …