• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.1
• /
• pp.8-16
• /
• 2014

We consider the visual barcode recognition problem in a noisy video data setup. Unlike most existing single-frame recognizers that require considerable user effort to acquire clean, motionless and blur-free barcode signals, we eliminate such extra human efforts by proposing a robust video-based barcode recognition algorithm. We deal with a sequence of noisy blurred barcode image frames by posing it as an online filtering problem. In the proposed dynamic recognition model, at each frame we infer the blur level of the frame as well as the digit class label. In contrast to a frame-by-frame based approach with heuristic majority voting scheme, the class labels and frame-wise noise levels are propagated along the frame sequences in our model, and hence we exploit all cues from noisy frames that are potentially useful for predicting the barcode label in a probabilistically reasonable sense. We also suggest a visual barcode tracking approach that efficiently localizes barcode areas in video frames. The effectiveness of the proposed approaches is demonstrated empirically on both synthetic and real data setup.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.82-89
• /
• 2003

In this paper, an efficient threshold-based filtering (TF) buffer management scheme is proposed. The TF is capable of minimizing the overall loss performance and improving the fairness of buffer usage in a shared buffer packet switch. The TF consists of two mechanisms. One mechanism is to classify the output ports as sctive or inactive by comparing their queue lengths with a dedicated buffer allocation factor. The other mechanism is to filter the arrival packets of inactive output ports when the total queue length exceeds a threshold value. A theoretical queuing model of TF is formulated and resolved for the overall packet loss probability. Computer simulations are used to compare the overall loss performance of TF, dynamic threshold (DT), static threshold (ST) and pushout (PO). We find that TF scheme is more robust against dynamic traffic variations than DT and ST. Also, although the over-all loss performance between TF and PO are close to each other, the implementation of TF is much simpler than the PO.

• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1474-1482
• /
• 2004

In this paper, we propose an approach for extracting and filtering block motion vectors using an adaptive weight function. We first extract motion vectors from a sequence of images by using size-varibale block matching and then process them by adaptive robust estimation to filter out outliers (motion vectors out of concern). The proposed adaptive robust estimation defines a continuous sigmoid weight function. It then adaptively tunes the sigmoid function to its hard-limit as the residual errors between the model and input data are decreased, so that we can effectively separate non-outliers (motion vectors of concern) from outliers with the finally tuned hard-limit of the weight function. The experimental results show that the suggested approach is very effective in filtering block motion vectors.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.3
• /
• pp.201-207
• /
• 2006

A robust Kalman filtering method for uncertain stochastic systems is suggested by adopting a perturbation estimation process which is to reconstruct total uncertainty with respect to the nominal state transition equation. The predictor and corrector of discrete Kalman filter are reformulated with the perturbation estimator. Successively, the state and perturbation estimation error dynamics and the corresponding error covariance propagation equations are derived as well. Finally we have the recursive algorithm of Combined Kalman Filter-Perturbation Estimator (CKF). The proposed combined Kalman filter-perturbation estimator has the property of integrating innovations and the adaptation capability to system uncertainties. A numerical example is shown to demonstrate the effectiveness of the proposed scheme.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.3
• /
• pp.175-181
• /
• 2000

This paper investigates the robust nonlinear H$_{\infty}$ filter with FIR(Finite Impulse Response) structure for nonlinear discrete time-varying uncertain systems represented by the state-space model having parameter uncertainty. Firstly, when there is no parameter uncertainty in the system, the discrete-time nominal nonlinear H$_{\infty}$ FIR filter is derived by using the equivalence relationship between the FIR filter and the recursive filter, which corresponds to the standard nonlinear H$_{\infty}$ filter. Secondly, when the system has the parameter uncertainty, the robust nonlinear H$_{\infty}$ FIR filter is proposed for the discrete-time nonlinear uncertain systems.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1992.06a
• /
• pp.33-36
• /
• 1992

In this paper we propose the impulse noise-robust Wiener filter based on a combination of Wiener and modified trimmed mean(MTM) filters. The robust Wiener filter uses the trimming operation of the MTM filter to replace the outliers with the median within the window and the new set of samples which can be considered as the random process with same mean are inputted into the following Wiener filter. We show that the robust Wiener filter is effective in frequency selective filtering of nonstationary signals while preserving signal edges with the rejection of impulse noise.

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

Highly nonlinear dynamical systems are easily identified using neural networks. When disturbances are included in the learning data set Int system modeling, modeling process will be poorly performed. Since the radial basis functions in the radial basis function network(RBFN) are centered at the points specified by the weights, RBF networks are robust for approximating the process including the narrow-band disturbances deviating significantly from the regular signals. To exclude(filter) these disturbances, a robust algorithm for system identification, based on the RBFN, is proposed. The performance of system identification excluding disturbances is investigated and compared with the one including disturbances.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.81-98
• /
• 2009

Collaborative filtering, one of the most successful technologies among recommender systems, is a system assisting users in easily finding the useful information and supporting the decision making. However, despite of its success and popularity, one notable issue is incredibility of recommendations by unreliable users called shilling attacks. To deal with this problem, in this paper, we analyze the type of shilling attacks and propose a unique method of building a model for protecting the recommender system against manipulated ratings. In addition, we present a method of applying the model to collaborative filtering which is highly robust and stable to shilling attacks.

• MALSORI
• /
• no.60
• /
• pp.181-190
• /
• 2006

This paper describes a speech enhancement scheme that leads to significant improvements in recognition performance when used in the ASR front-end. The proposed approach is based on adaptive comb filtering and an MMSE-related parameter estimator. While adaptive comb filtering reduces noise components remarkably, it is rarely effective in reducing non-stationary noises. Furthermore, due to the uniformly distributed frequency response of the comb-filter, it can cause serious distortion to clean speech signals. This paper proposes an improved comb-filter that adjusts its spectral magnitude to the original speech, based on the speech absence probability and the gain modification function. In addition, we introduce the modified comb filtering-based speech enhancement scheme for ASR in mobile environments. Evaluation experiments carried out using the Aurora 2 database demonstrate that the proposed method outperforms conventional adaptive comb filtering techniques in both clean and noisy environments.

• The Journal of the Korea Contents Association
• /
• v.12 no.5
• /
• pp.1-9
• /
• 2012

The popularity of digital music and smart phones led to develope noise-robust real-time audio fingerprinting system in various ways. In particular, The Multiple Hashing(MLH) of fingerprint algorithms is robust to noise and has an elaborate structure. In this paper, we propose a filter engine based on MLH to achieve better performance. In this approach, we compose a energy-intensive filter to improve the accuracy of Q/R from music database and a statistic filter to remove continuity and redundancy. The energy-intensive filter uses the Discrite Cosine Transform(DCT)'s feature gathering energy to low-order bits and the statistic filters use the correlation between searched fingerprint's information. Experimental results show that the superiority of proposed algorithm consists of the energy and statistical filtering in noise environment. It is found that the proposed filter engine achieves more robust to noise than Philips Robust Hash(PRH), and a more compact way than MLH.