Search results for "Pattern recognition"
showing 10 items of 2301 documents
Color memory in protanomals and deuteranomals: Matching time effect
2003
In a companion paper Perez-Carpinell et al., Color Res Appl 2001;26:158–170, for a set of seven color references, we compared the methods of simultaneous and memory color matching by 15 protanomals and 21 deuteranomals, looking for differences between them and a group of 25 normal trichromat observers investigated previously Perez-Carpinell et al., Color Res Appl 1998;23:234–247. In our current article, matching times of the same anomalous trichromat groups, and with the same reference tests, to select from among the comparison chips the one that most resembled one of the seven reference tests, have been measured under simultaneous and successive color matching procedures. From comparison b…
Multi-label Classification Using Stacked Hierarchical Dirichlet Processes with Reduced Sampling Complexity
2018
Nonparametric topic models based on hierarchical Dirichlet processes (HDPs) allow for the number of topics to be automatically discovered from the data. The computational complexity of standard Gibbs sampling techniques for model training is linear in the number of topics. Recently, it was reduced to be linear in the number of topics per word using a technique called alias sampling combined with Metropolis Hastings (MH) sampling. We propose a different proposal distribution for the MH step based on the observation that distributions on the upper hierarchy level change slower than the document-specific distributions at the lower level. This reduces the sampling complexity, making it linear i…
A genetic algorithm for combined topology and shape optimisations
2003
A method to find optimal topology and shape of structures is presented. With the first the optimal distribution of an assigned mass is found using an approach based on homogenisation theory, that seeks in which elements of a meshed domain it is present mass; with the second the discontinuous boundaries are smoothed. The problem of the optimal topology search has an ON/OFF nature and has suggested the employment of genetic algorithms. Thus in this paper a genetic algorithm has been developed, which uses as design variables, in the topology optimisation, the relative densities (with respect to effective material density) 0 or 1 of each element of the structure and, in the shape one, the coord…
Sample–tip coupling efficiencies of the photon-scanning tunneling microscope
1991
The photon-scanning tunneling microscope is the photon analog to the electron-scanning tunneling microscope. It uses the evanescent field due to the total internal reflection of a light beam in a prism, modulated by a sample attached to the prism. The exponential decay of the evanescent field is characterized by the penetration depth dp and depends on the angle of incidence θ, the wavelength, and the polarization of the incident beam. The 1/e decay lengths range from 150 to 265 nm as deduced from the expression of the electric-field intensity in the rarer medium for θ = π/2. If we place another optically transparent medium near the surface, frustrated total reflection occurs. It is shown th…
Feature Selection for Ensembles of Simple Bayesian Classifiers
2002
A popular method for creating an accurate classifier from a set of training data is to train several classifiers, and then to combine their predictions. The ensembles of simple Bayesian classifiers have traditionally not been a focus of research. However, the simple Bayesian classifier has much broader applicability than previously thought. Besides its high classification accuracy, it also has advantages in terms of simplicity, learning speed, classification speed, storage space, and incrementality. One way to generate an ensemble of simple Bayesian classifiers is to use different feature subsets as in the random subspace method. In this paper we present a technique for building ensembles o…
Ensemble Feature Selection Based on the Contextual Merit
2001
Recent research has proved the benefits of using ensembles of classifiers for classification problems. Ensembles constructed by machine learning methods manipulating the training set are used to create diverse sets of accurate classifiers. Different feature selection techniques based on applying different heuristics for generating base classifiers can be adjusted to specific domain characteristics. In this paper we consider and experiment with the contextual feature merit measure as a feature selection heuristic. We use the diversity of an ensemble as evaluation function in our new algorithm with a refinement cycle. We have evaluated our algorithm on seven data sets from UCI. The experiment…
Towards to deep neural network application with limited training data: synthesis of melanoma's diffuse reflectance spectral images
2019
The goal of our study is to train artificial neural networks (ANN) using multispectral images of melanoma. Since the number of multispectral images of melanomas is limited, we offer to synthesize them from multispectral images of benign skin lesions. We used the previously created melanoma diagnostic criterion p'. This criterion is calculated from multispectral images of skin lesions captured under 526nm, 663nm, and 964nm LED illumination. We synthesize these three images from multispectral images of nevus so that the p' map matches the melanoma criteria (the values in the lesion area is >1, respectively). Demonstrated results show that by transforming multispectral images of benign nevus i…
Null Space Based Image Recognition Using Incremental Eigendecomposition
2011
An incremental approach to the discriminative common vector (DCV) method for image recognition is considered. Discriminative projections are tackled in the particular context in which new training data becomes available and learned subspaces may need continuous updating. Starting from incremental eigendecomposition of scatter matrices, an efficient updating rule based on projections and orthogonalization is given. The corresponding algorithm has been empirically assessed and compared to its batch counterpart. The same good properties and performance results of the original method are kept but with a dramatic decrease in the computation needed.
Learning the structure of HMM's through grammatical inference techniques
2002
A technique is described in which all the components of a hidden Markov model are learnt from training speech data. The structure or topology of the model (i.e. the number of states and the actual transitions) is obtained by means of an error-correcting grammatical inference algorithm (ECGI). This structure is then reduced by using an appropriate state pruning criterion. The statistical parameters that are associated with the obtained topology are estimated from the same training data by means of the standard Baum-Welch algorithm. Experimental results showing the applicability of this technique to speech recognition are presented. >
Ensemble Feature Selection Based on Contextual Merit and Correlation Heuristics
2001
Recent research has proven the benefits of using ensembles of classifiers for classification problems. Ensembles of diverse and accurate base classifiers are constructed by machine learning methods manipulating the training sets. One way to manipulate the training set is to use feature selection heuristics generating the base classifiers. In this paper we examine two of them: correlation-based and contextual merit -based heuristics. Both rely on quite similar assumptions concerning heterogeneous classification problems. Experiments are considered on several data sets from UCI Repository. We construct fixed number of base classifiers over selected feature subsets and refine the ensemble iter…