• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.1-13
• /
• 2021

In this research, we study the problem of font image skeletonization using an end-to-end deep adversarial network, in contrast with the state-of-the-art methods that use mathematical algorithms. Several studies have been concerned with skeletonization, but a few have utilized deep learning. Further, no study has considered generative models based on deep neural networks for font character skeletonization, which are more delicate than natural objects. In this work, we take a step closer to producing realistic synthesized skeletons of font characters. We consider using an end-to-end deep adversarial network, SkelGAN, for font-image skeletonization, in contrast with the state-of-the-art methods that use mathematical algorithms. The proposed skeleton generator is proved superior to all well-known mathematical skeletonization methods in terms of character structure, including delicate strokes, serifs, and even special styles. Experimental results also demonstrate the dominance of our method against the state-of-the-art supervised image-to-image translation method in font character skeletonization task.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.4
• /
• pp.11-21
• /
• 2011

This paper proposes a method for decomposing a Hangul glyph of outline fonts into its initial, medial and final components using statistical-structural information. In a font family, the positions of components are statistically consistent and the stroke relationships of a Hangul character reflect its structure. First, we create the component histograms that accumulate the shapes and positions of the same components. Second, we make pixel clusters from character image based on pixel direction probabilities and extract the candidate strokes using position, direction, size of clusters and adjacencies between clusters. Finally, we find the best structural match between candidate strokes and predefined character model by relaxation labeling. The proposed method in this paper can be used for a study on formative characteristics of Hangul font, and for a font classification/retrieval system.

• Journal of Korean Medical classics
• /
• v.32 no.1
• /
• pp.105-116
• /
• 2019

Objectives : There are many secluded Chinese characters - so called Byeokja (僻字) in ancient classic literature, and Chinese characters that are not registered in Unicode and Variant characters (heterogeneous characters) that cannot be found in the current font sets often appear. In order to register all possible Chinese characters including such characters as units of information exchange, this study attempts to propose a method to encode the morphological information of Chinese characters according to certain rules. Methods : This study suggests the methods to encode the connection between the nodules constituting the Chinese character and the coordinates of the nodules. In addition to that, rules for expressing information about curves, expressions of aspect ratios of characters, rules for minimizing coordinate lines, and rules for expressing aggregation status of character components are added. Results : Through the proposed method, it is possible to generate codes of a certain length by extracting only information expressing the morphological configuration of characters. Conclusions : The method of character encoding proposed in this study can be used to distinguish variant characters with small variations in Byeokja, new Chinese characters and character strokes and to store and search them.

• Journal of Internet Computing and Services
• /
• v.8 no.6
• /
• pp.145-153
• /
• 2007

Recently, development in information technology is mainly focused on mobile service, and most of mobile users are using various services based on wireless network. So the importance of system software or middleware, which enables such mobile services, is growing bigger and bigger, and one of those is character input/output system. This paper will introduce an alphabet input system, which decomposes a character to a series of strokes, by its formation principal. It is designed to make a person, who knows the character, to input characters in the way that he/she is actually writing down the character.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.15 no.4
• /
• pp.149-157
• /
• 2019

In case of reading passport using a smart phone in contrast with a dedicated passport reading system, MRZ(Machine Readable Zone) character recognition can be hard when the character strokes were broken, touched or blurred according to the lighting condition, and the position and size of MRZ character lines were varied due to the camera distance and angle. In this paper, the effective recognition algorithm of the passport MRZ information using a combined neural network recognizer of CNN(Convolutional Neural Network) and ANN( Artificial Neural Network), is proposed under the various sized and skewed passport images. The MRZ line detection using connected component analysis algorithm and the skew correction using perspective transform algorithm are also designed in order to achieve effective character segmentation results. Each of the MRZ field recognition results is verified by using five check digits for deciding whether retrying the recognition process of passport MRZ information or not. After we implement the proposed recognition algorithm of passport MRZ information, the excellent recognition performance of the passport MRZ information was obtained in the experimental results for PC off-line mode and smart phone on-line mode.

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

This paper is proposed a Modified WLD (Weighted Levenshtein Distance) algorithm for processor desihn of code-string matching. A proposed MWLD (Modified Weighted Levenshtein Distance) algorithm is consist of 1-dimension bit-serial array processor to pattern matching using a Hamming Distance. The proposed processor is applied to recognition of character with real time input. The recognition rate of Hangul strokes is resulted to 98.65$\%$

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

• Cross-Cultural Studies
• /
• v.21
• /
• pp.213-254
• /
• 2010

The goal of this thesis is to make a comparative study about the variant form of the Chinese character in the five sorts of old maps drawing outside of the main gates of old map including DeDongYei-jido. The main task of this thesis can be classified under three heads - (1) introducing the literature of comparative study in the five sorts of old maps including DeDongYei-jido (2) classification of variant form in the five sorts of old maps (3) characteristic of variant form in the five sorts of old maps. In this thesis, aspect of variant form is classified under six head - (1) variation of the whole shape of the character (2) taking place the variation in both sides of Chinese character (3) taking place the variation in part (4) taking place variation in the strokes of the Chinese character (5) misusing different characters (6) changing different characters. This thesis explains some characteristic of variant form - (1) simplification of the shape of characters (2) using the Hou-qi-zi(後起字, Chinese character which is actually the same but made the next) (3) replacing the overlapped both sides of Chinese character with omit mark (4) a wrongly written character (5) discovering the variant form such as variant form of 廣, 广 variant form of 廛, variant form of 院 which was not recorded in Chinese literature. From now on, there should be some collections of variant form of Korean style and study. we are going to have to standardize aspect of variation and rule of variant form in old maps until we have to make some ways to recognize the block letter.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.6
• /
• pp.76-85
• /
• 1993

In this paper, we propose a stroke matching method for the off-line recognition of handprinted Hangul. In this method, the preprocessing steps such as position normalization, contour tracing and thinning are carried out first. Then, after extracting features such as the firection component distribution of contour, the direction component distribution of skeleton, and the distribution of structural feature points, strokes are extracted and matched based on the midpont distribution of the direction and the length of each stroke. In order to reduce the recognition time, a preliminary classification based on the direction component distribution features of the contour is performed. In order to domonstrate the performance of the proposed method, experiments with 520 most frequently used Hangul were performed, and 90.7% of correct recognition rate and 0.46second of recognition time per one character has been obtained. This results reveal that the proposed method can absorb effectively the noise in input character and the variations of stroke slant.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.73-82
• /
• 2009

This paper proposes a variance recovery method for character strokes that can be missed in applying the previously proposed color variance approach in text detection of natural scene images. The previous method has a shortcoming of missing the color variance due to the fixed length of horizontal and vertical windows of variance detection when the character strokes are thick or long. Thus, this paper proposes a variance recovery method by using geometric information of bounding boxes of connected components and heuristic knowledge. We have tested the proposed method using various kinds of document-style and natural scene images such as billboards, signboards, etc captured by digital cameras and mobile-phone cameras. And we showed the improved text detection accuracy even in the images of containing large characters.