Neural network-based H∞ filtering for nonlinear systems with time-delays

A novel H∞ design methodology for a neural network-based nonlinear filtering scheme is addressed. Firstly, neural networks are employed to approximate the nonlinearities. Next, the nonlinear dynamic system is represented by the mode-dependent linear difference inclusion （LDI）. Finally, based on the LDI model, a neural network-based nonlinear filter （NNBNF） is developed to minimize the upper bound of H∞ gain index of the estimation error under some linear matrix inequality （LMI） constraints. Compared with the existing nonlinear filters, NNBNF is time-invariant and numerically tractable. The validity and applicability of the proposed approach are successfully demonstrated in an illustrative example.

Non-fragile H∞ Filtering for Discrete-time Systems with Finite Word Length Consideration

过滤有限的词长度(FWL ) 为线性分离时间的系统影响的问题的 nonfragile H 在这份报纸被调查。要设计的过滤器被假定与添加剂获得变化，它在过滤器实现上反映 FWL 效果。结构化的顶点隔板的一个观点被建议处理这个问题并且利用了以一套线性矩阵不平等(LMI ) 为 nonfragile H 过滤器设计开发足够的条件。设计使扩充系统变为 asymptotically 稳定并且保证 H 变细水平不到规定水平。一个数字例子被给说明建议方法的效果。

Delay-dependent decentralized H_∞ filtering for uncertain interconnected systems

This article considers delay dependent decentralized H∞ filtering for a class of uncertain interconnected systems, where the uncertainties are assumed to be time varying and satisfy the norm-bounded conditions. First, combining the Lyapunov-Krasovskii functional approach and the delay integral inequality of matrices, a sufficient condition of the existence of the robust decentralized H∞ filter is derived, which makes the error systems asymptotically stable and satisfies the H∞ norm of the transfer function from noise input to error output less than the specified up-bound on the basis of the form of uncertainties. Then, the above sufficient condition is transformed to a system of easily solvable LMIs via a series of equivalent transformation. Finally, the numerical simulation shows the efficiency of the main results.

Robust H_∞ filtering for discrete-time systems with Markovian switching and time-delays

The robust H∞ filtering problem for uncertain discrete-time Markovian jump linear systems with mode- dependent time-delays is investigated. Attention is focused on designing a Markovian jump linear filter that ensures robust stochastic stability while achieving a prescribed H∞ performance level of the resulting filtering error system, for all admissible uncertainties. The key features of the approach include the introduction of a new type of stochastic Lyapunov functional and some free weighting matrix variables. Sufficient conditions for the solvability of this problem are obtained in terms of a set of linear matrix inequalities. Numerical examples are provided to demonstrate the reduced conservatism of the proposed approach.

Robust H_∞ filtering for discrete-time impulsive systems with uncertainty

This paper investigates robust filter design for linear discrete-time impulsive systems with uncertainty under H∞ performance. First, an impulsive linear filter and a robust H∞ filtering problem are introduced for a discrete-time impulsive systems. Then, a sufficient condition of asymptotical stability and H∞ performance for the filtering error systems are provided by the discrete-time Lyapunov function method. The filter gains can be obtained by solving a set of linear matrix inequalities （LMIs）. Finally, a numerical example is presented to show effectiveness of the obtained result.

Nonlinear H_∞ filtering for interconnected Markovian jump systems

The problem of nonlinear H∞ filtering for interconnected Markovian jump systems is discussed. The aim of this note is the design of a nonlinear Markovian jump filter such that the resulting error system is exponentially meansquare stable and ensures a prescribed H∞ performance. A sufficient condition for the solvability of this problem is given in terms of linear matrix inequalities（LMIs）. A simulation example is presented to demonstrate the effectiveness of the proposed design approach.

Krein space approach to robust H_∞ filtering for linear uncertain systems

A novel Krein space approach to robust H∞ filtering for linear uncertain systems is developed. The parameter uncertainty, entering into both states and measurement equations, satisfies an energy-type constraint. Then a Krein space approach is used to tackle the robust H∞ filtering problem. To this end, a new Krein space formal system is designed according to the original sum quadratic constraint （SQC） without introducing any nonzero factors into it and, consequently, the estimate recursion is obtained through the filter gain in Krein space. Finally, a numerical example is given to demonstrate the effectiveness of the proposed approach.

Robust H_∞ filtering for neutral jump system with time-delays and uncertainties

The problem of robust H∞ filtering for a class of neutral jump systems with time-delay and norm- bounded uncertainties is considered. By re-constructing the system, the dynamics of overall augmented error systems is obtained which involves unknown inputs represented by disturbances, model uncertainties and time-delays. As to the nominal system, sufficient conditions are provided for the existence of the mode-dependent H∞ filter by selecting the appropriate Lyapunov-Krasovskii function and the robust H∞ filter is proposed for the jump system while considering the time-delays and uncertainties. Both of above conditions for the existence of the H∞ filter and roust H∞ filter are presented in terms of linear matrix inequalities, and convex optimization problems are formulated to design the desired filters. By employing the proposed mode-dependent H∞ filter, the systems have the stochastic stability and better ability of restraining disturbances stochastically, and the given prescribed H∞ performance is guaranteed. Simulation resuhs illustrate the effectiveness of developed techniques.

Improved Parameter-dependent H_∞ Filtering for Polytopic Delta Operator Systems

The problem of H∞ filtering for polytopic Delta operator linear systems is investigated. An improved H∞ performance criterion is presented based on the bounded real lemma. Upon the improved performance criterion, a sufficient condition for the existence of parameter-dependent H∞ filtering is derived in terms of linear matrix inequalities. The designed filter can be obtained from the solution of a convex optimization problem. The filter design makes full use of the parameter-dependent approach, which leads to a less conservative result than conventional design methods. A numerical example is given to illustrate the effectiveness of the proposed approach.

A Novel Clutter Suppression Algorithm for Low-Slow-Small Targets Detecting Based on Sparse Adaptive Filtering

Passive detection of low-slow-small(LSS)targets is easily interfered by direct signal and multipath clutter,and the traditional clutter suppression method has the contradiction between step size and convergence rate.In this paper,a frequency domain clutter suppression algorithm based on sparse adaptive filtering is proposed.The pulse compression operation between the error signal and the input reference signal is added to the cost function as a sparsity constraint,and the criterion for filter weight updating is improved to obtain a purer echo signal.At the same time,the step size and penalty factor are brought into the adaptive iteration process,and the input data is used to drive the adaptive changes of parameters such as step size.The proposed algorithm has a small amount of calculation,which improves the robustness to parameters such as step size,reduces the weight error of the filter and has a good clutter suppression performance.

Nonlinear Filtering With Sample-Based Approximation Under Constrained Communication:Progress, Insights and Trends

The nonlinear filtering problem has enduringly been an active research topic in both academia and industry due to its ever-growing theoretical importance and practical significance.The main objective of nonlinear filtering is to infer the states of a nonlinear dynamical system of interest based on the available noisy measurements. In recent years, the advance of network communication technology has not only popularized the networked systems with apparent advantages in terms of installation,cost and maintenance, but also brought about a series of challenges to the design of nonlinear filtering algorithms, among which the communication constraint has been recognized as a dominating concern. In this context, a great number of investigations have been launched towards the networked nonlinear filtering problem with communication constraints, and many samplebased nonlinear filters have been developed to deal with the highly nonlinear and/or non-Gaussian scenarios. The aim of this paper is to provide a timely survey about the recent advances on the sample-based networked nonlinear filtering problem from the perspective of communication constraints. More specifically, we first review three important families of sample-based filtering methods known as the unscented Kalman filter, particle filter,and maximum correntropy filter. Then, the latest developments are surveyed with stress on the topics regarding incomplete/imperfect information, limited resources and cyber security.Finally, several challenges and open problems are highlighted to shed some lights on the possible trends of future research in this realm.

Recursive Filtering for Stochastic Systems With Filter-and-Forward Successive Relays

In this paper,the recursive filtering problem is considered for stochastic systems over filter-and-forward successive relay(FFSR)networks.An FFSR is located between the sensor and the remote filter to forward the measurement.In the successive relay,two cooperative relay nodes are adopted to forward the signals alternatively,thereby existing switching characteristics and inter-relay interferences(IRI).Since the filter-and-forward scheme is employed,the signal received by the relay is retransmitted after it passes through a linear filter.The objective of the paper is to concurrently design optimal recursive filters for FFSR and stochastic systems against switching characteristics and IRI of relays.First,a uniform measurement model is proposed by analyzing the transmission mechanism of FFSR.Then,novel filter structures with switching parameters are constructed for both FFSR and stochastic systems.With the help of the inductive method,filtering error covariances are presented in the form of coupled difference equations.Next,the desired filter gain matrices are further obtained by minimizing the trace of filtering error covariances.Moreover,the stability performance of the filtering algorithm is analyzed where the uniform bound is guaranteed on the filtering error covariance.Finally,the effectiveness of the proposed filtering method over FFSR is verified by a three-order resistance-inductance-capacitance circuit system.

Bayesian Filtering for High-Dimensional State-Space Models With State Partition and Error Compensation

In the era of exponential growth of data availability,the architecture of systems has a trend toward high dimensionality,and directly exploiting holistic information for state inference is not always computationally affordable.This paper proposes a novel Bayesian filtering algorithm that considers algorithmic computational cost and estimation accuracy for high-dimensional linear systems.The high-dimensional state vector is divided into several blocks to save computation resources by avoiding the calculation of error covariance with immense dimensions.After that,two sequential states are estimated simultaneously by introducing an auxiliary variable in the new probability space,mitigating the performance degradation caused by state segmentation.Moreover,the computational cost and error covariance of the proposed algorithm are analyzed analytically to show its distinct features compared with several existing methods.Simulation results illustrate that the proposed Bayesian filtering can maintain a higher estimation accuracy with reasonable computational cost when applied to high-dimensional linear systems.

3D robust anisotropic diffusion filtering algorithm for sparse view neutron computed tomography 3D image reconstruction

The most critical part of a neutron computed tomography(NCT) system is the image processing algorithm,which directly affects the quality and speed of the reconstructed images.Various types of noise in the system can degrade the quality of the reconstructed images.Therefore,to improve the quality of the reconstructed images of NCT systems,efficient image processing algorithms must be used.The anisotropic diffusion filtering(ADF) algorithm can not only effectively suppress the noise in the projection data,but also preserve the image edge structure information by reducing the diffusion at the image edges.Therefore,we propose the application of the ADF algorithm for NCT image reconstruction.To compare the performance of different algorithms in NCT systems,we reconstructed images using the ordered subset simultaneous algebraic reconstruction technique(OS-SART) algorithm with different regular terms as image processing algorithms.In the iterative reconstruction,we selected two image processing algorithms,the Total Variation and split Bregman solved total variation algorithms,for comparison with the performance of the ADF algorithm.Additionally,the filtered back-projection algorithm was used for comparison with an iterative algorithm.By reconstructing the projection data of the numerical and clock models,we compared and analyzed the effects of each algorithm applied in the NCT system.Based on the reconstruction results,OS-SART-ADF outperformed the other algorithms in terms of denoising,preserving the edge structure,and suppressing artifacts.For example,when the 3D Shepp–Logan was reconstructed at 25 views,the root mean square error of OS-SART-ADF was the smallest among the four iterative algorithms,at only 0.0292.The universal quality index,mean structural similarity,and correlation coefficient of the reconstructed image were the largest among all algorithms,with values of 0.9877,0.9878,and 0.9887,respectively.

CRBFT:A Byzantine Fault-Tolerant Consensus Protocol Based on Collaborative Filtering Recommendation for Blockchains

Blockchain has been widely used in finance,the Internet of Things(IoT),supply chains,and other scenarios as a revolutionary technology.Consensus protocol plays a vital role in blockchain,which helps all participants to maintain the storage state consistently.However,with the improvement of network environment complexity and system scale,blockchain development is limited by the performance,security,and scalability of the consensus protocol.To address this problem,this paper introduces the collaborative filtering mechanism commonly used in the recommendation system into the Practical Byzantine Fault Tolerance(PBFT)and proposes a Byzantine fault-tolerant(BFT)consensus protocol based on collaborative filtering recommendation(CRBFT).Specifically,an improved collaborative filtering recommendation method is designed to use the similarity between a node’s recommendation opinions and those of the recommender as a basis for determining whether to adopt the recommendation opinions.This can amplify the recommendation voice of good nodes,weaken the impact of cunningmalicious nodes on the trust value calculation,andmake the calculated resultsmore accurate.In addition,the nodes are given voting power according to their trust value,and a weight randomelection algorithm is designed and implemented to reduce the risk of attack.The experimental results show that CRBFT can effectively eliminate various malicious nodes and improve the performance of blockchain systems in complex network environments,and the feasibility of CRBFT is also proven by theoretical analysis.

Multiple Matching Attenuation Based on Curvelet Domain Extended Filtering

The paper develops a multiple matching attenuation method based on extended filtering in the curvelet domain,which combines the traditional Wiener filtering method with the matching attenuation method in curvelet domain.Firstly,the method uses the predicted multiple data to generate the Hilbert transform records,time derivative records and time derivative records of Hilbert transform.Then,the above records are transformed into the curvelet domain and multiple matching attenuation based on least squares extended filtering is performed.Finally,the attenuation results are transformed back into the time-space domain.Tests on the model data and field data show that the method proposed in the paper effectively suppress the multiples while preserving the primaries well.Furthermore,it has higher accuracy in eliminating multiple reflections,which is more suitable for the multiple attenuation tasks in the areas with complex structures compared to the time-space domain extended filtering method and the conventional curvelet transform method.

Accurate method based on data filtering for quantitative multi-element analysis of soils using CF-LIBS

To obtain more stable spectral data for accurate quantitative analysis of multi-element,especially for the large-area in-situ elements detection of soils, we propose a method for a multielement quantitative analysis of soils using calibration-free laser-induced breakdown spectroscopy(CF-LIBS) based on data filtering. In this study, we analyze a standard soil sample doped with two heavy metal elements, Cu and Cd, with a specific focus on the line of Cu I324.75 nm for filtering the experimental data of multiple sample sets. Pre-and post-data filtering,the relative standard deviation for Cu decreased from 30% to 10%, The limits of detection(LOD)values for Cu and Cd decreased by 5% and 4%, respectively. Through CF-LIBS, a quantitative analysis was conducted to determine the relative content of elements in soils. Using Cu as a reference, the concentration of Cd was accurately calculated. The results show that post-data filtering, the average relative error of the Cd decreases from 11% to 5%, indicating the effectiveness of data filtering in improving the accuracy of quantitative analysis. Moreover, the content of Si, Fe and other elements can be accurately calculated using this method. To further correct the calculation, the results for Cd was used to provide a more precise calculation. This approach is of great importance for the large-area in-situ heavy metals and trace elements detection in soil, as well as for rapid and accurate quantitative analysis.

Electrically controllable spin filtering in zigzag phosphorene nanoribbon based normal–antiferromagnet–normal junctions

We investigated the electric controllable spin-filtering effect in a zigzag phosphorene nanoribbon(ZPNR) based normal–antiferromagnet–normal junction. Two ferromagnets are closely coupled to the edges of the nanoribbon and form the edge-to-edge antiferromagnetism. Under an in-plane electric field, the two degenerate edge bands of the edge-to-edge antiferromagnet split into four spin-polarized sub-bands and a 100% spin-polarized current can be easily induced with the maximal conductance 2e~2/h. The spin polarization changes with the strength of the electric field and the exchange field,and changes sign at opposite electric fields. The spin-polarized current switches from one edge to the other by reversing the direction of the electric field. The edge current can also be controlled spatially by changing the electric potential of the scattering region. The manipulation of edge current is useful in spin-transfer-torque magnetic random-access memory and provides a practical way to develop controllable spintronic devices.

Research on Collaborative Filtering Recommendation Algorithm Based on Improved User Portraits

With the arrival of the big data era,the phenomenon of information overload is becoming increasingly severe.In response to the common issue of sparse user rating matrices in recommendation systems,a collaborative filtering recommendation algorithm was proposed based on improved user profiles in this study.Firstly,a profile labeling system was constructed based on user characteristics.This study proposed that user profile labels should be created using basic user information and basic item information,in order to construct multidimensional user profiles.TF-IDF algorithm was used to determine the weights of user-item feature labels.Secondly,user similarity was calculated by weighting both profile-based collaborative filtering and user-based collaborative filtering algorithms,and the final user similarity was obtained by harmonizing these weights.Finally,personalized recommendations were generated using Top-N method.Validation with the MovieLens-1M dataset revealed that this algorithm enhances both recommendation Precision and Recall compared to single-method approaches(recommendation algorithm based on user portrait and user-based collaborative filtering algorithm).