Displaying 81 – 100 of 149

Showing per page

Multidimensional Models for Methodological Validation in Multifractal Analysis

R. Lopes, I. Bhouri, S. Maouche, P. Dubois, M. H. Bedoui, N. Betrouni (2008)

Mathematical Modelling of Natural Phenomena

Multifractal analysis is known as a useful tool in signal analysis. However, the methods are often used without methodological validation. In this study, we present multidimensional models in order to validate multifractal analysis methods.

Neuromorphic features of probabilistic neural networks

Jiří Grim (2007)

Kybernetika

We summarize the main results on probabilistic neural networks recently published in a series of papers. Considering the framework of statistical pattern recognition we assume approximation of class-conditional distributions by finite mixtures of product components. The probabilistic neurons correspond to mixture components and can be interpreted in neurophysiological terms. In this way we can find possible theoretical background of the functional properties of neurons. For example, the general...

Nonparametric recursive aggregation process

Elena Tsiporkova, Veselka Boeva (2004)

Kybernetika

In this work we introduce a nonparametric recursive aggregation process called Multilayer Aggregation (MLA). The name refers to the fact that at each step the results from the previous one are aggregated and thus, before the final result is derived, the initial values are subjected to several layers of aggregation. Most of the conventional aggregation operators, as for instance weighted mean, combine numerical values according to a vector of weights (parameters). Alternatively, the MLA operators...

Notes on the evolution of feature selection methodology

Petr Somol, Jana Novovičová, Pavel Pudil (2007)

Kybernetika

The paper gives an overview of feature selection techniques in statistical pattern recognition with particular emphasis on methods developed within the Institute of Information Theory and Automation research team throughout recent years. Besides discussing the advances in methodology since times of Perez’s pioneering work the paper attempts to put the methods into a taxonomical framework. The methods discussed include the latest variants of the optimal algorithms, enhanced sub-optimal techniques...

On metric divergences of probability measures

Igor Vajda (2009)

Kybernetika

Standard properties of φ -divergences of probability measures are widely applied in various areas of information processing. Among the desirable supplementary properties facilitating employment of mathematical methods is the metricity of φ -divergences, or the metricity of their powers. This paper extends the previously known family of φ -divergences with these properties. The extension consists of a continuum of φ -divergences which are squared metric distances and which are mostly new but include...

On naive Bayes in speech recognition

László Tóth, András Kocsor, János Csirik (2005)

International Journal of Applied Mathematics and Computer Science

The currently dominant speech recognition technology, hidden Mar-kov modeling, has long been criticized for its simplistic assumptions about speech, and especially for the naive Bayes combination rule inherent in it. Many sophisticated alternative models have been suggested over the last decade. These, however, have demonstrated only modest improvements and brought no paradigm shift in technology. The goal of this paper is to examine why HMM performs so well in spite of its incorrect bias due to...

On related transducers

Petr Lisoněk (1990)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

On selecting the best features in a noisy environment

Jan Flusser, Tomáš Suk (1998)

Kybernetika

This paper introduces a novel method for selecting a feature subset yielding an optimal trade-off between class separability and feature space dimensionality. We assume the following feature properties: (a) the features are ordered into a sequence, (b) robustness of the features decreases with an increasing order and (c) higher-order features supply more detailed information about the objects. We present a general algorithm how to find under those assumptions the optimal feature subset. Its performance...

Partitioned iterated function systems with division and a fractal dependence graph in recognition of 2D shapes

Krzysztof Gdawiec, Diana Domańska (2011)

International Journal of Applied Mathematics and Computer Science

One of the approaches in pattern recognition is the use of fractal geometry. The property of self-similarity of fractals has been used as a feature in several pattern recognition methods. All fractal recognition methods use global analysis of the shape. In this paper we present some drawbacks of these methods and propose fractal local analysis using partitioned iterated function systems with division. Moreover, we introduce a new fractal recognition method based on a dependence graph obtained from...

Currently displaying 81 – 100 of 149