this study aims at utilizing mutual information algorithm to make an objective and quantitative research for the pulses in Traditional Chinese Medicine (TCM) diagnosis. the normal pulse signals, slippery pulse signals...
详细信息
this study aims at utilizing mutual information algorithm to make an objective and quantitative research for the pulses in Traditional Chinese Medicine (TCM) diagnosis. the normal pulse signals, slippery pulse signals and taut pulse signals were collected from the outpatients by Shanghai University of TCM. Some typical pulse signals from all these classes were selected as the templates to be matched withthe new pulse signals by means of mutual information, and then which class the new pulse signal should be classified was determined through the maximum mutual information. Finally, the satisfactory results were obtained which proof that it was appropriate to use mutual information to recognize pulse signals. the biggest advantage of this way is simple, since the inputted pulse signals should not be extracted features. And the time-domain features were extracted from the pulse signals to be classified. the results from the two different ways show the classification method presented is efficient based on Mutual Information.
Coscinodiscus Ehrenberg is a large and ecologically important diatom genus with plentiful species in marine phytoplankton and with a variety of round shapes and ornamentation. these properties can be measured by compu...
详细信息
Coscinodiscus Ehrenberg is a large and ecologically important diatom genus with plentiful species in marine phytoplankton and with a variety of round shapes and ornamentation. these properties can be measured by computer image pre-segmentation and feature extraction withthreshold methods. However, it proves to be complicated task because of the high spatial variability of ornamentation properties. Researchers have shown a Teach-program and a number of library functions operating on sample image lists (SIL's) and operating on classifiers (CF's) to solve the problem. In this paper, we present Coscinodiscus Ehrenberg ornamentation classifier algorithm called support vector machines (SVMs) to derive a new set of SIL's and CF's. the principal purpose of SVMs is Coscinodiscus Ehrenberg images patternrecognition approach. A pattern is in this context always the SIL's contained in a sub-rectangle of some given (possibly larger) image. For the same classifier this sub-rectangle must always have the same dimensions, while the query image to be searched may be arbitrarily large. the training is done by preparing SIL's for the pattern taxa in question and feeding them to CF's created. Our classifier generation with preprocessing code optimization achieves a AAAAA preprocessing code, a 0.981 learning success, a 100% computational complexity. Train with SIL's achieves 212 samples, 17 taxa, a 0.472% error rate and Test with Query image searching achieves 253 samples, 17 taxa, a 15.81% error rate. the experiments demonstrate that the proposed method is very robust to the threshold segmentation and ornamentation feature extraction of Coscinodiscus Ehrenberg images, and is effective and useful for species classification of Coscinodiscus Ehrenberg.
A new functional model for burst firing in the dorsal thalamus is proposed where thalamocortical patternrecognition systems, based on kernel machine principles, are connected by burst signaling. the systems include i...
详细信息
ISBN:
(纸本)9781424420728
A new functional model for burst firing in the dorsal thalamus is proposed where thalamocortical patternrecognition systems, based on kernel machine principles, are connected by burst signaling. the systems include input trapping in the dorsal thalamus, cortical learning state memory and processing in the thalamic reticular nucleus. Misclassified events are captured as training examples in the waking state and the patternrecognition systems are trained by extensive thalamic bursting in deep sleep.
machine Facial recognition is a problem that consists in exploring still or video images of a scene to identify or verify one or more persons in the scene using stored databases of faces. Research in Facial Recognitio...
详细信息
ISBN:
(纸本)9789899624702
machine Facial recognition is a problem that consists in exploring still or video images of a scene to identify or verify one or more persons in the scene using stored databases of faces. Research in Facial recognition is multidisciplinary including disciplines like patternrecognition, image processing and analysis, computer graphics, machinelearning and datamining. Sometimes applications include not only facial recognition but also facial expression characteristics identification and classification like blinking of the eyes, open/close mouth among others. this paper presents a comparative study of three algorithms for classification basic facial expressions.
Traditional kernelised classification methods Could not perforin well sometimes because of the using of a single and fixed kernel, especially oil sonic complicated data sets. In this paper. a novel optimal double-kern...
详细信息
ISBN:
(纸本)9783642030697
Traditional kernelised classification methods Could not perforin well sometimes because of the using of a single and fixed kernel, especially oil sonic complicated data sets. In this paper. a novel optimal double-kernel combination (ODKC) method is proposed for complicated classification tasks. Firstly, data sets are mapped by two basic kernels into different feature spaces respectively, and then three kinds of optimal composite kernels are constructed by integrating information of the two feature spaces. Comparative experiments demonstrate the effectiveness of our methods.
this work presents an image analysis framework driven by emerging evidence and constrained by the semantics expressed in an ontology. Human perception, apart from visual stimulus and patternrecognition, relies also o...
详细信息
ISBN:
(纸本)9783642030697
this work presents an image analysis framework driven by emerging evidence and constrained by the semantics expressed in an ontology. Human perception, apart from visual stimulus and patternrecognition, relies also on general knowledge and application context for understanding visual content in conceptual terms. Our work is an attempt to imitate this behavior by devising an evidence driven probabilistic, inference framework using ontologies and bayesian networks. Experiments conducted for two different image analysis, tasks showed improvement performance, compared to the case where computer vision techniques act isolated from any type of knowledge or context.
No-regret algorithms for online convex optimization are potent online learning tools and have been demonstrated to be successful in a wide-ranging number of applications. Considering affine and external regret, we, in...
详细信息
ISBN:
(纸本)9783642030697
No-regret algorithms for online convex optimization are potent online learning tools and have been demonstrated to be successful in a wide-ranging number of applications. Considering affine and external regret, we, investigate what happens when a set of no-regret learners (voters) merge their respective decisions in each learning iteration to a single, common one in form of a convex combination. We show that an agent (or algorithm) that executes this merged decision in each iteration of the online learning process and each time feeds back a copy of its own reward function to the voters, incurs sublinear regret itself. As a by-product, we obtain a simple method that allows us to construct new no-regret algorithms out of known ones.
Prior knowledge about it problem domain can be utilized to bias Support Vector machines (SVMs) towards learning better hypothesis functions. To this end, a number of methods have been proposed that demonstrate improve...
详细信息
ISBN:
(纸本)9783642030697
Prior knowledge about it problem domain can be utilized to bias Support Vector machines (SVMs) towards learning better hypothesis functions. To this end, a number of methods have been proposed that demonstrate improved generalization performance after the application of domain knowledge;especially in the case of scarce training data. In this paper, we propose an extension to the Virtual Support vectors (VSVs) technique where only a subset of the Support vectors (SVs) is Utilized. Unlike previous methods, the Purpose here is to compensate for noise and uncertainty in the training data. Furthermore, we investigate the effect of domain knowledge not only oil the quality of the SVM model, but also Oil rules extracted from it: hence the learned pattern by the SVM. Results on five benchmark and one real life data sets show that domain knowledge can significantly improve boththe quality Of the SVM and the rules extracted from it.
data clustering has been applied in multiple fields such as machinelearning, datamining, wireless sensor networks and patternrecognition. One of the most famous clustering approaches is K-means which effectively ha...
详细信息
ISBN:
(纸本)9781424481835
data clustering has been applied in multiple fields such as machinelearning, datamining, wireless sensor networks and patternrecognition. One of the most famous clustering approaches is K-means which effectively has been used in many clustering problems, but this algorithm has some problems such as local optimal convergence and initial point sensitivity. Artificial fishes swarm algorithm (AFSA) is one of the swarm intelligent algorithms and its major application is in solving optimization problems. Of its characteristics, it can refer to high convergent rate and insensitivity to initial values. In this paper a hybrid clustering method based on artificial fishes swarm algorithm and K-means so called KAFSA is proposed. In the proposed algorithm, K-means algorithm is used as one of the behaviors of artificial fishes in AFSA. the proposed algorithm has been tested on five data sets and its efficiency was compared with particle swarm optimization (PSO), K-means and standard AFSA algorithms. Experimental results showed that proposed approach has suitable and acceptable efficacy in data clustering.
暂无评论