• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.743-748
• /
• 2004

In this paper, we propose a probabilistic Korean parsing model using a syntactic feature, a functional feature, a content feature, and a site feature of a syntactic object for effective syntactic disambiguation. It restricts grammar rules to binary-oriented form to deal with Korean properties such as variable word order and constituent ellipsis. In experiments, we analyze the parsing performance of each feature combination. Experimental results show that the combination of different features is preferred to the combination of similar features. Besides, it is remarkable that the function feature is more useful than the combination of the content feature and the size feature.

• Journal of Multimedia Information System
• /
• v.9 no.1
• /
• pp.1-10
• /
• 2022

China is a big country in animal fur industry. The total production and consumption of fur are increasing year by year. However, the recognition of fur in the fur production process still mainly relies on the visual identification of skilled workers, and the stability and consistency of products cannot be guaranteed. In response to this problem, this paper proposes a feature fusion-based animal fur recognition network on the basis of typical convolutional neural network structure, relying on rapidly developing deep learning techniques. This network superimposes texture feature - the most prominent feature of fur image - into the channel dimension of input image. The output feature map of the first layer convolution is inverted to obtain the inverted feature map and concat it into the original output feature map, then Leaky ReLU is used for activation, which makes full use of the texture information of fur image and the inverted feature information. Experimental results show that the algorithm improves the recognition accuracy by 9.08% on Fur_Recognition dataset and 6.41% on CIFAR-10 dataset. The algorithm in this paper can change the current situation that fur recognition relies on manual visual method to classify, and can lay foundation for improving the efficiency of fur production technology.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.281-286
• /
• 2003

A large number of features are collected for problem solving in real life, but to utilize ail the features collected would be difficult. It is not so easy to collect of correct data about all features. In case it takes advantage of all collected data to learn, complicated learning model is created and good performance result can't get. Also exist interrelationships or hierarchical relations among the features. We can reduce feature's number analyzing relation among the features using heuristic knowledge or statistical method. Heuristic technique refers to learning through repetitive trial and errors and experience. Experts can approach to relevant problem domain through opinion collection process by experience. These properties can be utilized to reduce the number of feature used in learning. Experts generate a new feature (highly abstract) using raw data. This paper describes machine learning model that reduce the number of features used in learning using heuristic function and use abstracted feature by neural network's input value. We have applied this model to the win/lose prediction in pro-baseball games. The result shows the model mixing two techniques not only reduces the complexity of the neural network model but also significantly improves the classification accuracy than when neural network and heuristic model are used separately.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2511-2520
• /
• 2018

In this study, Multi-Radial Basis Function Support Vector Machine (Multi-RBF SVM) classifier is introduced based on a composite kernel function. In the proposed multi-RBF support vector machine classifier, the input space is divided into several local subsets considered for extremely nonlinear classification tasks. Each local subset is expressed as nonlinear classification subspace and mapped into feature space by using kernel function. The composite kernel function employs the dual RBF structure. By capturing the nonlinear distribution knowledge of local subsets, the training data is mapped into higher feature space, then Multi-SVM classifier is realized by using the composite kernel function through optimization procedure similar to conventional SVM classifier. The original training data set is partitioned by using some unsupervised learning methods such as clustering methods. In this study, three types of clustering method are considered such as Affinity propagation (AP), Hard C-Mean (HCM) and Iterative Self-Organizing Data Analysis Technique Algorithm (ISODATA). Experimental results on benchmark machine learning datasets show that the proposed method improves the classification performance efficiently.

• Journal of Korean Medical classics
• /
• v.33 no.2
• /
• pp.51-59
• /
• 2020

Objectives : We would like to study what is the most appropriate "feature" to effectively perform authorship attribution of the text of Traditional East Asian Medicine Methods : The authorship attribution performance of the Support Vector Machine (SVM) was compared by cross validation, depending on whether the function words or content words, single word or collocations, and IDF weights were applied or not, using 'Variorum of the Nanjing' as an experimental Corpus. Results : When using the combination of 'function words/uni-bigram/TF', the performance was best with accuracy of 0.732, and the combination of 'content words/unigram/TFIDF' showed the lowest accuracy of 0.351. Conclusions : This shows the following facts from the authorship attribution of the text of East Asian traditional medicine. First, function words play an important role in comparison to content words. Second, collocations was relatively important in content words, but single words have more important meanings in function words. Third, unlike general text analysis, IDF weighting resulted in worse performance.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.10
• /
• pp.3038-3047
• /
• 1996

In telerobot systems, visual servoing of a task object for a slave arm with an eye-in-hand has drawn an interesting attention. As such a task ingenerally conducted in an unstructured environment, it is very difficult to define the inverse feature Jacobian matrix. To overcome this difficulty, this paper proposes an auto-tuning fuzzy rule-based visual servo algorithm. In this algorithm, a visual servo controller composed of fuzzy rules, receives feature errors as inputs and generates the change of have position as outputs. The fuzzy rules are tuned by using steepest gradient method of the cost function, which is defined as a quadratic function of feature errors. Since the fuzzy rules are tuned automatically, this method can be applied to the visual servoing of a slave arm in real time. The effctiveness of the proposed algorithm is verified through a series of simulations and experiments. The results show that through the learning procedure, the slave arm and track object in real time with reasonable accuracy.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.416-423
• /
• 2000

The existing self-organizing feature map of Kohonen has weakpoint that need too much input patterns in order to converse into the learning rate and equilibrium state when it trains. Making up for the current weak point, B.Bavarian suggested the method of that distributed the learning rate such as Gaussian function. However, this method has also a disadvantage which can not achieve the right self-organizing. In this paper, we proposed the method of improving the convergence speed and the convergence rate of self-organizing feature map converting the Gaussian function into dynamic approximate curve used in when trains the self-organizing feature map.

• Journal of Communications and Networks
• /
• v.17 no.5
• /
• pp.491-498
• /
• 2015

Recognition of radar emitter signals is one of core elements in radar reconnaissance systems. A novel method based on singular value decomposition (SVD) and the main ridge slice of ambiguity function (AF) is presented for attaining a higher correct recognition rate of radar emitter signals in case of low signal-to-noise ratio. This method calculates the AF of the sorted signal and ascertains the main ridge slice envelope. To improve the recognition performance, SVD is employed to eliminate the influence of noise on the main ridge slice envelope. The rotation angle and symmetric Holder coefficients of the main ridge slice envelope are extracted as the elements of the feature vector. And kernel fuzzy c-means clustering is adopted to analyze the feature vector and classify different types of radar signals. Simulation results indicate that the feature vector extracted by the proposed method has satisfactory aggregation within class, separability between classes, and stability. Compared to existing methods, the proposed feature recognition method can achieve a higher correct recognition rate.

• Journal of the Semiconductor & Display Technology
• /
• v.15 no.2
• /
• pp.61-65
• /
• 2016

Facial feature detection is a fundamental function in the field of computer vision such as security, bio-metrics, 3D modeling, and face recognition. There are many algorithms for the function, active shape model is one of the most popular local texture models. This paper addresses issues related to face detection, and implements an efficient extraction algorithm for extracting the facial feature points to use on iOS platform. In this paper, we extend the original ASM algorithm to improve its performance by four modifications. First, to detect a face and to initialize the shape model, we apply a face detection API provided from iOS CoreImage framework. Second, we construct a weighted local structure model for landmarks to utilize the edge points of the face contour. Third, we build a modified model definition and fitting more landmarks than the classical ASM. And last, we extend and build two-dimensional profile model for detecting faces within input images. The proposed algorithm is evaluated on experimental test set containing over 500 face images, and found to successfully extract facial feature points, clearly outperforming the original ASM.

• Communications for Statistical Applications and Methods
• /
• v.12 no.2
• /
• pp.453-462
• /
• 2005

We derive the influence function on t statistic and find its feature; the influence function on t statistic has two forms depending on the value of ${\mu}_0$. Sample influence functions are used to verify the validity of the derived influence function. We use random samples from normal distribution to show the validity of the function. The simulation study proves that the obtained influence function is very accurate to in estimating changes in t statistic when an observation is added or deleted.