Bayesian Design of Tandem Networks for Distributed Detection With Multi-bit Sensor Decisions

We consider the problem of decentralized hypothesis testing under communication constraints in a topology where several peripheral nodes are arranged in tandem. Each node receives an observation and transmits a message to its successor, and the last node then decides which hypothesis is true. We assume that the observations at different nodes are, conditioned on the true hypothesis, independent and the channel between any two successive nodes is considered error-free but rate-constrained. We propose a cyclic numerical design algorithm for the design of nodes using a person-by-person methodology with the minimum expected error probability as a design criterion, where the number of communicated messages is not necessarily equal to the number of hypotheses. The number of peripheral nodes in the proposed method is in principle arbitrary and the information rate constraints are satisfied by quantizing the input of each node. The performance of the proposed method for different information rate constraints, in a binary hypothesis test, is compared to the optimum rate-one solution due to Swaszek and a method proposed by Cover, and it is shown numerically that increasing the channel rate can significantly enhance the performance of the tandem network. Simulation results for $M$-ary hypothesis tests also show that by increasing the channel rates the performance of the tandem network significantly improves

Performance Bounds for Finite Moving Average Change Detection: Application to Global Navigation Satellite Systems

Due to the widespread deployment of Global Navigation Satellite Systems (GNSSs) for critical road or urban applications, one of the major challenges to be solved is the provision of integrity to terrestrial environments, so that GNSS may be safety used in these applications. To do so, the integrity of the received GNSS signal must be analyzed in order to detect some local effect disturbing the received signal. This is desirable because the presence of some local effect may cause large position errors, and hence compromise the signal integrity. Moreover, the detection of such disturbing effects must be done before some pre-established delay. This kind of detection lies within the field of transient change detection. In this work, a finite moving average stopping time is proposed in order to approach the signal integrity problem with a transient change detection framework. The statistical performance of this stopping time is investigated and compared, in the context of multipath detection, to other different methods available in the literature. Numerical results are presented in order to assess their performance.Comment: 12 pages, 2 figures, transaction paper, IEEE Transaction on Signal Processing, 201

A fast Bayesian approach to discrete object detection in astronomical datasets - PowellSnakes I

A new fast Bayesian approach is introduced for the detection of discrete objects immersed in a diffuse background. This new method, called PowellSnakes, speeds up traditional Bayesian techniques by: i) replacing the standard form of the likelihood for the parameters characterizing the discrete objects by an alternative exact form that is much quicker to evaluate; ii) using a simultaneous multiple minimization code based on Powell's direction set algorithm to locate rapidly the local maxima in the posterior; and iii) deciding whether each located posterior peak corresponds to a real object by performing a Bayesian model selection using an approximate evidence value based on a local Gaussian approximation to the peak. The construction of this Gaussian approximation also provides the covariance matrix of the uncertainties in the derived parameter values for the object in question. This new approach provides a speed up in performance by a factor of `hundreds' as compared to existing Bayesian source extraction methods that use MCMC to explore the parameter space, such as that presented by Hobson & McLachlan. We illustrate the capabilities of the method by applying to some simplified toy models. Furthermore PowellSnakes has the advantage of consistently defining the threshold for acceptance/rejection based on priors which cannot be said of the frequentist methods. We present here the first implementation of this technique (Version-I). Further improvements to this implementation are currently under investigation and will be published shortly. The application of the method to realistic simulated Planck observations will be presented in a forthcoming publication.Comment: 30 pages, 15 figures, revised version with minor changes, accepted for publication in MNRA