• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.558-561
• /
• 2009

In this paper, we propose Simple Frame Marker(SFMarker) to support recognition of characters and images included in a marker in augmented reality. If characters are inserted inside of marker and are recognised using Optical Character Recognition(OCR), it doesn't need marker learning process before an execution. It also reduces visual disturbance compared to 2D barcode marker due to familarity of characters. Therefore, proposed SFMarker distinguishes Square SFMarker that embeds images from Rectangle SFMarker with characters according to ratio of marker and applies different recognition algorithms. Also, in order to reduce preprocessing of character recognition, SFMarker inserts direction information in border of marker and extracts it to execute character recognition fast and correctly. Finally, since the character recognition for every frame slows down tracking speed, we increase the speed of recognition process using the result of character recognition in previous frame when frame difference is low.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.216-223
• /
• 2003

In this paper, we present SCCRS(Speech and Character Combined Recognition System) for speaker /writer independent. on-line multimodal interfaces. In general, it has been known that the CHMM(Continuous Hidden Markov Mode] ) is very useful method for speech recognition and on-line character recognition, respectively. In the proposed method, the same CHMM is applied to both speech and character recognition, so as to construct a combined system. For such a purpose, 115 CHMM having 3 states and 9 transitions are constructed using MLE(Maximum Likelihood Estimation) algorithm. Different features are extracted for speech and character recognition: MFCC(Mel Frequency Cepstrum Coefficient) Is used for speech in the preprocessing, while position parameter is utilized for cursive character At recognition step, the proposed SCCRS employs OPDP (One Pass Dynamic Programming), so as to be a practical combined recognition system. Experimental results show that the recognition rates for voice phoneme, voice word, cursive character grapheme, and cursive character word are 51.65%, 88.6%, 85.3%, and 85.6%, respectively, when not using any language models. It demonstrates the efficiency of the proposed system.

• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.777-784
• /
• 2003

In this Paper. we propose a recognition method of machine printed characters based on the combination of recognition units using multiple neural networks. In our recognition method, the input character is classified into one of 7 character types among which the first 6 types are for Hangul character and the last type is for non-Hangul characters. Hangul characters are recognized by several MLP (multilayer perceptron) neural networks through two stages. In the first stage, we divide Hangul character image into two or three recognition units (HRU : Hangul recognition unit) according to the combination fashion of graphemes. Each recognition unit composed of one or two graphemes is recognized by an MLP neural network with an input feature vector of pixel direction angles. In the second stage, the recognition aspect features of the HRU MLP recognizers in the first stage are extracted and forwarded to a subsequent MLP by which final recognition result is obtained. For the recognition of non-Hangul characters, a single MLP is employed. The recognition experiments had been performed on the character image database collected from 50,000 real letter envelope images. The experimental results have demonstrated the superiority of the proposed method.

• International Journal of Ocean System Engineering
• /
• v.2 no.1
• /
• pp.16-23
• /
• 2012

In this paper we discussed a new methodology for Urdu Character Recognition system using Dempster-Shafer theory which can powerfully estimate the similarity ratings between a recognized character and sampling characters in the character database. Recognition of character is done by five probability calculation methods such as (similarity, hamming, linear correlation, cross-correlation, nearest neighbor) with Dempster-Shafer theory of belief functions. The main objective of this paper is to Recognition of Urdu letters and numerals through five similarity and dissimilarity algorithms to find the similarity between the given image and the standard template in the character recognition system. In this paper we develop a method to combine the results of the different distance measurement methods using the Dempster-Shafer theory. This idea enables us to obtain a single precision result. It was observed that the combination of these results ultimately enhanced the success rate.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2515-2517
• /
• 2002

The process of character recognition goes through 5 steps; image acquisition, character region extraction, preprocessing, character region segmentation, character recognition. Therefore the final recognition rate of character recognition is directly affected by the performance of each step. This paper is a leading research for object recognition using image processing algorithm which is one of the field of study in computer vision. And this paper will suggest an algorithm to extract the portion of number chain, which is part of the research embodying a system to perceive the data of manufacture and the name of the producer on the wrapping of groceries. In addition, this can extract the number chain comparatively accurate without using many complex algorithm by diving and extracting the moving number region at the same time.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.129-131
• /
• 2006

The performances of neural network systems mainly depend on the kind and the number of input patterns for its training. Hence, the kind of input patterns as well as its number is very important for the character recognition system using back-propagation network. The more input patters are used, the better the system recognizes various characters. However, training is not always successful as the number of input patters increases. Moreover, there exists a limit to consider many input patterns of the recognition system for cursive script characters. In this paper we present a new character recognition system using the back-propagation neural networks. By using an additional neural network, an input pattern generation method is provided for increasing the recognition ratio and a successful training. We firstly introduce the structure of the proposed system. Then, the character recognition system is investigated through some experiments.

• KIEE International Transaction on Systems and Control
• /
• v.12D no.1
• /
• pp.27-32
• /
• 2002

In this paper, we would study the applicability of neural networks to the recognition process of Korean stenographic character image, applying the classification function, which is the greatest merit of those of neural networks applied to the various parts so far, to the stenographic character recognition, relatively simple classification work. Korean stenographic recognition algorithms, which recognize the characters by using some methods, have a quantitative problem that despite the simplicity of the structure, a lot of basic characters are impossible to classify into a type. They also have qualitative one that It Is not easy to classify characters fur the delicacy of the character farms. Even though this is the result of experiment under the limited environment of the basic characters, this shows the possibility that the stenographic characters can be recolonized effectively by neural network system. In this system, we got 90.86% recognition rate as an average.

• Journal of the Semiconductor & Display Technology
• /
• v.20 no.3
• /
• pp.6-10
• /
• 2021

Recognition of characters printed or marked on the PCB components from images captured using cameras is an important task in PCB components inspection systems. Previous optical character recognition (OCR) of PCB components typically consists of two stages: character segmentation and classification of each segmented character. However, character segmentation often fails due to corrupted characters, low image contrast, etc. Thus, OCR without character segmentation is desirable and increasingly used via deep neural networks. Typical implementation based on deep neural nets without character segmentation includes convolutional neural network followed by recurrent neural network (RNN). However, one disadvantage of this approach is slow execution due to RNN layers. LPRNet is a segmentation-free character recognition network with excellent accuracy proved in license plate recognition. LPRNet uses a wide convolution instead of RNN, thus enabling fast inference. In this paper, LPRNet was adapted for recognizing characters printed on PCB components with fast execution and high accuracy. Initial training with synthetic images followed by fine-tuning on real text images yielded accurate recognition. This net can be further optimized on Intel CPU using OpenVINO tool kit. The optimized version of the network can be run in real-time faster than even GPU.

• International Journal of Advanced Culture Technology
• /
• v.7 no.2
• /
• pp.209-217
• /
• 2019

Due to the development of artificial intelligence and image recognition technology that play important roles in the field of 4th industry, office automation systems and unmanned automation systems are rapidly spreading in human society. The proposed algorithm first finds the variances of the differences between the tile values constituting the learning characters and the experimental character and then recognizes the experimental character according to the distribution of the three learning characters with the smallest variances. In more detail, for 100 learning data characters and 10 experimental data characters, each character is defined as the number of black pixels belonging to 15 tile areas. For each character constituting the experimental data, the variance of the differences of the tile values of 100 learning data characters is obtained and then arranged in the ascending order. After that, three learning data characters with the minimum variance values are selected, and the final recognition result for the given experimental character is selected according to the distribution of these character types. Moreover, we compare the recognition result with the result made by a neural network of basic structure. It is confirmed that satisfactory recognition results are obtained through the processes that subdivide the learning characters and experiment characters into tile sizes and then select the recognition result using variances.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.375-382
• /
• 2002

Handwritten character recognition is classified into on-line handwritten character recognition and off-line handwritten character recognition. On-line handwritten character recognition has made a remarkable outcome compared to off-line hacdwritten character recognition. This method can acquire the dynamic written information such as the writing order and the position of a stroke by means of pen-based electronic input device such as a tablet board. On the contrary, Any dynamic information can not be acquired in off-line handwritten character recognition since there are extreme overlapping between consonants and vowels, and heavily noisy images between strokes, which change the recognition performance with the result of the preprocessing. This paper proposes a method that effectively extracts the stroke including dynamic information of characters for off-line Korean handwritten character recognition. First of all, this method makes improvement and binarization of input handwritten character image as preprocessing procedure using watershed algorithm. The next procedure is extraction of skeleton by using the transformed Lu and Wang's thinning: algorithm, and segment pixel array is extracted by abstracting the feature point of the characters. Then, the vectorization is executed with a maximum permission error method. In the case that a few strokes are bound in a segment, a segment pixel array is divided with two or more segment vectors. In order to reconstruct the extracted segment vector with a complete stroke, the directional component of the vector is mortified by using right-hand writing coordinate system. With combination of segment vectors which are adjacent and can be combined, the reconstruction of complete stroke is made out which is suitable for character recognition. As experimentation, it is verified that the proposed method is suitable for handwritten Korean character recognition.