• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.607-609
• /
• 2011

In this work, we present solutions of two problems. First, the representation of pattern recognition problem in the standard $T_{nml}$ table of the algorithm estimate calculation was considered. Second, the problem of finding the model, consisting of the optimal parameters of an algorithm was considered. Such procedure is carried out by the selection optimal values of the parameters of extreme algorithms. This serves to reduce the number of calculations in the algorithms of estimate calculation and to increase the quality of recognition process. The algorithmic data base of the developed system was based on mathematical apparatus of pattern recognition.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.11
• /
• pp.1864-1872
• /
• 2003

Hidden Markov Model(HMM) has been widely used in speech recognition, however, its use in machine condition monitoring has been very limited despite its good potential. In this paper, HMM is used to recognize rotor fault pattern. First, we set up rotor kit under unbalance and oil whirl conditions. Time signals of two failure conditions were sampled and translated to auto power spectrums. Using filter bank, feature vectors were calculated from these auto power spectrums. Next, continuous HMM and discrete HMM were trained with scaled forward/backward variables and diagonal covariance matrix. Finally, each HMM was applied to all sampled data to prove fault recognition ability. It was found that HMM has good recognition ability despite of small number of training data set in rotor fault pattern recognition.

• Journal of Biosystems Engineering
• /
• v.38 no.1
• /
• pp.55-63
• /
• 2013

Purpose: The present study aimed at image processing methods for automatic cell pattern recognition and morphological analysis for tissue engineering applications. The primary aim was to ascertain the novel algorithm of adaptive brightness correction from microscopic images for use as a potential image analysis. Methods: General microscopic image of cells has a minor problem which the central area is brighter than edge-area because of the light source. This may affect serious problems to threshold process for cell-number counting or cell pattern recognition. In order to compensate the problem, we processed to find the central point of brightness and give less weight-value as the distance to centroid. Results: The results presented that microscopic images through the brightness correction were performed clearer than those without brightness compensation. And the classification of mixed cells was performed as well, which is expected to be completed with pattern recognition later. Beside each detection ratio of hBMSCs and HeLa cells was 95% and 92%, respectively. Conclusions: Using this novel algorithm of adaptive brightness correction could control the easier approach to cell pattern recognition and counting cell numbers.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.936-940
• /
• 1987

This paper describes the recognition boundary of Hangeul character to interpret variance factor in accordance with various combination. When the recognition algorithm based on comparing the MSE value with the one of the standard pattern in $16{\times}16$ images is performed, we come to a conclusion that we have towe must make a decision MSE value above 34 in order to achive theve recognition rate larger than 90%. Also we understand that varing component coordinates method based on statistical process of each character pattern is preferred.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.1
• /
• pp.185-196
• /
• 1999

In this dissertation, a new off-line recognition system is proposed using a subgraph pattern, neural network. After thinning is applied to input characters, balance having a noise elimination function on location is performed. Then as the first step for recognition procedure, circular elements are extracted and recognized. From the subblock HT, space feature points such as endpoint, flex point, bridge point are extracted and a subgraph pattern is formed observing the relations among them. A region where vowel can exist is allocated and a candidate point of the vowel is extracted. Then, using the subgraph pattern dictionary, a vowel is recognized. A same method is applied to extract horizontal vowels and the vowel is recognized through a simple structural analysis. For verification of recognition subgraph in this paper, experiments are done with the most frequently used Myngjo font, Gothic font for printed characters and handwritten characters. In case of Gothic font, character recognition rate was 98.9%. For Myngjo font characters, the recognition rate was 98.2%. For handwritten characters, the recognition rate was 92.5%. The total recognition rate was 94.8% with mixed handwriting and printing characters for multi-font recognition.

• Journal of Biosystems Engineering
• /
• v.27 no.2
• /
• pp.151-160
• /
• 2002

Cow image processing technique would be useful not only for recognizing an individual but also for establishing the image database and analyzing the shape of cows. A cow (Holstein) has usually the unique speckle pattern. In this study, the individual recognition of cow was carried out using the speckle pattern and the content-based image retrieval technique. Sixty cow images of 16 heads were captured under outdoor illumination, which were complicated images due to shadow, obstacles and walking posture of cow. Sixteen images were selected as the reference image for each cow and 44 query images were used for evaluating the efficiency of individual recognition by matching to each reference image. Run-lengths and positions of runs across speckle area were calculated from 40 horizontal line profiles for ROI (region of interest) in a cow body image after 3 passes of 5$\times$5 median filtering. A similarity measure for recognizing cow individuals was calculated using Euclidean distance of normalized G-frame histogram (GH). normalized speckle run-length (BRL), normalized x and y positions (BRX, BRY) of speckle runs. This study evaluated the efficiency of individual recognition of cow using Recall(Success rate) and AVRR(Average rank of relevant images). Success rate of individual recognition was 100% when GH, BRL, BRX and BRY were used as image query indices. It was concluded that the histogram as global property and the information of speckle runs as local properties were good image features for individual recognition and the developed system of individual recognition was reliable.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.675-678
• /
• 1988

This paper describes the method of syntactic-semantic pattern recognition and description for two dimensional object which is adjusted or changed in size and its orientation. To avoid the complexity and ambiguity which is arised in the case of syntactic or decision-theoretic method is used individually, an attributed grammar is introduced which applies computative attributes to pattern primitives, and then uses decision-theoretic method for attributes and syntactic method for pattern structure. A primitive extraction embedding parsing and grobal rule for classification is also applied for more effective pattern recognition and description.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1125-1128
• /
• 1993

We propose the new method about the neural-based pattern recognition by using Hadamard transform for the improvement of learning speed, stability and flexibility of network. We can obtain the spatial feature of pattern by Hadamard transformed pattern. We carried out an experiment to estimate the effect of Hadamard transform. We tried the learning of numeric patterns, and tried the pattern recognition with noisy pattern. As a result, the learning times of the network for the 'Hadamard' case is smaller than that of usual case. And the recognition rate of the network for the 'Hadamard' case is higher than that of usual case, too.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.3
• /
• pp.205-208
• /
• 2013

Generally, binary pattern transforms have been used in the field of the face recognition and facial expression, since they are robust to illumination. Thus, this paper proposes an illumination-robust face recognition system combining an MLDP, which improves the texture component of the LDP, and a 2D-PCA algorithm. Unlike that binary pattern transforms such as LBP and LDP were used to extract histogram features, the proposed method directly uses the MLDP image for feature extraction by 2D-PCA. The performance evaluation of proposed method was carried out using various algorithms such as PCA, 2D-PCA and Gabor wavelets-based LBP on Yale B and CMU-PIE databases which were constructed under varying lighting condition. From the experimental results, we confirmed that the proposed method showed the best recognition accuracy.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.3
• /
• pp.284-288
• /
• 2006

In this paper, we apply several pattern recognition algorithms to emotion recognition system with speech signal and compare the results. Firstly, we need emotional speech databases. Also, speech features for emotion recognition is determined on the database analysis step. Secondly, recognition algorithms are applied to these speech features. The algorithms we try are artificial neural network, Bayesian learning, Principal Component Analysis, LBG algorithm. Thereafter, the performance gap of these methods is presented on the experiment result section. Truly, emotion recognition technique is not mature. That is, the emotion feature selection, relevant classification method selection, all these problems are disputable. So, we wish this paper to be a reference for the disputes.