Approaches to Identification of Linear Relations from Compound Noisy and Noise-Free Data

Dragan Radojević

Displaying similar documents to “Approaches to Identification of Linear Relations from Compound Noisy and Noise-Free Data”

Accent Recognition for Noisy Audio Signals

Ma, Zichen, Fokoue, Ernest (2014)

Serdica Journal of Computing

Similarity:

It is well established that accent recognition can be as accurate as up to 95% when the signals are noise-free, using feature extraction techniques such as mel-frequency cepstral coefficients and binary classifiers such as discriminant analysis, support vector machine and k-nearest neighbors. In this paper, we demonstrate that the predictive performance can be reduced by as much as 15% when the signals are noisy. Specifically, in this paper we perturb the signals with different levels...

The Frisch scheme in algebraic and dynamic identification problems

Roberto P. Guidorzi, Roberto Diversi, Umberto Soverini (2008)

Kybernetika

Similarity:

This paper considers the problem of determining linear relations from data affected by additive noise in the context of the Frisch scheme. The loci of solutions of the Frisch scheme and their properties are first described in the algebraic case. In this context two main problems are analyzed: the evaluation of the maximal number of linear relations compatible with data affected by errors and the determination of the linear relation actually linking the noiseless data. Subsequently the...

The nucleus of the free alternative algebra.

Hentzel, I.R., Peresi, L.A. (2006)

Experimental Mathematics

Similarity:

Fixed-point free maps of Euclidean spaces

R. Z. Buzyakova, A. Chigogidze (2011)

Fundamenta Mathematicae

Similarity:

Our main result states that every fixed-point free continuous self-map of ℝⁿ is colorable. This result can be reformulated as follows: A continuous map f: ℝⁿ → ℝⁿ is fixed-point free iff f̃: βℝⁿ → βℝⁿ is fixed-point free. We also obtain a generalization of this fact and present some examples