Resilient State Estimation for 2-D Time-Varying Systems With Redundant Channels: A Variance-Constrained Approach

A resilient outlier-resistant recursive filtering approach to time-delayed spatial-temporal systems with energy harvesting sensors

This paper is concerned with a resilient outlier-resistant recursive filtering problem for a class of time-delayed spatial-temporal systems (STSs) with energy harvesting sensors. We consider a situation that the sensors are able to harvest energy from external environments and consume certain energy when the measurements are transmitted to filters. When the energy of the sensor is insufficient to maintain the normal communication between the sensors and the filters, the measurement will be regarded as missing. For the sake of obtaining a satisfactory filtering performance, the innovations influenced by the measurement outliers is constrained by introducing a saturation function in the filter. Furthermore, the resilient issue of the designed recursive filter is considered to resist the fluctuations of the filter parameters. Under the effects of sensor energy constraints, measurement outliers as well as parameter fluctuations, a resilient outlier-resistant recursive filter is designed where an upper bound (UB) is first obtained on the filtering error covariance (FEC). Then, by resorting to a matrix recursive equation, such a UB is minimized by the filter gain matrix. Finally, we exhibit a numerical example to verify the effectiveness of the proposed resilient outlier-resistant recursive filter scheme for time-delayed STSs.

Locally Minimum-Variance Filtering of 2-D Systems Over Sensor Networks With Measurement Degradations: A Distributed Recursive Algorithm

This article tackles the recursive filtering problem for an array of 2-D systems over sensor networks with a given topology. Both the measurement degradations of the network outputs and the stochastic perturbations of network couplings are modeled to reflect engineering practice by introducing some random variables with given statistics. The goal of the addressed problem is to devise the distributed recursive filters capable of cooperatively estimating the true state in order to ensure locally minimal upper bound (UB) on the second-order moment of the filtering error (also viewed as the general error variance). For this purpose, the general error variance regarding the underlying target plant is first provided to facilitate the subsequent filter design, and then a certain UB on the error variance is constructed by exploiting the stochastic analysis and the induction approach. Furthermore, in view of the inherent sparsity of the sensor network, the gain parameters of the desired distributed filters are determined, and the proposed recursive filtering algorithm is shown to be scalable. Finally, an illustrative example is given to demonstrate the validity of the established filtering strategy.

Outlier-Resistant Recursive Filtering for Multisensor Multirate Networked Systems Under Weighted Try-Once-Discard Protocol

In this article, a new outlier-resistant recursive filtering problem (RF) is studied for a class of multisensor multirate networked systems under the weighted try-once-discard (WTOD) protocol. The sensors are sampled with a period that is different from the state updating period of the system. In order to lighten the communication burden and alleviate the network congestions, the WTOD protocol is implemented in the sensor-to-filter channel to schedule the order of the data transmission of the sensors. In the case of the measurement outliers, a saturation function is employed in the filter structure to constrain the innovations contaminated by the measurement outliers, thereby maintaining satisfactory filtering performance. By resorting to the solution to a matrix difference equation, an upper bound is first obtained on the covariance of the filtering error, and the gain matrix of the filter is then characterized to minimize the derived upper bound. Furthermore, the exponential boundedness of the filtering error dynamics is analyzed in the mean square sense. Finally, the usefulness of the proposed outlier-resistant RF scheme is verified by simulation examples.

Co-Design of 2-D Event Generator and Sliding Mode Controller for 2-D Roesser Model via Genetic Algorithm

The co-design problem of 2-D event generators and sliding mode controller (SMC) is studied in this article for the discrete-time 2-D Roesser model to reduce the communication usage between the plant and the controller. First, by resorting to the 2-D reaching law conditions, the event-based 2-D SMC schemes are proposed and a kind of horizonal/vertical independent event generator is designed. Then, the stability of the sliding-mode dynamics is analyzed and a nonlinear matrix inequality condition associated with the horizontal/vertical sliding matrices is obtained. In order to solve the derived nonlinear matrix inequality condition without introducing conservatism, a binary genetic algorithm (GA) is applied by considering a multiobjective optimization problem, which reflects the tradeoff between the convergence of the sliding-mode dynamics and the scheduling performance of the designed horizontal/vertical event generators. Finally, a simulation example is exploited to demonstrate the effectiveness of the proposed co-design approach with GA.

Bio-Inspired Representation Learning for Visual Attention Prediction

Visual attention prediction (VAP) is a significant and imperative issue in the field of computer vision. Most of the existing VAP methods are based on deep learning. However, they do not fully take advantage of the low-level contrast features while generating the visual attention map. In this article, a novel VAP method is proposed to generate the visual attention map via bio-inspired representation learning. The bio-inspired representation learning combines both low-level contrast and high-level semantic features simultaneously, which are developed by the fact that the human eye is sensitive to the patches with high contrast and objects with high semantics. The proposed method is composed of three main steps: 1) feature extraction; 2) bio-inspired representation learning; and 3) visual attention map generation. First, the high-level semantic feature is extracted from the refined VGG16, while the low-level contrast feature is extracted by the proposed contrast feature extraction block in a deep network. Second, during bio-inspired representation learning, both the extracted low-level contrast and high-level semantic features are combined by the designed densely connected block, which is proposed to concatenate various features scale by scale. Finally, the weighted-fusion layer is exploited to generate the ultimate visual attention map based on the obtained representations after bio-inspired representation learning. Extensive experiments are performed to demonstrate the effectiveness of the proposed method.

Input-Output Finite-Time Generalized Dissipative Filter of Discrete Time-Varying Systems With Quantization and Adaptive Event-Triggered Mechanism

This article discusses the issue of input-output finite-time generalized dissipative filter design for a class of discrete time-varying systems. First, an adaptive event-triggered mechanism (AETM) with an adaptive law is proposed to adjust the threshold in the AETM according to the error between the system states and the filter states. Such an AETM determines whether the measurement output should be transmitted or not, which is more effective to economize the communication resources comparing with the traditional event-triggered mechanism. Second, in view of network-induced delays, the quantization and the AETM, a time-varying filter error system (TV-FES) is modeled. Then, a new augmented time-varying Lyapunov functional containing triple sum terms is provided. Based on the new finite-sum inequality and improved reciprocally convex combination lemma, delay-dependent conditions are obtained, which can ensure the TV-FES to be input-output finite-time stable and satisfy the given generalized dissipative performance. Moreover, the recursive linear matrix inequalities are presented to obtain the desired filter gains. Finally, numerical examples demonstrate the superiority and feasibility of the proposed method in this article.

Event-Triggered Recursive Filtering for Shift-Varying Linear Repetitive Processes

This paper addresses the recursive filtering problem for shift-varying linear repetitive processes (LRPs) with limited network resources. To reduce the resource occupancy, a novel event-triggered strategy is proposed where the concern is to broadcast those necessary measurements to update the innovation information only when certain events appear. The primary goal of this paper is to design a recursive filter rendering that, under the event-triggered communication mechanism, an upper bound (UB) on the filtering error variance is ensured and then optimized by properly determining the filter gains. As a distinct kind of 2-D systems, the LRPs are cast into a general Fornasini-Marchesini model by using the lifting technique. A new definition of the triggering-shift sequence is introduced and an event-triggered rule is then constructed for the transformed system. With the aid of mathematical induction, the filtering error variance is guaranteed to have a UB which is subsequently optimized with appropriate filter parameters via solving two series of Riccati-like difference equations. Theoretical analysis further reveals the monotonicity of the filtering performance with regard to the event-triggering threshold. Finally, an illustrative simulation is given to show the feasibility of the designed filtering scheme.