452 research outputs found
Spatiotemporal Sparse Bayesian Learning with Applications to Compressed Sensing of Multichannel Physiological Signals
Energy consumption is an important issue in continuous wireless
telemonitoring of physiological signals. Compressed sensing (CS) is a promising
framework to address it, due to its energy-efficient data compression
procedure. However, most CS algorithms have difficulty in data recovery due to
non-sparsity characteristic of many physiological signals. Block sparse
Bayesian learning (BSBL) is an effective approach to recover such signals with
satisfactory recovery quality. However, it is time-consuming in recovering
multichannel signals, since its computational load almost linearly increases
with the number of channels.
This work proposes a spatiotemporal sparse Bayesian learning algorithm to
recover multichannel signals simultaneously. It not only exploits temporal
correlation within each channel signal, but also exploits inter-channel
correlation among different channel signals. Furthermore, its computational
load is not significantly affected by the number of channels. The proposed
algorithm was applied to brain computer interface (BCI) and EEG-based driver's
drowsiness estimation. Results showed that the algorithm had both better
recovery performance and much higher speed than BSBL. Particularly, the
proposed algorithm ensured that the BCI classification and the drowsiness
estimation had little degradation even when data were compressed by 80%, making
it very suitable for continuous wireless telemonitoring of multichannel
signals.Comment: Codes are available at:
https://sites.google.com/site/researchbyzhang/stsb
On some spectral properties of TanDEM-X interferograms over forested areas
This letter reports about some obervations over rainforest (in Brazil and Indonesia), where the spectra of TanDEM-X interferograms show distinct features, almost a signature, which is explained and modelled in terms of the scattering properties.
Supported by comparisons with simulations, the observations exclude any homogeneous, horizontally-layered forest; instead, they are compatible with a model with point scatterers clustered in clouds. Such a model, with high extinction and large gaps that allow significant penetration, is able to explain to a good degree the observations
Efficient Compressive Sampling of Spatially Sparse Fields in Wireless Sensor Networks
Wireless sensor networks (WSN), i.e. networks of autonomous, wireless sensing
nodes spatially deployed over a geographical area, are often faced with
acquisition of spatially sparse fields. In this paper, we present a novel
bandwidth/energy efficient CS scheme for acquisition of spatially sparse fields
in a WSN. The paper contribution is twofold. Firstly, we introduce a sparse,
structured CS matrix and we analytically show that it allows accurate
reconstruction of bidimensional spatially sparse signals, such as those
occurring in several surveillance application. Secondly, we analytically
evaluate the energy and bandwidth consumption of our CS scheme when it is
applied to data acquisition in a WSN. Numerical results demonstrate that our CS
scheme achieves significant energy and bandwidth savings wrt state-of-the-art
approaches when employed for sensing a spatially sparse field by means of a
WSN.Comment: Submitted to EURASIP Journal on Advances in Signal Processin
Spectrum cartography techniques, challenges, opportunities, and applications: A survey
The spectrum cartography finds applications in several areas such as cognitive radios, spectrum aware communications, machine-type communications, Internet of Things, connected vehicles, wireless sensor networks, and radio frequency management systems, etc. This paper presents a survey on state-of-the-art of spectrum cartography techniques for the construction of various radio environment maps (REMs). Following a brief overview on spectrum cartography, various techniques considered to construct the REMs such as channel gain map, power spectral density map, power map, spectrum map, power propagation map, radio frequency map, and interference map are reviewed. In this paper, we compare the performance of the different spectrum cartography methods in terms of mean absolute error, mean square error, normalized mean square error, and root mean square error. The information presented in this paper aims to serve as a practical reference guide for various spectrum cartography methods for constructing different REMs. Finally, some of the open issues and challenges for future research and development are discussed.publishedVersio
A Comprehensive Review of Distributed Coding Algorithms for Visual Sensor Network (VSN)
Since the invention of low cost camera, it has been widely incorporated into the sensor node in Wireless Sensor Network (WSN) to form the Visual Sensor Network (VSN). However, the use of camera is bringing with it a set of new challenges, because all the sensor nodes are powered by batteries. Hence, energy consumption is one of the most critical issues that have to be taken into consideration. In addition to this, the use of batteries has also limited the resources (memory, processor) that can be incorporated into the sensor node. The life time of a VSN decreases quickly as the image is transferred to the destination. One of the solutions to the aforementioned problem is to reduce the data to be transferred in the network by using image compression. In this paper, a comprehensive survey and analysis of distributed coding algorithms that can be used to encode images in VSN is provided. This also includes an overview of these algorithms, together with their advantages and deficiencies when implemented in VSN. These algorithms are then compared at the end to determine the algorithm that is more suitable for VSN
Analysis of compressive sensing for hyperspectral remote sensing applications
Compressive Sensing (CS) systems capture data with fewer measurements than traditional sensors assuming that imagery is redundant and compressible in the spectral and spatial dimensions. This thesis utilizes a model of the Coded Aperture Snapshot Spectral Imager-Dual Disperser (CASSI-DD) to simulate CS measurements from traditionally sensed HyMap images. A novel reconstruction algorithm that combines spectral smoothing and spatial total variation (TV) is used to create high resolution hyperspectral imagery from the simulated CS measurements. This research examines the effect of the number of measurements, which corresponds to the percentage of physical data sampled, on the quality of simulated CS data as estimated through performance of spectral image processing algorithms. The effect of CS on the data cloud is explored through principal component analysis (PCA) and endmember extraction. The ultimate purpose of this thesis is to investigate the utility of the CS sensor model and reconstruction for various hyperspectral applications in order to identify the strengths and limitations of CS. While CS is shown to create useful imagery for visual analysis, the data cloud is altered and per-pixel spectral fidelity declines for CS reconstructions from only a small number of measurements. In some hyperspectral applications, many measurements are needed in order to obtain comparable results to traditionally sensed HSI, including atmospheric compensation and subpixel target detection. On the other hand, in hyperspectral applications where pixels must be dramatically altered in order to be misclassified, such as land classification or NDVI mapping, CS shows promise
Distributed Detection and Estimation in Wireless Sensor Networks
In this article we consider the problems of distributed detection and
estimation in wireless sensor networks. In the first part, we provide a general
framework aimed to show how an efficient design of a sensor network requires a
joint organization of in-network processing and communication. Then, we recall
the basic features of consensus algorithm, which is a basic tool to reach
globally optimal decisions through a distributed approach. The main part of the
paper starts addressing the distributed estimation problem. We show first an
entirely decentralized approach, where observations and estimations are
performed without the intervention of a fusion center. Then, we consider the
case where the estimation is performed at a fusion center, showing how to
allocate quantization bits and transmit powers in the links between the nodes
and the fusion center, in order to accommodate the requirement on the maximum
estimation variance, under a constraint on the global transmit power. We extend
the approach to the detection problem. Also in this case, we consider the
distributed approach, where every node can achieve a globally optimal decision,
and the case where the decision is taken at a central node. In the latter case,
we show how to allocate coding bits and transmit power in order to maximize the
detection probability, under constraints on the false alarm rate and the global
transmit power. Then, we generalize consensus algorithms illustrating a
distributed procedure that converges to the projection of the observation
vector onto a signal subspace. We then address the issue of energy consumption
in sensor networks, thus showing how to optimize the network topology in order
to minimize the energy necessary to achieve a global consensus. Finally, we
address the problem of matching the topology of the network to the graph
describing the statistical dependencies among the observed variables.Comment: 92 pages, 24 figures. To appear in E-Reference Signal Processing, R.
Chellapa and S. Theodoridis, Eds., Elsevier, 201
- …