• Journal of Information Processing Systems
• /
• v.16 no.1
• /
• pp.224-237
• /
• 2020

Recognition of banknote serial number is one of the important functions for intelligent banknote counter implementation and can be used for various purposes. However, the previous character recognition method is limited to use due to the font type of the banknote serial number, the variation problem by the solid status, and the recognition speed issue. In this paper, we propose an aspect ratio based character region segmentation and a convolutional neural network (CNN) based banknote serial number recognition method. In order to detect the character region, the character area is determined based on the aspect ratio of each character in the serial number candidate area after the banknote area detection and de-skewing process is performed. Then, we designed and compared four types of CNN models and determined the best model for serial number recognition. Experimental results showed that the recognition accuracy of each character was 99.85%. In addition, it was confirmed that the recognition performance is improved as a result of performing data augmentation. The banknote used in the experiment is Indian rupee, which is badly soiled and the font of characters is unusual, therefore it can be regarded to have good performance. Recognition speed was also enough to run in real time on a device that counts 800 banknotes per minute.

• Speech Sciences
• /
• v.12 no.3
• /
• pp.115-124
• /
• 2005

We investigated on the submission of multiple candidates in speaker-independent speech recognition by VQ/HMM. Submission of fixed number of multiple candidates has first been examined. As the number of candidates increases by two, three, and four, the recognition error rates were found to decrease by 41%, 58%, and 65%, respectively compared to that of a single candidate. We tried another approach that the candidates within a range of Viterbi scores are submitted. The number of candidates showed geometric increase as the admitted range becomes large. For a practical application, a combination of the above two methods was also studied. We chose the candidates within some range of Viterbi scores and limited the maximum number of candidates submitted to five. Experimental results showed that recognition error rates of less than 10% could be achieved with average number of candidates of 3.2 by this method.

• Journal of the Korean Society of Industry Convergence
• /
• v.18 no.4
• /
• pp.250-258
• /
• 2015

In this research, we proposed a new approach to implement the real-time motion control of biped robot based on voice command for unmanned FA. Voice is one of convenient methods to communicate between human and robots. To command a lot of robot task by voice, voice of the same number have to be able to be recognition voice is, the higher the time of recognition is. In this paper, a practical voice recognition system which can recognition a lot of task commands is proposed. The proposed system consists of a general purpose microprocessor and a useful voice recognition processor which can recognize a limited number of voice patterns. Given biped robots, each robot task is, classified and organized such that the number of robot tasks under each directory is net more than the maximum recognition number of the voice recognition processor so that robot tasks under each directory can be distinguished by the voice recognition command. By simulation and experiment, it was illustrated the reliability of voice recognition rates for application of the manufacturing process.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.11
• /
• pp.2103-2107
• /
• 2010

This paper deals with the recognition of multiple mobile robots equipped with RFID tag. In the case that the number of robots recognized by each RFID reader is larger than that of allocated slots, the clashing recognition occurs. And, in the case that the total number of robots recognized by all RFID reader is larger than that of real robots, the repetitious recognition occurs. We employ the dynamic frame slot allocation by using the ALOHA algorithm to prevent the clashing recognition and estimate the number of robots by using the received signal strength indication to prevent the repetitious recognition. The numerical experiment shows the reliability and the efficiency of the proposed method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.11
• /
• pp.1782-1793
• /
• 1989

Stroke crossing number, syntactic pattern recognition procedure, top down recognition structure, and heuristic approach are studied for the Korean text recognition. We propose new algorithms: 1)Korean vowel seperation using limited scanning method in the Korean characters, 2) extracting strokes using stroke width method, 3) stroke crossing number and its properties, 4) average, standard deviation, and mode of stroke crossing number, and 5) classification and recognition methods of limited chinese character. These are studied with computer simuladtions and experiments.

• Phonetics and Speech Sciences
• /
• v.1 no.2
• /
• pp.3-8
• /
• 2009

In an effort to improve speech recognition, we investigated the effect of the number of clusters. In usual LBG clustering, the number of codebook clusters is doubled on each bifurcation and hence cannot be chosen arbitrarily in a natural way. To have the number of clusters at our control, we combined adaptive resonance theory (ART2) with LBG and perform the clustering in two stages. The codebook thus formed was used in subsequent processing of fuzzy vector quantization (FVQ) and HMM for speech recognition tests. Compared to conventional LBG, our method was shown to reduce the best recognition error rate by 0${\sim$}0.9% depending on the vocabulary size. The result also showed that between 400 and 800 would be the optimal number of clusters in the limit of small and large vocabulary speech recognitions of isolated words, respectively.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.14 no.1
• /
• pp.57-66
• /
• 2010

In this paper, we develop the Automatic Number Plate Recognition (ANPR) System. ANPR is generally composed of the following four steps: i) The acquisition of the image; ii) The extraction of the region of the number plate; iii) The partition of the number and iv) The recognition. The second and third steps incorporate image processing technique. We propose to resolve this by using Partial Differential Equation(PDE) based segmentation method. This method is computationally efficient and robust. Results indicate that our methods are capable to recognize the plate number on difficult situations.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.785-788
• /
• 2000

The recognition system of a car plate is largely classified as the extraction and recognition of number plate. In this paper, we extract the number plate domain by using a thresholding method as a preprocess step. The computation of the density in a given mask provides a clue of a candidate domain whose density ratio corresponds to the properties of the number plate obtained in the best condition. The contour of the number plate for the recognition of the texts of number plate is extracted by operating Kohonen Algorithm in a localized region. The algorithm reduces noises around the contour. The recognition system with the density computation and Kohonen Algorithm shows a high performance in the real system in connection with a car number plate.

• Speech Sciences
• /
• v.8 no.4
• /
• pp.17-33
• /
• 2001

In this paper, we implement the large variable vocabulary speech recognition system, which is characterized by no additional pre-training process and no limitation of recognized word list. We have designed the system in order to achieve the high recognition rate using the decision tree based state tying algorithm and in order to reduce the processing time using the gaussian selection based variable flooring algorithm, the limitation algorithm of the number of nodes and ENNS algorithm. The gaussian selection based variable flooring algorithm shows that it can reduce the total processing time by more than half of the recognition time, but it brings about the reduction of recognition rate. In other words, there is a trade off between the recognition rate and the processing time. The limitation algorithm of the number of nodes shows the best performance when the number of gaussian mixtures is a three. Both of the off-line and on-line experiments show the same performance. In our experiments, there are some differences of the recognition rate and the average recognition time according to the distinction of genders, speakers, and the number of vocabulary.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.4
• /
• pp.704-710
• /
• 2016

In this paper, we proposed pole position detection system for providing exact location information to users. The proposed system consists of pole recognition part and pole number recognition part. Above all, exact pole recognition is carried out by PDD(Pole Detection Device). And recognition of pole number is performed by PID(Pole Inspection Device). Acquired image by using line scan camera is judged whether it is free bracket or not through image processing. When it is judged as free bracket, pole number image is acquired by OCR camera and recognized by OCR. By recognizing pole number, exact location information is provided to user.