3,859 research outputs found
Conservative Signal Processing Architectures For Asynchronous, Distributed Optimization Part II: Example Systems
This paper provides examples of various synchronous and asynchronous signal
processing systems for performing optimization, utilizing the framework and
elements developed in a preceding paper. The general strategy in that paper was
to perform a linear transformation of stationarity conditions applicable to a
class of convex and nonconvex optimization problems, resulting in algorithms
that operate on a linear superposition of the associated primal and dual
decision variables. The examples in this paper address various specific
optimization problems including the LASSO problem, minimax-optimal filter
design, the decentralized training of a support vector machine classifier, and
sparse filter design for acoustic equalization. Where appropriate, multiple
algorithms for solving the same optimization problem are presented,
illustrating the use of the underlying framework in designing a variety of
distinct classes of algorithms. The examples are accompanied by numerical
simulation and a discussion of convergence
Information Extraction Under Privacy Constraints
A privacy-constrained information extraction problem is considered where for
a pair of correlated discrete random variables governed by a given
joint distribution, an agent observes and wants to convey to a potentially
public user as much information about as possible without compromising the
amount of information revealed about . To this end, the so-called {\em
rate-privacy function} is introduced to quantify the maximal amount of
information (measured in terms of mutual information) that can be extracted
from under a privacy constraint between and the extracted information,
where privacy is measured using either mutual information or maximal
correlation. Properties of the rate-privacy function are analyzed and
information-theoretic and estimation-theoretic interpretations of it are
presented for both the mutual information and maximal correlation privacy
measures. It is also shown that the rate-privacy function admits a closed-form
expression for a large family of joint distributions of . Finally, the
rate-privacy function under the mutual information privacy measure is
considered for the case where has a joint probability density function
by studying the problem where the extracted information is a uniform
quantization of corrupted by additive Gaussian noise. The asymptotic
behavior of the rate-privacy function is studied as the quantization resolution
grows without bound and it is observed that not all of the properties of the
rate-privacy function carry over from the discrete to the continuous case.Comment: 55 pages, 6 figures. Improved the organization and added detailed
literature revie
Gain-constrained recursive filtering with stochastic nonlinearities and probabilistic sensor delays
This is the post-print of the Article. The official published version can be accessed from the link below - Copyright @ 2013 IEEE.This paper is concerned with the gain-constrained recursive filtering problem for a class of time-varying nonlinear stochastic systems with probabilistic sensor delays and correlated noises. The stochastic nonlinearities are described by statistical means that cover the multiplicative stochastic disturbances as a special case. The phenomenon of probabilistic sensor delays is modeled by introducing a diagonal matrix composed of Bernoulli distributed random variables taking values of 1 or 0, which means that the sensors may experience randomly occurring delays with individual delay characteristics. The process noise is finite-step autocorrelated. The purpose of the addressed gain-constrained filtering problem is to design a filter such that, for all probabilistic sensor delays, stochastic nonlinearities, gain constraint as well as correlated noises, the cost function concerning the filtering error is minimized at each sampling instant, where the filter gain satisfies a certain equality constraint. A new recursive filtering algorithm is developed that ensures both the local optimality and the unbiasedness of the designed filter at each sampling instant which achieving the pre-specified filter gain constraint. A simulation example is provided to illustrate the effectiveness of the proposed filter design approach.This work was supported in part by the National Natural Science Foundation of China by Grants 61273156, 61028008, 60825303, 61104125, and 11271103, National 973 Project by Grant 2009CB320600, the Fok Ying Tung Education Fund by Grant 111064, the Special Fund for the Author of National Excellent Doctoral Dissertation of China by Grant 2007B4, the State Key Laboratory of Integrated Automation for the Process Industry (Northeastern University) of China, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. by Grant GR/S27658/01, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany
Robust H∞ filtering for markovian jump systems with randomly occurring nonlinearities and sensor saturation: The finite-horizon case
This article is posted with the permission of IEEE - Copyright @ 2011 IEEEThis paper addresses the robust H∞ filtering problem for a class of discrete time-varying Markovian jump systems with randomly occurring nonlinearities and sensor saturation. Two kinds of transition probability matrices for the Markovian process are considered, namely, the one with polytopic uncertainties and the one with partially unknown entries. The nonlinear disturbances are assumed to occur randomly according to stochastic variables satisfying the Bernoulli distributions. The main purpose of this paper is to design a robust filter, over a given finite-horizon, such that the H∞ disturbance attenuation level is guaranteed for the time-varying Markovian jump systems in the presence of both the randomly occurring nonlinearities and the sensor saturation. Sufficient conditions are established for the existence of the desired filter satisfying the H∞ performance constraint in terms of a set of recursive linear matrix inequalities. Simulation results demonstrate the effectiveness of the developed filter design scheme.This work was supported in part by the National Natural Science Foundation
of China under Grants 61028008, 60825303, and 61004067, National 973 Project under Grant 2009CB320600, the Key Laboratory of Integrated Automation for the Process Industry (Northeastern University) from the Ministry of Education of China, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K., under Grant GR/S27658/01, the Royal Society of the
U.K., and the Alexander von Humboldt Foundation of Germany
Robust filtering with randomly varying sensor delay: The finite-horizon case
Copyright [2009] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, we consider the robust filtering problem for discrete time-varying systems with delayed sensor measurement subject to norm-bounded parameter uncertainties. The delayed sensor measurement is assumed to be a linear function of a stochastic variable that satisfies the Bernoulli random binary distribution law. An upper bound for the actual covariance of the uncertain stochastic parameter system is derived and used for estimation variance constraints. Such an upper bound is then minimized over the filter parameters for all stochastic sensor delays and admissible deterministic uncertainties. It is shown that the desired filter can be obtained in terms of solutions to two discrete Riccati difference equations of a form suitable for recursive computation in online applications. An illustrative example is presented to show the applicability of the proposed method
Recent advances on recursive filtering and sliding mode design for networked nonlinear stochastic systems: A survey
Copyright © 2013 Jun Hu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Some recent advances on the recursive filtering and sliding mode design problems for nonlinear stochastic systems with network-induced phenomena are surveyed. The network-induced phenomena under consideration mainly include missing measurements, fading measurements, signal quantization, probabilistic sensor delays, sensor saturations, randomly occurring nonlinearities, and randomly occurring uncertainties. With respect to these network-induced phenomena, the developments on filtering and sliding mode design problems are systematically reviewed. In particular, concerning the network-induced phenomena, some recent results on the recursive filtering for time-varying nonlinear stochastic systems and sliding mode design for time-invariant nonlinear stochastic systems are given, respectively. Finally, conclusions are proposed and some potential future research works are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61329301, 61333012, 61374127 and 11301118, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant no. GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany
Multi-Bernoulli Sensor-Control via Minimization of Expected Estimation Errors
This paper presents a sensor-control method for choosing the best next state
of the sensor(s), that provide(s) accurate estimation results in a multi-target
tracking application. The proposed solution is formulated for a multi-Bernoulli
filter and works via minimization of a new estimation error-based cost
function. Simulation results demonstrate that the proposed method can
outperform the state-of-the-art methods in terms of computation time and
robustness to clutter while delivering similar accuracy
- …