• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.4
• /
• pp.502-508
• /
• 2014

In this paper, a delay-dependent $H_{\infty}$ filtering problem is investigated for discrete-time delayed nonlinear systems which include a more general sector nonlinear function instead of employing the commonly used Lipschitz-type function. By using the Lyapunov-Krasovskii functional approach, a less conservative sufficient condition is established for the existence of the desired filter, and then, the corresponding solvability condition guarantee the stability of the filter with a prescribed $H_{\infty}$ performance level. Finally, two simulation examples are given to show the effectiveness of the proposed filtering scheme.

• Speech Sciences
• /
• v.1
• /
• pp.277-283
• /
• 1997

In this paper, we present a robust recognition algorithm based on the Wiener filtering method as a research tool to develop the Korean Speech recognition system. We especially used Wiener filtering method in cepstrum-domain, because the method in frequency-domain is computationally expensive and complex. Evaluation of the effectiveness of this method has been conducted in speaker-independent isolated Korean digit recognition tasks using discrete HMM speech recognition systems. In these tasks, we used 12th order weighted cepstral as a feature vector and added computer simulated white gaussian noise of different levels to clean speech signals for recognition experiments under noisy conditions. Experimental results show that the presented algorithm can provide an improvement in recognition of as much as from $5\%\;to\;\20\%$ in comparison to spectral subtraction method.

• Phonetics and Speech Sciences
• /
• v.9 no.2
• /
• pp.103-110
• /
• 2017

The pole filtering concept has been successfully applied to cepstral feature normalization techniques for noise-robust speech recognition. In this paper, it is proposed to apply the pole filtering selectively only to the speech intervals, in order to further improve the recognition performance for short utterances in noisy environments. Experimental results on AURORA 2 task with clean-condition training show that the proposed selectively pole-filtered cepstral mean normalization (SPFCMN) and selectively pole-filtered cepstral mean and variance normalization (SPFCMVN) yield error rate reduction of 38.6% and 45.8%, respectively, compared to the baseline system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1771-1776
• /
• 2003

In mobile robot navigation, one of the key problems is the pose estimation of the mobile robot. Although the odometry can be used to describe the motions of the mobile robots quite simple and accurately, the validities of the models are limited by a number of error sources contaminating the encoder outputs so that applying the conventional extended Kalman filter to these nominal model does not yield the satisfactory performance. As a remedy for this problem, we consider the uncertain nonlinear kinematic model of the mobile robot that contains the norm bounded uncertainties and also propose a new robust extended Kalman filter based on the Krein space approach. The proposed robust filter has the same recursive structure as the conventional extended Kalman filter and can hence be readily designed to effectively account for the uncertainties. The computer simulations will be given to verify the robustness against the parameter variation as well as the reliable performance of the proposed robust filter.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.104-109
• /
• 2002

A new robust Kalman filter is designed for the linear discrete-time system with norm-bounded parametric uncertainties. Sum quadratic constraint, which describes the uncertainties of the system, is converted into an indefinite quadratic form to be minimized in indefinite inner product space. This minimization problem is solved by the new robust Kalman filter. Since the new filter is obtained by simply modifying the conventional Kalman filter, robust filtering scheme can be more readily designed using the proposed method in comparison with the existing robust Kalman filters. A numerical example demonstrates the robustness and the improvement of the proposed filter compared with the existing filters.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.188-188
• /
• 2000

The most important problem in target tracking can be said to be modeling the tracking system correctly. Although the simple linear dynamic equation for this model has used until now, the satisfactory performance could not be obtained owing to uncertainties of the real systems in the case of designing the filters baged on the dynamic equations. In this paper, we propose the extended robust Kalman filter (ERKF) which can be applied to the real target tracking system with the parameter uncertainties. A nonlinear dynamic equation with parameter uncertainties is used to express the uncertain system model mathematically, and a measurement equation is represented by a nonlinear equation to show data from the radar in a Cartesian coordinate frame. To solve the robust nonlinear filtering problem, we derive the extended robust Kalman filter equation using the Krein space approach and sum quadratic constraint. We show the proposed filter has better performance than the existing extended Kalman filter (EKF) via 3-dimensional target tracking example.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.271-287
• /
• 2019

The synchronization scheme based on moving average is robust and suitable for the same rule to be adopted in embedding watermark and synchronization code, but the imperceptibility and search efficiency is seldom reported. The study aims to improve the original scheme for robust audio watermarking. Firstly, the survival of the algorithm from desynchronization attacks is improved. Secondly, the scheme is improved in inaudibility. Objective difference grade (ODG) of the marked audio is significantly changed. Thirdly, the imperceptibility of the scheme is analyzed and the derived result is close to experimental result. Fourthly, the selection of parameters is optimized based on experimental data. Fifthly, the search efficiency of the scheme is compared with those of other synchronization code schemes. The experimental results show that the proposed watermarking scheme allows the high audio quality and is robust to common attacks such as additive white Gaussian noise, requantization, resampling, low-pass filtering, random cropping, MP3 compression, jitter attack, and time scale modification. Moreover, the algorithm has the high search efficiency and low false alarm rate.

• International Journal of Advanced Culture Technology
• /
• v.1 no.2
• /
• pp.1-6
• /
• 2013

In this paper, we evaluate performance of existing similarity measurement metric and propose a novel method using user's preferences information entropy to reduce MAE in memory-based collaborative recommender systems. The proposed method applies a similarity of individual inclination to traditional similarity measurement methods. We experiment on various similarity metrics under different conditions, which include an amount of data and significance weighting from n/10 to n/60, to verify the proposed method. As a result, we confirm the proposed method is robust and efficient from the viewpoint of a sparse data set, applying existing various similarity measurement methods and Significance Weighting.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.10
• /
• pp.639-642
• /
• 2005

In this paper, a robust nonlinear echo cancellation is proposed, where a third-order adaptive Volterra filtering is employed along with an expanded correlation LMS (ECLMS) algorithm to compensate for nonlinear distortion in the echo path. (e.g., DAC of the hybrid network). Finally, the robustness in the echo cancellation of the proposed approach is demonstrated using computer simulations, where high attenuation of echo signals is achieved even in the double-talk situation (e.n., BdB improvement in ERLE).

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.73-76
• /
• 2001

In this paper, we utilize a HVS(Human Visual System) watermarking method where watermarks are embedded in a DFT domain. The HVS watermarking method is robust for attacks like JPEC, filtering, noise, etc. But, when images are attacked by basic geometric attacks as cropping, scaling, rotation, a watermarks may not be detected. In this paper, we introduce the HVS watermarking method that inserts references In a domain of LSB(Least Significant Bit) of image. Experimental results show that the proposed method based on HVS watermarking method gives more robustness to the basic geometric attacks compared with original HVS watermarking methods.