In this paper, a perception-based algorithm for fusion of multiple fingerprint matchers is presented. The person to be identified submits to the personal authentication system her/his fingerprint and claimed identity....
详细信息
In this paper, a perception-based algorithm for fusion of multiple fingerprint matchers is presented. The person to be identified submits to the personal authentication system her/his fingerprint and claimed identity. Multiple fingerprint matchers provide a set of verification scores, that are then fused by a single-layer perceptron with class-separation loss function. Weights of such perceptron are explicitly optimised to increase the separation between genuine users and impostors (i.e., unauthorized users). Reported experiments show that such modified perceptron allows improving the performances and the robustness of the best individual fingerprint matcher, and outperforming some commonly used fusion rules. (c) 2005 Elsevier B.V. All rights reserved.
A probabilistic neural network is applied as a tool to approximate the statistical evaluation function for a simple version of the game Tic-Tac-Toe. We solve the problem by a sequential estimation of the underlying di...
详细信息
A probabilistic neural network is applied as a tool to approximate the statistical evaluation function for a simple version of the game Tic-Tac-Toe. We solve the problem by a sequential estimation of the underlying discrete distribution mixture of product components. (c) 2005 Elsevier B.V. All rights reserved.
Convolution kernels and recursive neuralnetworks are both suitable approaches for supervised learning when the input is a discrete structure like a labeled tree or graph. We compare these techniques in two natural la...
详细信息
Convolution kernels and recursive neuralnetworks are both suitable approaches for supervised learning when the input is a discrete structure like a labeled tree or graph. We compare these techniques in two natural language problems. In both problems, the learning task consists in choosing the best alternative tree in a set of candidates. We report about an empirical evaluation between the two methods on a large corpus of parsed sentences and speculate on the role played by the representation and the loss function. (c) 2005 Elsevier B.V. All rights reserved.
Localizing faces in images is a difficult task, and represents the firststep towards the solution of the face recognition problem. Moreover, devising an effective face detection method can provide some suggestions to...
详细信息
Localizing faces in images is a difficult task, and represents the firststep towards the solution of the face recognition problem. Moreover, devising an effective face detection method can provide some suggestions to solve similar object and pattern detection problems. This paper presents a novel approach to the solution of the face localization problem using Recursive neuralnetworks (RNNs). The proposed method assumes a graph-based representation of images that combines structural and symbolic visual features. Such graphs are then processed by RNNs, in order to establish the possible presence and the position of faces inside the image. A novel RNN model that can deal with graphs with labeled edges has been also exploited. Some experiments on snapshots from video sequences are reported, showing very promising results. (c) 2005 Elsevier B.V. All rights reserved.
A probabilistic neural network is applied as a tool to approximate the statistical evaluation function for a simple version of the game Tic-Tac-Toe. We solve the problem by a sequential estimation of the underlying di...
详细信息
A probabilistic neural network is applied as a tool to approximate the statistical evaluation function for a simple version of the game Tic-Tac-Toe. We solve the problem by a sequential estimation of the underlying discrete distribution mixture of product components. (c) 2005 Elsevier B.V. All rights reserved.
This paper introduces a new class of sign-based training algorithms for neuralnetworks that combine the sign-based updates of the Rprop algorithm with the composite nonlinear Jacobi method. The theoretical foundation...
详细信息
This paper introduces a new class of sign-based training algorithms for neuralnetworks that combine the sign-based updates of the Rprop algorithm with the composite nonlinear Jacobi method. The theoretical foundations of the class are described and a heuristic Rprop-based Jacobi algorithm is empirically investigated through simulation experiments in benchmark pattern classification problems. Numerical evidence shows that this new modification of the Rprop algorithm exhibits improved learning speed in all cases tested, and compares favorably against the Rprop and a recently proposed modification, the improved Rprop. (c) 2005 Elsevier B.V. All rights reserved.
Mixture modeling is the problem of identifying and modeling components in a given set of data. Gaussians are widely used in mixture modeling. At the same time, other models such as Dirichlet distributions have not rec...
详细信息
Mixture modeling is the problem of identifying and modeling components in a given set of data. Gaussians are widely used in mixture modeling. At the same time, other models such as Dirichlet distributions have not received attention. In this paper, we present an unsupervised algorithm for learning a finite Dirichlet mixture model. The proposed approach for estimating the parameters of a Dirichlet mixture is based on the maximum likelihood (ML) expressed in a Riemannian space. Experimental results are presented for the following applications: summarization of texture image databases for efficient retrieval, and human skin color modeling and its application to skin detection in multimedia databases. (c) 2005 Elsevier B.V. All rights reserved.
The automatic extraction of the notes that were played in a digital musical signal (automatic music transcription) is an open problem. A number of techniques have been applied to solve it without concluding results. T...
详细信息
The automatic extraction of the notes that were played in a digital musical signal (automatic music transcription) is an open problem. A number of techniques have been applied to solve it without concluding results. The monotimbral polyphonic version of the problem is posed here: a single instrument has been played and more than one note can sound at the same time. This work tries to approach it through the identification of the pattern of a given instrument in the frequency domain. This is achieved using time-delay neuralnetworks that are fed with the band-grouped spectrogram of a polyphonic monotimbral music recording. The use of a learning scheme based on examples like neuralnetworks permits our system to avoid the use of an auditory model to approach this problem. A number of issues have to be faced to have a robust and powerful system, but promising results using synthesized instruments are presented. (c) 2005 Elsevier B.V. All rights reserved.
Kohonen self-organisation maps are a well know classification tool, commonly used in a wide variety of problems, but with limited applications in time series forecasting context. In this paper, we propose a forecastin...
详细信息
Kohonen self-organisation maps are a well know classification tool, commonly used in a wide variety of problems, but with limited applications in time series forecasting context. In this paper, we propose a forecasting method specifically designed for multi-dimensional long-term trends prediction, with a double application of the Kohonen algorithm. Practical applications of the method are also presented. (c) 2005 Elsevier B.V. All rights reserved.
Handwriting recognition for hand-held devices like PDAs requires very accurate and adaptive classifiers. It is such a complex classification problem that it is quite usual now to make co-operate several classification...
详细信息
Handwriting recognition for hand-held devices like PDAs requires very accurate and adaptive classifiers. It is such a complex classification problem that it is quite usual now to make co-operate several classification methods. In this paper, we present an original two stages recognizer. The firststage is a model-based classifier which store an exhaustive set of character models. The second stage is a pairwise classifier which separate the most ambiguous pairs of classes. This hybrid architecture is based on the idea that the correct class almost systematically belongs to the two more relevant classes found by the first classifier. Experiments on a 80,000 examples database show a 30% improvement on a 62 classes recognition problem. Moreover, we show experimentally that such an architecture suits perfectly for incremental classification. (c) 2005 Elsevier B.V. All rights reserved.
暂无评论