• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.995-998
• /
• 2002

In this paper, we present a fast algorithm for hand gesture recognition of a human from an image by using the directivity information of the fingers. To implement a fast recognition system, we applied the morphological shape decomposition. A proposed gesture recognition algorithm has been tested on the 300 ${\times}$ 256 digital images. Our experiments using image acquired image camera have shown that the proposed hand gesture recognition algorithm is effective.

• Smart Media Journal
• /
• v.2 no.4
• /
• pp.20-26
• /
• 2013

This paper presents an approach to Mongolian car plate recognition using artificial neural network. Our proposed method consists of two steps: detection and recognition. In detection step, we implement Flood fill algorithm. In recognition step we proceed to segment the plate for each Cyrillic character, and use an Artificial Neural Network (ANN) machine - learning algorithm to recognize the character. We have learned the theory of ANN and implemented it without using any library. A total of 150 vehicles images obtained from community entrance gates have been tested. The recognition algorithm shows an accuracy rate of 89.75%.

• Journal of Korea Multimedia Society
• /
• v.16 no.11
• /
• pp.1338-1347
• /
• 2013

Face recognition is a science of automatically identifying individuals based their unique facial features. In order to avoid overfitting and reduce the computational reduce the computational burden, a new face recognition algorithm using PCA-fisher linear discriminant (PCA-FLD) and fuzzy radial basis function neural network (RBFNN) is proposed in this paper. First, face features are extracted by the principal component analysis (PCA) method. Then, the extracted features are further processed by the Fisher's linear discriminant technique to acquire lower-dimensional discriminant patterns, the processed features will be considered as the input of the fuzzy RBFNN. As a widely applied algorithm in fuzzy RBF neural network, BP learning algorithm has the low rate of convergence, therefore, an improved learning algorithm based on Levenberg-Marquart (L-M) for fuzzy RBF neural network is introduced in this paper, which combined the Gradient Descent algorithm with the Gauss-Newton algorithm. Experimental results on the ORL face database demonstrate that the proposed algorithm has satisfactory performance and high recognition rate.

• Journal of Auto-vehicle Safety Association
• /
• v.14 no.4
• /
• pp.6-15
• /
• 2022

In this study, a traffic light recognition algorithm was implemented and validated for low-speed special purpose vehicles in an urban environment. Real-time image data using a camera and YOLO algorithm were applied. Two methods were presented to increase the accuracy of the traffic light recognition algorithm, and it was confirmed that the second method had the higher accuracy according to the traffic light type. In addition, it was confirmed that the optimal YOLO algorithm was YOLO v5m, which has over 98% mAP values and higher efficiency. In the future, it is thought that the traffic light recognition algorithm can be used as a dual system to secure the platform safety in the traffic information error of C-ITS.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.4
• /
• pp.219-225
• /
• 2013

This paper presents a method using Maximum-Likelihood Linear Regression (MLLR) adaptation to improve recognition performance of Limabeam algorithm for speech recognition using microphone array. From our investigation on Limabeam algorithm, we can see that the performance of filtering optimization depends strongly on the supporting optimal state sequence and this sequence is created by using Viterbi algorithm trained with HMM model. So we propose an approach using MLLR adaptation for the recognition of speech uttered in a new environment to obtain better optimal state sequence that support for the filtering parameters' optimal step. Experimental results show that the system embedded with MLLR adaptation presents the word correct recognition rate 2% higher than that of original calibrate Limabeam and also present 7% higher than that of Delay and Sum algorithm. The best recognition accuracy of 89.4% is obtained when we use 4 microphones with 5 utterances for adaptation.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.1E
• /
• pp.21-26
• /
• 2007

In this paper, we propose a modified Viterbi algorithm to compensate for endpoint detection error during the decoding phase of an isolated word recognition task. Since the conventional Viterbi algorithm explores only the search space whose boundaries are fixed to the endpoints of the segmented utterance by the endpoint detector, the recognition performance is highly dependent on the accuracy level of endpoint detection. Inaccurately segmented word boundaries lead directly to recognition error. In order to relax the degradation of recognition accuracy due to endpoint detection error, we describe an unconstrained search of word boundaries and present an algorithm to explore the search space with efficiency. The proposed algorithm was evaluated by performing a variety of simulated endpoint detection error cases on an isolated word recognition task. The proposed algorithm reduced the Word Error Rate (WER) considerably, from 84.4% to 10.6%, while consuming only a little more computation power.

• Journal of Information Processing Systems
• /
• v.19 no.4
• /
• pp.554-562
• /
• 2023

This research offers a sports video action recognition approach based on the fish swarm algorithm in light of the low accuracy of existing sports video action recognition methods. A modified fish swarm algorithm is proposed to construct invariant features and decrease the dimension of features. Based on this algorithm, local features and global features can be classified. The experimental findings on the typical sports action data set demonstrate that the key details of sports action can be successfully retained by the dimensionality-reduced fusion invariant characteristics. According to this research, the average recognition time of the proposed method for walking, running, squatting, sitting, and bending is less than 326 seconds, and the average recognition rate is higher than 94%. This proves that this method can significantly improve the performance and efficiency of online sports video motion recognition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5605-5623
• /
• 2016

We propose a face recognition method that utilizes the LCP face descriptor. The proposed method applies a LoG mask to extract a face contour response, and employs the LCP algorithm to produce a binary pattern representation that ensures high recognition performance even under the changes in illumination, noise, and aging. The proposed LCP algorithm produces excellent noise reduction and efficiency in removing unnecessary information from the face by extracting a face contour response using the LoG mask, whose behavior is similar to the human eye. Majority of reported algorithms search for face contour response information. On the other hand, our proposed LCP algorithm produces results expressing major facial information by applying the threshold to the search area with only 8 bits. However, the LCP algorithm produces results that express major facial information with only 8-bits by applying a threshold value to the search area. Therefore, compared to previous approaches, the LCP algorithm maintains a consistent accuracy under varying circumstances, and produces a high face recognition rate with a relatively small feature vector. The test results indicate that the LCP algorithm produces a higher facial recognition rate than the rate of human visual's recognition capability, and outperforms the existing methods.

• Journal of information and communication convergence engineering
• /
• v.6 no.4
• /
• pp.444-447
• /
• 2008

In this paper, we proposed the recognition system of car license plates to mitigate traffic problems. The processing sequence of the proposed algorithm is as follows. At first, a license plate segment is extracted from an acquired car image using morphological features and color information, and noises are eliminated from the extracted license plate segment using line scan algorithm and Grassfire algorithm, and then individual codes are extracted from the license plate segment using edge tracking algorithm. Finally the extracted individual codes are recognized by an FCM algorithm. In order to evaluate performance of segment extraction and code recognition of the proposed method, we used 100 car images for experiment. In the results, we could verify the proposed method is more effective and recognition performance is improved in comparison with conventional car license plate recognition methods.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.4
• /
• pp.453-458
• /
• 2003

The anomaly-detection algorithm based on negative selection of T cells is representative model among self-recognition methods and it has been applied to computer immune systems in recent years. In immune systems, T cells are produced through both positive and negative selection. Positive selection is the process used to determine a MHC receptor that recognizes self-molecules. Negative selection is the process used to determine an antigen receptor that recognizes antigen, or the nonself cell. In this paper, we propose a novel self-recognition algorithm based on the positive selection of T cells. We indicate the effectiveness of the proposed algorithm by change-detection simulation of some infected data obtained from cell changes and string changes in the self-file. We also compare the self-recognition algorithm based on positive selection with the anomaly-detection algorithm.