• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.592-595
• /
• 1999

In this paper, we propose a unified method to solve the various robust filtering problem for a class of uncertain discrete time systems. Generally, to solve the robust filtering problem, we must convert the convex optimization problem with uncertainty blocks to the uncertainty free convex optimization problem. To do this, we derive the robust matrix inequality problem. This technique involves using constant scaling parameter which can be optimized by solving a linear matrix inequality problem. Therefore, the robust matrix inequality problem does not conservative. The robust filter can be designed by using this robust matrix inequality problem and by considering its solvability conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4684-4705
• /
• 2019

Collaborative filtering recommender systems are vulnerable to shilling attacks in which malicious users may inject biased profiles to promote or demote a particular item being recommended. To tackle this problem, many robust collaborative recommendation methods have been presented. Unfortunately, the robustness of most methods is improved at the expense of prediction accuracy. In this paper, we construct a robust Bayesian probabilistic matrix factorization model for collaborative filtering recommender systems by incorporating the detection of user anomaly rating behaviors. We first detect the anomaly rating behaviors of users by the modified K-means algorithm and target item identification method to generate an indicator matrix of attack users. Then we incorporate the indicator matrix of attack users to construct a robust Bayesian probabilistic matrix factorization model and based on which a robust collaborative recommendation algorithm is devised. The experimental results on the MovieLens and Netflix datasets show that our model can significantly improve the robustness and recommendation accuracy compared with three baseline methods.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1796-1801
• /
• 2009

This paper is concerned with the problem of delay-dependent robust $H_{\infty}$ filtering for uncertain descriptor systems with time-varying delay. The considering uncertainty is convex compact set of polytoic type. The purpose is the design of a linear filter such that the resulting filtering error descriptor system is regular, impulse-free, and asymptotically stable with $H_{\infty}$ norm bound. By establishing a finite sum inequality based on quadratic terms, a new delay-dependent bounded real lemma (BRL) for delayed descriptor systems is derived. Based on the derived BRL, a robust $H_{\infty}$ filter is designed in terms of linear matrix inequaltity (LMI). Numerical examples are given to illustrate the effectiveness of the proposed method.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.185-191
• /
• 2007

Alpha stable distribution is better for modeling impulsive noises than Gaussian distribution in signal processing. This class of process has no closed form of probability density function and finite second order moments. In general, Wiener filter theory is not meaningful in S$\alpha$SG environments because the expectations may be unbounded. We proposed a new adaptive recursive least p-norm Kalman filtering algorithm based on least p-norm of innovation process with infinite variances, and a new robust multiuser detection method based on least p-norm Kalman filtering. The simulation experiments show that the proposed new algorithm is more robust than the conventional Kalman filtering multiuser detection algorithm.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.170-183
• /
• 2007

This paper presents a delay-dependent approach to robust filtering for linear parameter-varying (LPV) systems with discrete and distributed time-invariant delays in the states and outputs. It is assumed that the state-space matrices affinely depend on parameters that are measurable in real-time. Some new parameter-dependent delay-dependent stability conditions are established in terms of linear matrix inequalities (LMIs) such that the filtering process remains asymptotically stable and satisfies a prescribed $H_{\infty}$ performance level. Using polynomially parameter-dependent quadratic (PPDQ) functions and some Lagrange multiplier matrices, we establish the parameter-independent delay-dependent conditions with high precision under which the desired robust $H_{\infty}$ filters exist and derive the explicit expression of these filters. A numerical example is provided to demonstrate the validity of the proposed design approach.

• ETRI Journal
• /
• v.26 no.3
• /
• pp.273-276
• /
• 2004

We propose a novel feature processing technique which can provide a cepstral liftering effect in the log-spectral domain. Cepstral liftering aims at the equalization of variance of cepstral coefficients for the distance-based speech recognizer, and as a result, provides the robustness for additive noise and speaker variability. However, in the popular hidden Markov model based framework, cepstral liftering has no effect in recognition performance. We derive a filtering method in log-spectral domain corresponding to the cepstral liftering. The proposed method performs a high-pass filtering based on the decorrelation of filter-bank energies. We show that in noisy speech recognition, the proposed method reduces the error rate by 52.7% to conventional feature.

• ETRI Journal
• /
• v.28 no.4
• /
• pp.509-512
• /
• 2006

In a real environment, sound recordings are commonly distorted by channel and background noise, and the performance of audio identification is mainly degraded by them. Recently, Philips introduced a robust and efficient audio fingerprinting scheme applying a differential (high-pass filtering) to the frequency-time sequence of the perceptual filter-bank energies. In practice, however, the robustness of the audio fingerprinting scheme is still important in a real environment. In this letter, we introduce alternatives to the frequency-temporal filtering combination for an extension method of Philips' audio fingerprinting scheme to achieve robustness to channel and background noise under the conditions of a real situation. Our experimental results show that the proposed filtering combination improves noise robustness in audio identification.

• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.2
• /
• pp.134-140
• /
• 1999

The robust generalized H2 filtering problem for a class of discrete time uncertain linear systems satisfying the sum quadratic constraints(SQCs) is considered. The objective of this paper is to develop robust stability condition using SQCs and design a robust generalized Ha filter to take place of the existing robust Kalman filter. The robust generalized H2 filter is designed based on newly derived robust stability condition. The robust generalized Ha filter bounds the energy to peak gain from the energy bounded exogenous disturbances to the estimation errors under the given positive scalar ${\gamma}$. Unlike the robust Lalman filter, it does not require any spectral assumptions about the exogenous disturbances . Therefore the robust generalized H2 filter can be considered as a deterministic formulation of the robust Kalman filter. Moreover, the variance of the estimation error obtained by the proposed filter is lower than that by the existing robust Kalman filter. The robustness of the robust generalized H2 filter against the uncertainty and the exogenous signal is illustrated by a simple numerical example.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.2
• /
• pp.83-88
• /
• 2001

The robust linear H(sub)$\infty$ FIR filter, which guarantees a prescribed H(sub)$\infty$ performance, is designed for continuous time-varying systems with unknown cone-bounded nonlinearity. The infinite horizon filtering for time-varying systems is systems is investigated in therms of two Riccati equations by the finite moving horizon.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.3
• /
• pp.466-471
• /
• 2012

In this paper, we consider the problem of a robust passive filtering with low-order for discrete-time singular systems with polytopic uncertainties. A BRL(bounded real lemma) for robust passivity with a dissipativity of discrete-time uncertain singular systems is derived. A low-order robust passive filter design method is proposed by new reduced-order method and LMI(linear matrix inequality) technique on the basis of the obtained BRL. Finally, illustrative examples are presented to show the applicability of the proposed method.