Robust H∞ filtering for networked systems with multiple state delays

This is the post print version of the article. The official published version can be obtained from the link below - Copyright 2007 Taylor & Francis Ltd.In this paper, a new robust H∞ filter design problem is studied for a class of networked systems with multiple state-delays. Two kinds of incomplete measurements, namely, measurements with random delays and measurements with stochastic missing phenomenon, are simultaneously considered. Such incomplete measurements are induced by the limited bandwidth of communication networks, and are modelled as a linear function of a certain set of indicator functions that depend on the same stochastic variable. Attention is focused on the analysis and design problems of a full-order robust H∞ filter such that, for all admissible parameter uncertainties and all possible incomplete measurements, the filtering error dynamics is exponentially mean-square stable and a prescribed H∞ attenuation level is guaranteed. Some recently reported methodologies, such as delay-dependent and parameter-dependent stability analysis approaches, are employed to obtain less conservative results. Sufficient conditions, which are dependent on the occurrence probability of both the random sensor delay and missing measurement, are established for the existence of the desired filters in terms of certain linear matrix inequalities (LMIs). When these LMIs are feasible, the explicit expression of the desired filter can also be characterized. Finally, numerical examples are given to illustrate the effectiveness and applicability of the proposed design method.This work was supported by the National Natural Science Foundation of China under Grant 60574084, the National 863 Project of China under Grant 2006AA04Z428, and the National 973 Program of China under Grant 2002CB312200

Robust H∞ filtering for time-delay systems with probabilistic sensor faults

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, a new robust H∞ filtering problem is investigated for a class of time-varying nonlinear system with norm-bounded parameter uncertainties, bounded state delay, sector-bounded nonlinearity and probabilistic sensor gain faults. The probabilistic sensor reductions are modeled by using a random variable that obeys a specific distribution in a known interval [alpha,beta], which accounts for the following two phenomenon: 1) signal stochastic attenuation in unreliable analog channel and 2) random sensor gain reduction in severe environment. The main task is to design a robust H∞ filter such that, for all possible uncertain measurements, system parameter uncertainties, nonlinearity as well as time-varying delays, the filtering error dynamics is asymptotically mean-square stable with a prescribed H∞ performance level. A sufficient condition for the existence of such a filter is presented in terms of the feasibility of a certain linear matrix inequality (LMI). A numerical example is introduced to illustrate the effectiveness and applicability of the proposed methodology

EAST: An Efficient and Accurate Scene Text Detector

Previous approaches for scene text detection have already achieved promising performances across various benchmarks. However, they usually fall short when dealing with challenging scenarios, even when equipped with deep neural network models, because the overall performance is determined by the interplay of multiple stages and components in the pipelines. In this work, we propose a simple yet powerful pipeline that yields fast and accurate text detection in natural scenes. The pipeline directly predicts words or text lines of arbitrary orientations and quadrilateral shapes in full images, eliminating unnecessary intermediate steps (e.g., candidate aggregation and word partitioning), with a single neural network. The simplicity of our pipeline allows concentrating efforts on designing loss functions and neural network architecture. Experiments on standard datasets including ICDAR 2015, COCO-Text and MSRA-TD500 demonstrate that the proposed algorithm significantly outperforms state-of-the-art methods in terms of both accuracy and efficiency. On the ICDAR 2015 dataset, the proposed algorithm achieves an F-score of 0.7820 at 13.2fps at 720p resolution.Comment: Accepted to CVPR 2017, fix equation (3

Balanced Quantization: An Effective and Efficient Approach to Quantized Neural Networks

Quantized Neural Networks (QNNs), which use low bitwidth numbers for representing parameters and performing computations, have been proposed to reduce the computation complexity, storage size and memory usage. In QNNs, parameters and activations are uniformly quantized, such that the multiplications and additions can be accelerated by bitwise operations. However, distributions of parameters in Neural Networks are often imbalanced, such that the uniform quantization determined from extremal values may under utilize available bitwidth. In this paper, we propose a novel quantization method that can ensure the balance of distributions of quantized values. Our method first recursively partitions the parameters by percentiles into balanced bins, and then applies uniform quantization. We also introduce computationally cheaper approximations of percentiles to reduce the computation overhead introduced. Overall, our method improves the prediction accuracies of QNNs without introducing extra computation during inference, has negligible impact on training speed, and is applicable to both Convolutional Neural Networks and Recurrent Neural Networks. Experiments on standard datasets including ImageNet and Penn Treebank confirm the effectiveness of our method. On ImageNet, the top-5 error rate of our 4-bit quantized GoogLeNet model is 12.7\%, which is superior to the state-of-the-arts of QNNs

Analytical Evaluation of Coverage-Oriented Femtocell Network Deployment

This paper proposes a coverage-oriented femtocell network deployment scheme, in which the femtocell base stations (BSs) can decide whether to be active or inactive depending on their distances from the macrocell BSs. Specifically, as the areas close to the macrocell BSs already have satisfactory cellular coverage, the femtocell BSs located inside such areas are kept to be inactive. Thus, all the active femtocells are located in the poor macrocell coverage areas. Based on a stochastic geometric framework, the coverage probability can be analyzed with tractable results. Surprisingly, the results show that the proposed scheme, although with a lower defacto femtocell density, can achieve better coverage performance than that keeping all femtocells in the entire network to be active. The analytical results further identify the achievable optimal performance of the new scheme, which provides mobile operators a guideline for femtocell deployment and operation.Comment: 6 pages, 7 figures, published in IEEE International Conference on Communications (ICC'13

Robust fault detection for networked systems with distributed sensors

Copyright [2011] 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.This paper is concerned with the robust fault detection problem for a class of discrete-time networked systems with distributed sensors. Since the bandwidth of the communication channel is limited, packets from different sensors may be dropped with different missing rates during the transmission. Therefore, a diagonal matrix is introduced to describe the multiple packet dropout phenomenon and the parameter uncertainties are supposed to reside in a polytope. The aim is to design a robust fault detection filter such that, for all probabilistic packet dropouts, all unknown inputs and admissible uncertain parameters, the error between the residual (generated by the fault detection filter) and the fault signal is made as small as possible. Two parameter-dependent approaches are proposed to obtain less conservative results. The existence of the desired fault detection filter can be determined from the feasibility of a set of linear matrix inequalities that can be easily solved by the efficient convex optimization method. A simulation example on a networked three-tank system is provided to illustrate the effectiveness and applicability of the proposed techniques.This work was supported by national 973 project under Grants 2009CB320602 and 2010CB731800, and the NSFC under Grants 60721003 and 60736026