• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.8
• /
• pp.35-43
• /
• 1992

We have presented the tracing algorithm for center pixel of character image. Character image was read by scanner device. Performing the tracing process, it can be possible to detect feature points, such as branch point, stroke of 4 directions. So, the tracing process covers the thinning and feature point detection process for improving the processing time. Usage of suggested tracing algorithm instead of thinning that is the preprocessing of character recognition increases speed up to 5 times. The preprocessing chip has been designed by using single layer perceptron algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.27-37
• /
• 1991

A recognition algorithm for Hangul is developed by structural analysis to Hangul in this theses. Four major procedures are proposed : preprocessing, type classification, separation of consonant and vowel, recognition. In the preprocessing procedure, the thinning algorithm proposed by CHEN & HSU is applied. In the type classification procedure, thinned Hangul image is classified into one of six formal types. In the separation of consonant and vowel procedure, starting from branch-points which are existed in a vowel, character elements are separated by means of tracing branch-point pixel by pixel and comparison with proposed templates. In the same time, the vowels are recognized. In the recognition procedure, consonants are extracted from the separated Hangul character and recognized by modified Crossing method. Recognized characters are converted into KS-5601-1989 codes. The experiments show that correct recognition rate is about 80%-90% and recognition speed is about 2-3 character persecond in three types of different input data on computer with 80386 microprocessor.

• International Journal of Advanced Culture Technology
• /
• v.6 no.3
• /
• pp.173-177
• /
• 2018

Masks are generated by adding different fonts of learning data characters in pixel unit, and pixel values belonging to each of the masks are divided into 3 groups. Using the directional expansion operators, we expand the text area of the test data character into 4 diagonal directions in order to create the boundary areas to distinguish it from the background area. A mask with a minimum average discordance is selected as the final recognition result by calculating the degree of discordance between the expanded test data and the masks. Image comparison using directional expansion operations more accurately recognizes test data through 4 subdivided recognition processes. It is also possible to expand the ranges of 3 groups of pixel values of masks more evenly such that new fonts can easily be added to the given learning data.

• International Journal of Advanced Culture Technology
• /
• v.6 no.2
• /
• pp.123-128
• /
• 2018

Learning data is composed of 100 characters with 10 different fonts, and test data is composed of 10 characters with a new font that is not used for the learning data. In order to consider the variety of learning data with several different fonts, 10 learning masks are constructed by accumulating pixel values of same characters with 10 different fonts. This process eliminates minute difference of characters with different fonts. After finding maximum values of learning masks, test data is expanded by multiplying these maximum values to the test data. The algorithm calculates sum of differences of two corresponding pixel values of the expanded test data and the learning masks. The learning mask with the smallest value among these 10 calculated sums is selected as the result of the recognition process for the test data. The proposed algorithm can recognize various types of fonts, and the learning data can be modified easily by adding a new font. Also, the recognition process is easy to understand, and the algorithm makes satisfactory results for character recognition.

• The Journal of the Convergence on Culture Technology
• /
• v.4 no.4
• /
• pp.361-366
• /
• 2018

For each character constituting learning data, different fonts are added in pixel unit to create MASK, and then pixel values belonging to the MASK are divided into three groups. The experimental data are modified into skeletal forms, and then regional boundary operation is used to create a boundary that distinguishes the background region adjacent to the skeleton of the character from the background of the modified experimental data. Discordance values between the modified experimental data and the MASKs are calculated, and then the MASK with the minimum value is found. This MASK is selected as a finally recognized result for the given experiment data. The recognition algorithm using skeleton of the character and the regional boundary operation can easily extend the learning data set by adding new fonts to the given learning data, and also it is simple to implement, and high character recognition rate can be obtained.

• 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.

• 한국HCI학회:학술대회논문집
• /
• 2007.02c
• /
• pp.318-321
• /
• 2007

This paper proposes a GPU-based approach to real-time skinning animation of large crowds, where each character is animated independently of the others. In the first pass of the proposed approach, skinning is done by a pixel shader and the transformed vertex data are written into the render target texture. With the transformed vertices, the second pass renders the large crowds. The proposed approach is attractive for real-time applications such as video games.

• Korean Journal of Cognitive Science
• /
• v.9 no.1
• /
• pp.1-11
• /
• 1998

In this paper, the features which are thought to be used by humans based on the psychological experiment of human information processing are applied to character recognition problem. Man will deal with a little large area information as well as pixel by pixel information. Therefore we define the feature that represents a little wide region I information called region feature, and combine the features derived from region feature and pixel by pixel features that have been used by now. The features we used are the result of region feature based preanalysis, mesh with region attributes, cross distance difference and gradient. The training and test data in the experiment are handwritten Korean alphabets, digits and English alphabets, which are trained on neural network using back propagation algorithm and recognition results are 90.27-93.25%, 98.00% and 79.73-85.75%, respectively Experimental results show that the feature we are suggesting in this paper is 1-2% better than UDLRH feature similar in attribute to region feature, and the tendency of misrecognition is more easily acceptable by humans.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2008.10a
• /
• pp.1525-1528
• /
• 2008

High-luminance CNT-FED character-displays using simple line-rib-structure was performed. One display-panel had $48{\times}480$-dots and the sub-pixel pitch was 1mm. Another panel had $32{\times}256$-color-pixels, and the subpixel size was $0.6mm{\times}1.8mm$. The power consumption was less than 10W at character-displaying module. It should be useful for public display even under emergent no-power condition.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.836-841
• /
• 2004

This paper describes ASIC design for brightness revision control, A LED Pixel Matrix (LPM) design and LPM in natural color LED vision. A designed chip has 256 levels of gradation correspond to each Red, Green, Blue LED pixel respectively, which have received 8bit image data. In order to maintain color uniformity by reducing the original rank error of LED, we adjusted the specific character value 'a' and brightness revision value 'b' to pixel unit, module unit and LED vision respectively by brightness characteristic function with 'Y=aX+b'. In this paper, if designed custom chip and brightness revision control method are applied to manufacturing of natural color LED vision, we can obtain good quality of image. Furthermore, it may decrease the cost for manufacturing LED vision or installing the plants.