12,861 research outputs found
Spectral unmixing of Multispectral Lidar signals
In this paper, we present a Bayesian approach for spectral unmixing of
multispectral Lidar (MSL) data associated with surface reflection from targeted
surfaces composed of several known materials. The problem addressed is the
estimation of the positions and area distribution of each material. In the
Bayesian framework, appropriate prior distributions are assigned to the unknown
model parameters and a Markov chain Monte Carlo method is used to sample the
resulting posterior distribution. The performance of the proposed algorithm is
evaluated using synthetic MSL signals, for which single and multi-layered
models are derived. To evaluate the expected estimation performance associated
with MSL signal analysis, a Cramer-Rao lower bound associated with model
considered is also derived, and compared with the experimental data. Both the
theoretical lower bound and the experimental analysis will be of primary
assistance in future instrument design
Bayesian optimisation for likelihood-free cosmological inference
Many cosmological models have only a finite number of parameters of interest,
but a very expensive data-generating process and an intractable likelihood
function. We address the problem of performing likelihood-free Bayesian
inference from such black-box simulation-based models, under the constraint of
a very limited simulation budget (typically a few thousand). To do so, we adopt
an approach based on the likelihood of an alternative parametric model.
Conventional approaches to approximate Bayesian computation such as
likelihood-free rejection sampling are impractical for the considered problem,
due to the lack of knowledge about how the parameters affect the discrepancy
between observed and simulated data. As a response, we make use of a strategy
previously developed in the machine learning literature (Bayesian optimisation
for likelihood-free inference, BOLFI), which combines Gaussian process
regression of the discrepancy to build a surrogate surface with Bayesian
optimisation to actively acquire training data. We extend the method by
deriving an acquisition function tailored for the purpose of minimising the
expected uncertainty in the approximate posterior density, in the parametric
approach. The resulting algorithm is applied to the problems of summarising
Gaussian signals and inferring cosmological parameters from the Joint
Lightcurve Analysis supernovae data. We show that the number of required
simulations is reduced by several orders of magnitude, and that the proposed
acquisition function produces more accurate posterior approximations, as
compared to common strategies.Comment: 16+9 pages, 12 figures. Matches PRD published version after minor
modification
Cooperative Simultaneous Localization and Synchronization in Mobile Agent Networks
Cooperative localization in agent networks based on interagent time-of-flight
measurements is closely related to synchronization. To leverage this relation,
we propose a Bayesian factor graph framework for cooperative simultaneous
localization and synchronization (CoSLAS). This framework is suited to mobile
agents and time-varying local clock parameters. Building on the CoSLAS factor
graph, we develop a distributed (decentralized) belief propagation algorithm
for CoSLAS in the practically important case of an affine clock model and
asymmetric time stamping. Our algorithm allows for real-time operation and is
suitable for a time-varying network connectivity. To achieve high accuracy at
reduced complexity and communication cost, the algorithm combines particle
implementations with parametric message representations and takes advantage of
a conditional independence property. Simulation results demonstrate the good
performance of the proposed algorithm in a challenging scenario with
time-varying network connectivity.Comment: 13 pages, 6 figures, 3 tables; manuscript submitted to IEEE
Transaction on Signal Processin
Sequential bayesian filtering for spatial arrival time estimation
Locating and tracking a source in an ocean environment as well as estimating environmental parameters of a sound propagation medium is of utmost importance in underwater acoustics. Matched field processing is often the method of choice for the estimation of such parameters. This approach, based on full field calculations, is computationally intensive and sensitive to assumptions on the structure of the environment. As an alternative, methods that use only select features of the acoustic field for source localization and environmental inversion have been proposed. The focus here is on inversion using arrival times of identified paths within recorded time-series. After a short study of a linearization techniques employing such features and numerical issues on their implementation, we turn our attention to the need for accurate extraction of arrival times for accurate estimation. We develop a particle filtering approach that treats arrival times as targets , dynamically modeling their location at arrays of spatially separated receivers. Using Monte Carlo simulations, we perform an evaluation of our method and compare it to conventional Maximum Likelihood (ML) estimation. The comparison demonstrates an advantage in using the proposed approach, which can be employed as a pre-inversion tool for minimization and quantification of uncertainty in arrival time estimation
Cooperative Authentication in Underwater Acoustic Sensor Networks
With the growing use of underwater acoustic communications (UWAC) for both
industrial and military operations, there is a need to ensure communication
security. A particular challenge is represented by underwater acoustic networks
(UWANs), which are often left unattended over long periods of time. Currently,
due to physical and performance limitations, UWAC packets rarely include
encryption, leaving the UWAN exposed to external attacks faking legitimate
messages. In this paper, we propose a new algorithm for message authentication
in a UWAN setting. We begin by observing that, due to the strong spatial
dependency of the underwater acoustic channel, an attacker can attempt to mimic
the channel associated with the legitimate transmitter only for a small set of
receivers, typically just for a single one. Taking this into account, our
scheme relies on trusted nodes that independently help a sink node in the
authentication process. For each incoming packet, the sink fuses beliefs
evaluated by the trusted nodes to reach an authentication decision. These
beliefs are based on estimated statistical channel parameters, chosen to be the
most sensitive to the transmitter-receiver displacement. Our simulation results
show accurate identification of an attacker's packet. We also report results
from a sea experiment demonstrating the effectiveness of our approach.Comment: Author version of paper accepted for publication in the IEEE
Transactions on Wireless Communication
Sensor Placement for Damage Localization in Sensor Networks
The objective of this thesis is to formulate and solve the sensor placement problem for damage localization in a sensor network. A Bayesian estimation problem is formulated with the time-of-flight (ToF) measurements. In this model, ToF of lamb waves, which are generated and received by piezoelectric sensors, is the total time for each wave to be transmitted, reflected by the target, and received by the sensor. The ToF of the scattered lamb wave has characteristic information about the target location. By using the measurement model and prior information, the target location is estimated in a centralized sensor network with a Monte Carlo approach. Then we derive the Bayesian Fisher information matrix (B-FIM) and based on that posterior Cramer-Rao lower bound (PCRLB), which sets a limit on the mean squared error (MSE) of any Bayesian estimator. In addition, we develop an optimal sensor placement approach to achieve more accurate damage localization, which is based on minimizing the PCRLB. Simulation results show that the optimal sensor placement solutions lead to much lower estimation errors than some sub-optimal sensor placement solutions
Asynchronous device detection for cognitive device-to-device communications
Dynamic spectrum sharing will facilitate the interference coordination in device-to-device (D2D) communications. In the absence of network level coordination, the timing synchronization among D2D users will be unavailable, leading to inaccurate channel state estimation and device detection, especially in time-varying fading environments. In this study, we design an asynchronous device detection/discovery framework for cognitive-D2D applications, which acquires timing drifts and dynamical fading channels when directly detecting the existence of a proximity D2D device (e.g. or primary user). To model and analyze this, a new dynamical system model is established, where the unknown timing deviation follows a random process, while the fading channel is governed by a discrete state Markov chain. To cope with the mixed estimation and detection (MED) problem, a novel sequential estimation scheme is proposed, using the conceptions of statistic Bayesian inference and random finite set. By tracking the unknown states (i.e. varying time deviations and fading gains) and suppressing the link uncertainty, the proposed scheme can effectively enhance the detection performance. The general framework, as a complimentary to a network-aided case with the coordinated signaling, provides the foundation for development of flexible D2D communications along with proximity-based spectrum sharing
- …