2016
Míguez, Joaquín; Vázquez, Manuel A
A Proof of Uniform Convergence Over Time for a Distributed Particle Filter Artículo de revista
En: Signal Processing, vol. 122, pp. 152–163, 2016, ISSN: 01651684.
Resumen | Enlaces | BibTeX | Etiquetas: Convergence analysis, Distributed algorithms, Journal, Parallelization, Particle filtering, Wireless Sensor Networks
@article{Miguez2016,
title = {A Proof of Uniform Convergence Over Time for a Distributed Particle Filter},
author = {Joaqu\'{i}n M\'{i}guez and Manuel A V\'{a}zquez},
url = {http://www.sciencedirect.com/science/article/pii/S0165168415004077},
doi = {10.1016/j.sigpro.2015.11.015},
issn = {01651684},
year = {2016},
date = {2016-05-01},
journal = {Signal Processing},
volume = {122},
pages = {152--163},
abstract = {Distributed signal processing algorithms have become a hot topic during the past years. One class of algorithms that have received special attention are particles filters (PFs). However, most distributed PFs involve various heuristic or simplifying approximations and, as a consequence, classical convergence theorems for standard PFs do not hold for their distributed counterparts. In this paper, we analyze a distributed PF based on the non-proportional weight-allocation scheme of Bolic et al (2005) and prove rigorously that, under certain stability assumptions, its asymptotic convergence is guaranteed uniformly over time, in such a way that approximation errors can be kept bounded with a fixed computational budget. To illustrate the theoretical findings, we carry out computer simulations for a target tracking problem. The numerical results show that the distributed PF has a negligible performance loss (compared to a centralized filter) for this problem and enable us to empirically validate the key assumptions of the analysis.},
keywords = {Convergence analysis, Distributed algorithms, Journal, Parallelization, Particle filtering, Wireless Sensor Networks},
pubstate = {published},
tppubtype = {article}
}
2015
Martino, Luca; Elvira, Victor; Luengo, David; Corander, Jukka
An Adaptive Population Importance Sampler: Learning From Uncertainty Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 63, no 16, pp. 4422–4437, 2015, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas: Adaptive importance sampling, adaptive multiple IS, adaptive population importance sampler, AMIS, APIS, Estimation, Importance sampling, IS estimators, iterative estimation, iterative methods, Journal, MC methods, Monte Carlo (MC) methods, Monte Carlo methods, population Monte Carlo, Proposals, Signal processing algorithms, simple temporal adaptation, Sociology, Standards, Wireless sensor network, Wireless Sensor Networks
@article{Martino2015bbb,
title = {An Adaptive Population Importance Sampler: Learning From Uncertainty},
author = {Luca Martino and Victor Elvira and David Luengo and Jukka Corander},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7117437},
doi = {10.1109/TSP.2015.2440215},
issn = {1053-587X},
year = {2015},
date = {2015-08-01},
journal = {IEEE Transactions on Signal Processing},
volume = {63},
number = {16},
pages = {4422--4437},
publisher = {IEEE},
abstract = {Monte Carlo (MC) methods are well-known computational techniques, widely used in different fields such as signal processing, communications and machine learning. An important class of MC methods is composed of importance sampling (IS) and its adaptive extensions, such as population Monte Carlo (PMC) and adaptive multiple IS (AMIS). In this paper, we introduce a novel adaptive and iterated importance sampler using a population of proposal densities. The proposed algorithm, named adaptive population importance sampling (APIS), provides a global estimation of the variables of interest iteratively, making use of all the samples previously generated. APIS combines a sophisticated scheme to build the IS estimators (based on the deterministic mixture approach) with a simple temporal adaptation (based on epochs). In this way, APIS is able to keep all the advantages of both AMIS and PMC, while minimizing their drawbacks. Furthermore, APIS is easily parallelizable. The cloud of proposals is adapted in such a way that local features of the target density can be better taken into account compared to single global adaptation procedures. The result is a fast, simple, robust, and high-performance algorithm applicable to a wide range of problems. Numerical results show the advantages of the proposed sampling scheme in four synthetic examples and a localization problem in a wireless sensor network.},
keywords = {Adaptive importance sampling, adaptive multiple IS, adaptive population importance sampler, AMIS, APIS, Estimation, Importance sampling, IS estimators, iterative estimation, iterative methods, Journal, MC methods, Monte Carlo (MC) methods, Monte Carlo methods, population Monte Carlo, Proposals, Signal processing algorithms, simple temporal adaptation, Sociology, Standards, Wireless sensor network, Wireless Sensor Networks},
pubstate = {published},
tppubtype = {article}
}
2010
Perez-Cruz, Fernando; Kulkarni, S R
Robust and Low Complexity Distributed Kernel Least Squares Learning in Sensor Networks Artículo de revista
En: IEEE Signal Processing Letters, vol. 17, no 4, pp. 355–358, 2010, ISSN: 1070-9908.
Resumen | Enlaces | BibTeX | Etiquetas: communication complexity, Consensus, distributed learning, kernel methods, learning (artificial intelligence), low complexity distributed kernel least squares le, message passing, message-passing algorithms, robust nonparametric statistics, sensor network learning, sensor networks, telecommunication computing, Wireless Sensor Networks
@article{Perez-Cruz2010,
title = {Robust and Low Complexity Distributed Kernel Least Squares Learning in Sensor Networks},
author = {Fernando Perez-Cruz and S R Kulkarni},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5395679},
issn = {1070-9908},
year = {2010},
date = {2010-01-01},
journal = {IEEE Signal Processing Letters},
volume = {17},
number = {4},
pages = {355--358},
abstract = {We present a novel mechanism for consensus building in sensor networks. The proposed algorithm has three main properties that make it suitable for sensor network learning. First, the proposed algorithm is based on robust nonparametric statistics and thereby needs little prior knowledge about the network and the function that needs to be estimated. Second, the algorithm uses only local information about the network and it communicates only with nearby sensors. Third, the algorithm is completely asynchronous and robust. It does not need to coordinate the sensors to estimate the underlying function and it is not affected if other sensors in the network stop working. Therefore, the proposed algorithm is an ideal candidate for sensor networks deployed in remote and inaccessible areas, which might need to change their objective once they have been set up.},
keywords = {communication complexity, Consensus, distributed learning, kernel methods, learning (artificial intelligence), low complexity distributed kernel least squares le, message passing, message-passing algorithms, robust nonparametric statistics, sensor network learning, sensor networks, telecommunication computing, Wireless Sensor Networks},
pubstate = {published},
tppubtype = {article}
}
2009
Lazaro, Marcelino; Sanchez-Fernandez, Matilde; Artés-Rodríguez, Antonio
Optimal Sensor Selection in Binary Heterogeneous Sensor Networks Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 57, no 4, pp. 1577–1587, 2009, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas: binary heterogeneous sensor networks, discrimination performance, Energy scaling, object detection, optimal sensor selection, performance-cost ratio, sensor networks, sensor selection, symmetric Kullback-Leibler divergence, target detection problem, Wireless Sensor Networks
@article{Lazaro2009bb,
title = {Optimal Sensor Selection in Binary Heterogeneous Sensor Networks},
author = {Marcelino Lazaro and Matilde Sanchez-Fernandez and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4749309},
issn = {1053-587X},
year = {2009},
date = {2009-01-01},
journal = {IEEE Transactions on Signal Processing},
volume = {57},
number = {4},
pages = {1577--1587},
abstract = {We consider the problem of sensor selection in a heterogeneous sensor network when several types of binary sensors with different discrimination performance and costs are available. We want to analyze what is the optimal proportion of sensors of each class in a target detection problem when a total cost constraint is specified. We obtain the conditional distributions of the observations at the fusion center given the hypotheses, necessary to perform an optimal hypothesis test in this heterogeneous scenario. We characterize the performance of the tests by means of the symmetric Kullback-Leibler divergence, or J -divergence, applied to the conditional distributions under each hypothesis. By formulating the sensor selection as a constrained maximization problem, and showing the linearity of the J-divergence with the number of sensors of each class, we found that the optimal proportion of sensors is ldquowinner takes allrdquo like. The sensor class with the best performance/cost ratio is selected.},
keywords = {binary heterogeneous sensor networks, discrimination performance, Energy scaling, object detection, optimal sensor selection, performance-cost ratio, sensor networks, sensor selection, symmetric Kullback-Leibler divergence, target detection problem, Wireless Sensor Networks},
pubstate = {published},
tppubtype = {article}
}