All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 20 Next

Displaying 381 – 400 of 947

Showing per page

Extraction of fuzzy rules using deterministic annealing integrated with ε-insensitive learning

Robert Czabański (2006)

International Journal of Applied Mathematics and Computer Science

A new method of parameter estimation for an artificial neural network inference system based on a logical interpretation of fuzzy if-then rules (ANBLIR) is presented. The novelty of the learning algorithm consists in the application of a deterministic annealing method integrated with ε-insensitive learning. In order to decrease the computational burden of the learning procedure, a deterministic annealing method with a "freezing" phase and ε-insensitive learning by solving a system of linear inequalities...

Eye localization for face recognition

Paola Campadelli, Raffaella Lanzarotti, Giuseppe Lipori (2006)

RAIRO - Theoretical Informatics and Applications

We present a novel eye localization method which can be used in face recognition applications. It is based on two SVM classifiers which localize the eyes at different resolution levels exploiting the Haar wavelet representation of the images. We present an extensive analysis of its performance on images of very different public databases, showing very good results.

Featureless pattern classification

Robert P. W. Duin, Dick de Ridder, David M. J. Tax (1998)

Kybernetika

In this paper the possibilities are discussed for training statistical pattern recognizers based on a distance representation of the objects instead of a feature representation. Distances or similarities are used between the unknown objects to be classified with a selected subset of the training objects (the support objects). These distances are combined into linear or nonlinear classifiers. In this approach the feature definition problem is replaced by finding good similarity measures. The proposal...

Finite volume schemes for the generalized subjective surface equation in image segmentation

Karol Mikula, Mariana Remešíková (2009)

Kybernetika

In this paper, we describe an efficient method for 3D image segmentation. The method uses a PDE model – the so called generalized subjective surface equation which is an equation of advection-diffusion type. The main goal is to develop an efficient and stable numerical method for solving this problem. The numerical solution is based on semi-implicit time discretization and flux-based level set finite volume space discretization. The space discretization is discussed in details and we introduce three...

First Order Languages: Further Syntax and Semantics

Marco Caminati (2011)

Formalized Mathematics

Third of a series of articles laying down the bases for classical first order model theory. Interpretation of a language in a universe set. Evaluation of a term in a universe. Truth evaluation of an atomic formula. Reassigning the value of a symbol in a given interpretation. Syntax and semantics of a non atomic formula are then defined concurrently (this point is explained in [16], 4.2.1). As a consequence, the evaluation of any w.f.f. string and the relation of logical implication are introduced....

Flexible representation and querying of heterogeneous structured documents

Gloria Bordogna, Gabriella Pasi (2000)

Kybernetika

In this paper we present a fuzzy model for representing documents having a hierarchical structure and possibly containing multimedia information. We consider an archive containing documents with distinct (heterogeneous) logical structures. We also propose a flexible query language for expressing soft selection conditions on the structured documents. The documents’ content is organized into thematic (topical) sections where the index terms play a distinct role. The proposed document representation...

Formalisation des connaissances pour la simulation du service-retour en tennis : le système lift

Gil Denis, Alain Pizzinato (1993)

Mathématiques et Sciences Humaines

Dans cet article, nous présentons les aspects essentiels de la modélisation du processus décisionnel des joueurs de tennis dans une phase particulière de ce jeu sportif : le service-retour. Notre démarche se focalise sur la représentation des connaissances s'exerçant dans un continuum temporel scindé en micro-cycles et sur la construction de structures permettant d'envisager l'auto-apprentissage des caractéristiques technico-tactiques des joueurs par le système. Elle s'appuie sur la mise en oeuvre...

Formalization of Generalized Almost Distributive Lattices

Adam Grabowski (2014)

Formalized Mathematics

Almost Distributive Lattices (ADL) are structures defined by Swamy and Rao [14] as a common abstraction of some generalizations of the Boolean algebra. In our paper, we deal with a certain further generalization of ADLs, namely the Generalized Almost Distributive Lattices (GADL). Our main aim was to give the formal counterpart of this structure and we succeeded formalizing all items from the Section 3 of Rao et al.’s paper [13]. Essentially among GADLs we can find structures which are neither V-commutative...

Free Interpretation, Quotient Interpretation and Substitution of a Letter with a Term for First Order Languages

Marco Caminati (2011)

Formalized Mathematics

Fourth of a series of articles laying down the bases for classical first order model theory. This paper supplies a toolkit of constructions to work with languages and interpretations, and results relating them. The free interpretation of a language, having as a universe the set of terms of the language itself, is defined.The quotient of an interpreteation with respect to an equivalence relation is built, and shown to remain an interpretation when the relation respects it. Both the concepts of quotient...

From computing with numbers to computing with words - From manipulation of measurements to manipulation of perceptions

Lotfi Zadeh (2002)

International Journal of Applied Mathematics and Computer Science

Computing, in its usual sense, is centered on manipulation of numbers and symbols. In contrast, computing with words, or CW for short, is a methodology in which the objects of computation are words and propositions drawn from a natural language, e.g., small, large, far, heavy, not very likely, the price of gas is low and declining, Berkeley is near San Francisco, it is very unlikely that there will be a significant increase in the price of oil in the near future, etc. Computing with words is inspired...

Currently displaying 381 – 400 of 947