• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.4
• /
• pp.338-343
• /
• 2015

We suggest a method to configure feature functions of continuous conditional random field (C-CRF). Regression tree and similarity analysis are introduced to construct the first and second feature functions of C-CRF, respectively. Rules from the regression tree are transformed to logic functions. If a logic in the set of rules is true for a data then it returns the corresponding value of leaf node and zero, otherwise. We build an Euclidean similarity matrix to define neighborhood, which constitute the second feature function. Using two feature functions, we make a C-CRF model and an illustrate example is provided.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7C
• /
• pp.428-434
• /
• 2011

Recently, subspace analysis has raised its performance to a higher level through the adoption of kernel-based nonlinearity. Especially, the radial basis function, based on its nonparametric nature, has shown promising results in face recognition. However, due to the endemic small sample size problem of face data, the conventional kernel-based feature extraction methods have difficulty in data representation. In this paper, we introduce a novel variant of the RBF kernel to alleviate this problem. By adopting the concept of the nearest feature line classifier, we show both effectiveness and generalizability of the proposed method, particularly regarding the small sample size issue.

• Proceedings of the KOSOMBE Conference
• /
• v.1993 no.11
• /
• pp.171-174
• /
• 1993

We propose the vocal tract area function as the feature vector of speech recognition. Vocal tract area function is directly related to speech production. The vocal tract area function is not only showing mechanism of speech production but also can be used as an effective feature vector in speech, recognition in this study.

• The Journal of the Korea Contents Association
• /
• v.8 no.9
• /
• pp.1-9
• /
• 2008

In this paper, we proposed automatic face detection and tracking which is robustness in rotation. To detect a face image in complicated background and various illuminating conditions, we used face skin color detection. we used Harris corner detector for extract facial feature points. After that, we need to track these feature points. In traditional method, Lucas-Kanade feature tracker doesn't delete useless feature points by occlusion in current scene (face rotation or out of camera). So we proposed the estimation function, which delete useless feature points. The method of delete useless feature points is estimation value at each pyramidal level. When the face was occlusion, we deleted these feature points. This can be robustness to face rotation and out of camera. In experimental results, we assess that using estimation function is better than traditional feature tracker.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.874-879
• /
• 1992

It is shown that there exists a nonlinear mappping which transforms features and their changes to the desired camera motion without measurement of the relative distance between the camera and the part, and the nonlinear mapping can eliminate several difficulties encountered when using the inverse of the feature Jacobian as in the usual feature-based visual feedback controls. And instead of analytically deriving the closed form of such a nonlinear mapping, a fuzzy membership function (FMF) based neural network is then proposed to approximate the nonlinear mapping, where the structure of proposed networks is similar to that of radial basis function neural network which is known to be very useful in function approximations. The proposed FMF network is trained to be capable of tracking moving parts in the whole work space along the line of sight. For the effective implementation of proposed IMF networks, an image feature selection processing is investigated, and required fuzzy membership functions are designed. Finally, several numerical examples are illustrated to show the validities of our proposed visual servoing method.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.9 no.1
• /
• pp.119-127
• /
• 2000

In this study the classified researches the artificial and natural flaws in welding parts are performed using the pattern recognition technology. For this purpose the signal pattern recognition package including the user defined function was developed and the total procedure including the digital signal processing feature extraction feature selection and classifi-er selection is teated by bulk,. Specially it is composed with and discussed using the statistical classifier such as the linear discriminant function the empirical Bayesian classifier. Also the pattern recognition technology is applied to classifica-tion problem of natural flaw(i.e multiple classification problem-crack lack of penetration lack of fusion porosity and slag inclusion the planar and volumetric flaw classification problem), According to this result it is possible to acquire the recognition rate of 83% above even through it is different a little according to domain extracting the feature and the classifier.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.3
• /
• pp.192-195
• /
• 2008

People have tendency of forgetting music title, though they easily remember particular part of music. If a music search system can find the title through a part of melody, this will provide very convenient interface to users. In this paper, we propose an algorithm that enables this type of search using feature transformation function. The original music is transformed to new feature information with sequential melodies. When a melody that is a part of search music is given to the system, the music retrieval system searches the music similar to the feature information of the melody. Moreover, this transformation function can be easily extended to various music recognition systems.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.156-163
• /
• 2004

In this paper, we propose an adaptive face region detection and real-time face identification algorithm using face feature evaluation function. The proposed algorithm can detect exact face region adaptively by using skin color information for races as well as intensity and elliptical masking method. And also, it improves face recognition efficiency using geometrical face feature and geometric evaluation function between features. The proposed algorithm can be used for the development of biometric and security system areas. In the experiment, the superiority of the proposed method has been tested using real image, the proposed algorithm shows more improved recognition efficiency as well as face region detection efficiency than conventional method.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.204-210
• /
• 2002

The self-organizing feature map of Kohonen has disadvantage that needs too much input patterns in order to converge into the equilibrium state when it trains. In this paper we proposed the method of improving the convergence speed and rate of self-organizing feature map converting the interaction set into Dynamic Gaussian function. The proposed method Provides us with dynamic Properties that the deviation and width of Gaussian function used as an interaction function are narrowed in proportion to learning times and learning rates that varies according to topological position from the winner neuron. In this Paper. we proposed the method of improving the convergence rate and the degree of self-organizing feature map.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.6
• /
• pp.83-90
• /
• 1994

In this paper, we propose a new learning algorithm, ASOFM(Adaptive Self Organizing Feature Map), to solve the defects of Kohonen's Self Organiaing Feature Map. Kohonen's algorithm is sometimes stranded on local minima for the initial weights. The proposed algorithm uses an object function which can evaluate the state of network in learning and adjusts the learning rate adaptively according to the evaluation of the object function. As a result, it is always guaranteed that the state of network is converged to the global minimum value and it has a capacity of generalized learning by adaptively. It is reduce that the learning time of our algorithm is about $30\%$ of Kohonen's.