Al~trad-The least squares parametric system identification algorithm is analyzed assuming that the noise is a bounded signal. A bound on the worst-case parameter estimation error is derived. This bound shows that the worst-case parameter estimation error decreases to zero as the bound on the noise is decreased to zero. 1. Introduction THE LEAST SQUARES ALGORITHM, due to Gauss, is one of the mos...

Recently, MOESP-type closed-loop subspace model identification (CL-MOESP) has been proposed by the authors and its effectiveness has been demonstrated via both numerical simulations and real-life systems, e.g., a cart-inverted pendulum system. However, asymptotic properties of CLMOESP has not yet been studied. The purpose of this paper is to clarify the asymptotic properties of CL-MOESP from th...

In this paper, we consider robust system identification under sparse outliers and random noises. In this problem, system parameters are observed through a Toeplitz matrix. All observations are subject to random noises and a few are corrupted with outliers. We reduce this problem of system identification to a sparse error correcting problem using a Toeplitz structured real-numbered coding matrix...

In this article we present a novel method for automatic pronunciation error detection of children’s speech. A phone graph is generated from the audio segment and augmented if necessary with alignments of phonetic transcriptions of the word to score. This graph is used for extracting phone-level features using conventional HMM/GMM acoustic scores and Support Vector Machine (SVM) classifiers acti...

Traffic sign classification is a challenging problem in Computer Vision due to the high variability of sign appearance in uncontrolled environments. Lack of visibility, illumination changes, and partial occlusions are just a few problems. In this paper, we introduce a classification technique for traffic signs recognition by means of Error Correcting Output Codes. Recently, new proposals of cod...

The coeecients of a polynomial of a degree n can be expressed via the power sums of its zeros by means of a polynomial equation known as the key equation for decoding the BCH error-correcting codes. Berlekamp's algorithm of 1968 solves this equation by using order of n 2 operations in a xed eld. Several algorithms of 1975-1980 rely on the extended Euclidean algorithm and computing Pad e approxi...

The MPEG-2 compression algorithm, due to the use of variable length coding, is very sensitive to channel disturbances. A single bit error during transmission leads to noticeable degradation of the decoded sequence quality in that part or entire slice information is lost until the next resynchronization point is reached. Error concealment (EC) methods are employed at the decoder side to deal wit...