In this work it has been developed a novel system of automatic recognition for trees leaves, based on a hybrid classification method by means of a Support Vector Machine (SVM), using the Fisher kernel, and calculated from a Hidden Markov Model (HMM). An angle sequence has been used as an element of parameterization, extracted from the leaves contour, making such sequence invariable by rotation,...

Face recognition has established itself as an important subbranch of pattern recognition within the field of computer science. Many state-of-the-art systems have focused on the task of recognizing frontal views or images with just slight variations in head pose and facial expression of people. In this work we concentrate on two approaches to recognize profile views (90 degrees) with previous kn...

Abstract—This research study aims to present a retrospective study about speech recognition systems and artificial intelligence. Speech recognition has become one of the widely used technologies, as it offers great opportunity to interact and communicate with automated machines. Precisely, it can be affirmed that speech recognition facilitates its users and helps them to perform their daily ro...

The prominent modeling technique for speech recognition today is the hidden Markov model with Gaussian emission densities. They have suffered, though, from an inability to learn discriminative information and are prone to overfitting and overparameterization. Recent work on machine learning has moved toward models such as the support vector machine that automatically control generalization and ...

3D city models have greatly changed the way we interact with geographic information. However, both the visualization and interaction are limited on conventional 2D displays. This paper presents a system that visualizes 3D cities and supports gesture interaction in a fully immersive Cave Automatic Virtual Environment (CAVE). The proposed system utilizes gestures to control navigation, selection,...

let l := u3(11). in this article, we classify groups with the same order and degree pattern as an almost simple group related to l. in fact, we prove that l, l:2 and l:3 are od-characterizable, and l:s3 is 5-fold od-characterizable.

heretofore, a vast spectrum of pattern recognition methods has been considered by researchers to design credit scoring models. but what has not been considered enough in these studies is the lack of consideration of the needs of this subject which differentiate it from a simple classification. it is necessary to observe the costs of a wrong classification, because practically the cost of improp...

Within computational linguistics, the use of statistical pattern matching is generally restricted to speech processing. We have attempted to apply statistical techniques to discover a grammatical classification system from a Corpus of 'raw' English text. A discovery procedure is simpler for a simpler language model; we assume a first-order Markov model, which (surprisingly) is shown elsewhere t...