Set-Membership Filtering Subject to Impulsive Measurement Outliers: A Recursive Algorithm
نویسندگان
چکیده
This paper is concerned with the set-membership filtering problem for a class of linear time-varying systems norm-bounded noises and impulsive measurement outliers. A new representation proposed to model outlier by an signal whose minimum interval length (i.e., duration between two adjacent signals) norm norms all are larger than certain thresholds that adjustable according engineering practice. In order guarantee satisfactory performance, so-called parameter-dependent filter put forward capable generating ellipsoidal region containing true system state. First, novel detection strategy developed, based on dedicatedly constructed input-output model, examine whether received corrupted outlier. Then, through outcome detection, gain matrix desired corresponding calculated solving recursive difference equations. Furthermore, ultimate boundedness issue thoroughly investigated. Finally, simulation example provided demonstrate effectiveness our strategy.
منابع مشابه
Unsupervised robust recursive least-squares algorithm for impulsive noise filtering
A robust recursive least-squares (RLS) adaptive filter against impulsive noise is proposed for the situation of an unknown desired signal. By minimizing a saturable nonlinear constrained unsupervised cost function instead of the conventional least-squares function, a possible impulse-corrupted signal is prevented from entering the filter’s weight updating scheme. Moreover, a multi-step adaptive...
متن کاملSet-Membership Conjugate Gradient Constrained Adaptive Filtering Algorithm for Beamforming
We introduce a new linearly constrained minimum variance (LCMV) beamformer that combines the set-membership (SM) technique with the conjugate gradient (CG) method, and develop a low-complexity adaptive filtering algorithm for beamforming. The proposed algorithm utilizes a CG-based vector and a variable forgetting factor to perform the dataselective updates that are controlled by a time-varying ...
متن کاملSmart: a Toolbox for Set-membership Filtering
Sridhar Gollamudi Shirish Nagaraj Yih-Fang Huang Laboratory for Image and Signal Analysis Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 E-mail: [email protected] Abstract | This paper presents the concept of SetMembership Filtering (SMF), an extension of SetMembership Identi cation (SMI) theory to the general ltering problem. A toolbox of adaptive solutions cal...
متن کاملKalman Filtering Algorithm in Presence of Outliers
A Kalman Filtering algorithm which is robust to observational outliers is developed by assuming that the measurement error may come from either one of two normal distributions and that transition between these distribution is governed by a Markov Chain. The state estimate is obtained as a weighted average of the estimates from the two parallel filters where the weights are the posterior probabi...
متن کاملA constraint selection technique for recursive set membership identification
Recursive approximation of the set of feasible parameters is a key problem in set membership identification. In this paper a new technique is presented, aimed at recursively computing an outer orthotopic approximation of polytopic feasible parameter sets. The main idea is to exploit the concept of binding constraints in linear programs, in order to select a limited number of constraints providi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/CAA Journal of Automatica Sinica
سال: 2021
ISSN: ['2329-9274', '2329-9266']
DOI: https://doi.org/10.1109/jas.2021.1003826