• Science of Emotion and Sensibility
• /
• v.24 no.1
• /
• pp.59-72
• /
• 2021

Concepts and categories offer the basis for inference pertaining to unobserved features. Prior research on category-based induction that used blank properties has suggested that similarity between categories and features explains feature inference (Rips, 1975; Osherson et al., 1990). However, it was shown by later research that prior knowledge had a large influence on category-based inference and cases were reported where similarity effects completely disappeared. Thus, this study tested category-based feature inference when features are connected in a causal chain and proposed a feature inference model that predicts participants' inference ratings. Each participant learned a category with four features connected in a causal chain and then performed feature inference tasks for an unobserved feature in various exemplars of the category. The results revealed nonindependence, that is, the features not only linked directly to the target feature but also to those screened-off by other feature nodes and affected feature inference (a violation of the causal Markov condition). Feature inference model of causal model theory (Sloman, 2005) explained nonindependence by predicting the effects of directly linked features and indirectly related features. Indirect features equally affected participants' inference regardless of causal distance, and the model predicted smaller effects regarding causally distant features.

• ETRI Journal
• /
• v.35 no.1
• /
• pp.100-108
• /
• 2013

In this paper, a feature extraction (FE) method is proposed that is comparable to the traditional FE methods used in automatic speech recognition systems. Unlike the conventional spectral-based FE methods, the proposed method evaluates the similarities between an embedded speech signal and a set of predefined speech attractor models in the reconstructed phase space (RPS) domain. In the first step, a set of Gaussian mixture models is trained to represent the speech attractors in the RPS. Next, for a new input speech frame, a posterior-probability-based feature vector is evaluated, which represents the similarity between the embedded frame and the learned speech attractors. We conduct experiments for a speech recognition task utilizing a toolkit based on hidden Markov models, over FARSDAT, a well-known Persian speech corpus. Through the proposed FE method, we gain 3.11% absolute phoneme error rate improvement in comparison to the baseline system, which exploits the mel-frequency cepstral coefficient FE method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.2
• /
• pp.37-41
• /
• 2014

The vector Taylor series (VTS) based method usually employs clean speech Hidden Markov Models (HMMs) when compensating speech feature vectors or adapting the parameters of trained HMMs. It is well-known that noisy speech HMMs trained by the Multi-condition TRaining (MTR) and the Multi-Model-based Speech Recognition framework (MMSR) method perform better than the clean speech HMM in noisy speech recognition. In this paper, we propose a method to use the noise-adapted HMMs in the VTS-based speech feature compensation method. We derived a novel mathematical relation between the train and the test noisy speech feature vector in the log-spectrum domain and the VTS is used to estimate the statistics of the test noisy speech. An iterative EM algorithm is used to estimate train noisy speech from the test noisy speech along with noise parameters. The proposed method was applied to the noise-adapted HMMs trained by the MTR and MMSR and could reduce the relative word error rate significantly in the noisy speech recognition experiments on the Aurora 2 database.

• Speech Sciences
• /
• v.13 no.4
• /
• pp.177-186
• /
• 2006

In an effort to enhance the quality of feature vector classification and thereby reduce the recognition error rate of the speaker-independent speech recognition, we employ the Mahalanobis distance in the calculation of the similarity measure between feature vectors. It is assumed that the metric matrix of the Mahalanobis distance be diagonal for the sake of cost reduction in memory and time of calculation. We propose that the diagonal elements be given in terms of the variations of the feature vector components. Geometrically, this prescription tends to redistribute the set of data in the shape of a hypersphere in the feature vector space. The idea is applied to the speech recognition by hidden Markov model with fuzzy vector quantization. The result shows that the recognition is improved by an appropriate choice of the relevant adjustable parameter. The Viterbi score difference of the two winners in the recognition test shows that the general behavior is in accord with that of the recognition error rate.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.2
• /
• pp.135-140
• /
• 2012

The mirror neuron system in the cerebrum, which are handled by visual information-based imitative learning. When we observe the observer's range of mirror neuron system, we can assume intention of performance through progress of neural activation as specific range, in include of partially hidden range. It is goal of our paper that imitative learning is applied to 3D vision-based intelligent system. We have experiment as stereo camera-based restoration about acquired 3D image our previous research Using Optical flow, unscented Kalman filter. At this point, 3D input image is sequential continuous image as including of partially hidden range. We used Hidden Markov Model to perform the intention recognition about performance as result of restoration-based hidden range. The dynamic inference function about sequential input data have compatible properties such as hand gesture recognition include of hidden range. In this paper, for proposed intention recognition, we already had a simulation about object outline and feature extraction in the previous research, we generated temporal continuous feature vector about feature extraction and when we apply to Hidden Markov Model, make a result of simulation about hand gesture classification according to intention pattern. We got the result of hand gesture classification as value of posterior probability, and proved the accuracy outstandingness through the result.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2632-2649
• /
• 2012

Most approaches to human action recognition is limited due to the use of simple action datasets under controlled environments or focus on excessively localized features without sufficiently exploring the spatio-temporal information. This paper proposed a framework for recognizing realistic human actions. Specifically, a new action representation is proposed based on computing a rich set of descriptors from keypoint trajectories. To obtain efficient and compact representations for actions, we develop a feature fusion method to combine spatial-temporal local motion descriptors by the movement of the camera which is detected by the distribution of spatio-temporal interest points in the clips. A new topic model called Markov Semantic Model is proposed for semantic feature selection which relies on the different kinds of dependencies between words produced by "syntactic " and "semantic" constraints. The informative features are selected collaboratively based on the different types of dependencies between words produced by short range and long range constraints. Building on the nonlinear SVMs, we validate this proposed hierarchical framework on several realistic action datasets.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.121-125
• /
• 2004

In the most of recognizing systems of hand-written numbers. extraction of feature shape by using character elements shapes and a method of morphological analysis by using then extraction of feature shapes were usually used. In this paper, however, peculiar chain-code is used, and differential code which gets minimal value by differentiating the chain-code which is generated by the peculiar chain-code is made. We found this differential code is very successful in discriminating hand-written numbers according to the result of applying to most of the hand-written numbers. Testing recognition of hand-written numbers by HMM network. From the results, we can recognize of 96.1 percentage hand-written numbers but can not recognize extremely distorted hand-written numbers.

• Journal of Biomedical Engineering Research
• /
• v.25 no.3
• /
• pp.217-225
• /
• 2004

In this paper, a new automatic classification method for the normal EEC and schizophrenia EEC using hidden Markov model(HMM) is proposed. We used the feature parameters which are the variance for statistical stationary interval of the EEC and power spectrum ratio of the alpha, beta, and theta wave. The results were shown that high classification accuracy of 90.9％ in the case of normal person, and 90.5％ in the case of schizophrenia patient. It seems that proposed classification system is more efficient than the system using complicate signal processing process. Hence, the proposed method can be used at analysis and classification for complicated biosignal such as EEC and is expected to give considerable assistance to clinical diagnosis.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.43-54
• /
• 2005

This paper proposes a novel texture segmentation method using Bayesian image segmentation method and SOM(Self Organization feature Map). Multi-scale wavelet coefficients are used as the input of SOM, and likelihood and a posterior probability for observations are obtained from trained SOMs. Texture segmentation is performed by a posterior probability from trained SOMs and MAP(Maximum A Posterior) classification. And the result of texture segmentation is improved by context information. This proposed segmentation method shows better performance than segmentation method by HMT(Hidden Markov Tree) model. The texture segmentation results by SOM and multi-sclae Bayesian image segmentation technique called HMTseg also show better performance than by HMT and HMTseg.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3258-3273
• /
• 2021

Malware is a severe threat to the computing system and there's a long history of the battle between malware detection and anti-detection. Most traditional detection methods are based on static analysis with signature matching and dynamic analysis methods that are focused on sensitive behaviors. However, the usual detections have only limited effect when meeting the development of malware, so that the manual update for feature sets is essential. Besides, most of these methods match target samples with the usual feature database, which ignored the characteristics of the sample itself. In this paper, we propose a new malware detection method that could combine the features of a single sample and the general features of malware. Firstly, a structure of Directed Cyclic Graph (DCG) is adopted to extract features from samples. Then the sensitivity of each API call is computed with Markov Chain. Afterward, the graph is merged with the chain to get the final features. Finally, the detectors based on machine learning or deep learning are devised for identification. To evaluate the effect and robustness of our approach, several experiments were adopted. The results showed that the proposed method had a good performance in most tests, and the approach also had stability with the development and growth of malware.