32,433 research outputs found
Compression via Compressive Sensing : A Low-Power Framework for the Telemonitoring of Multi-Channel Physiological Signals
Telehealth and wearable equipment can deliver personal healthcare and
necessary treatment remotely. One major challenge is transmitting large amount
of biosignals through wireless networks. The limited battery life calls for
low-power data compressors. Compressive Sensing (CS) has proved to be a
low-power compressor. In this study, we apply CS on the compression of
multichannel biosignals. We firstly develop an efficient CS algorithm from the
Block Sparse Bayesian Learning (BSBL) framework. It is based on a combination
of the block sparse model and multiple measurement vector model. Experiments on
real-life Fetal ECGs showed that the proposed algorithm has high fidelity and
efficiency. Implemented in hardware, the proposed algorithm was compared to a
Discrete Wavelet Transform (DWT) based algorithm, verifying the proposed one
has low power consumption and occupies less computational resources.Comment: 2013 International Workshop on Biomedical and Health Informatic
A* Orthogonal Matching Pursuit: Best-First Search for Compressed Sensing Signal Recovery
Compressed sensing is a developing field aiming at reconstruction of sparse
signals acquired in reduced dimensions, which make the recovery process
under-determined. The required solution is the one with minimum norm
due to sparsity, however it is not practical to solve the minimization
problem. Commonly used techniques include minimization, such as Basis
Pursuit (BP) and greedy pursuit algorithms such as Orthogonal Matching Pursuit
(OMP) and Subspace Pursuit (SP). This manuscript proposes a novel semi-greedy
recovery approach, namely A* Orthogonal Matching Pursuit (A*OMP). A*OMP
performs A* search to look for the sparsest solution on a tree whose paths grow
similar to the Orthogonal Matching Pursuit (OMP) algorithm. Paths on the tree
are evaluated according to a cost function, which should compensate for
different path lengths. For this purpose, three different auxiliary structures
are defined, including novel dynamic ones. A*OMP also incorporates pruning
techniques which enable practical applications of the algorithm. Moreover, the
adjustable search parameters provide means for a complexity-accuracy trade-off.
We demonstrate the reconstruction ability of the proposed scheme on both
synthetically generated data and images using Gaussian and Bernoulli
observation matrices, where A*OMP yields less reconstruction error and higher
exact recovery frequency than BP, OMP and SP. Results also indicate that novel
dynamic cost functions provide improved results as compared to a conventional
choice.Comment: accepted for publication in Digital Signal Processin
- …