• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1081-1084
• /
• 1987

The Rapid transform is used in the recognition of Korean (Consonant) characters. The test pattern is represented by two gray levels (0 and 1). A 2-dimensinal rapid transform of the test pattern is computed. Feature selection is carried out in the Rapid transform domain. These features are used with the corresponding features of the template patterns in features of the template patterns in computing the Euclidian distance function and the decision is made based on the minimum distance criterion. Experimental results show that recognition rate is 94%.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.175-182
• /
• 1994

In this study, we present unvoiced consonant recognition system using characteristic parameters of the phoneme of the each syllable. For the recognition, the characteristic parameters on the time domain such as ZCR, total energy of the consonant region and half region energy of the consonant region, and those on the frequency domain such as the frequency spectrum of the transition region are used. The objective unvoiced consonants in this study are /ㄱ/,/ㄷ/,/ㅂ/,/ㅈ/,/ㅋ/,/ㅌ/,/ㅍ/ and /ㅊ/. Each characteristic parameter of two regions extracted from these segmented unvoiced consonants are used for each recognition system of the region, independently, And complementing two outputs of each other system, the final output is to be produced. The recognition system is implemented using MLP which has learning ability. The recognition simulation results for 112 unvoiced consonant samples are that average recognition rates are 96.4$\%$ under 80$\%$ learning rates and 93.7$\%$ under 60$\%$ learning rates.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.209-212
• /
• 2000

본 논문은 음성인식에 필요한 대용량 음성 D/B 구축을 위한 auto-segmentation의 향상에 관한 논문이다. 50개의 우리말 음소(잡음, 묵음 포함)를 정하고 음성특징으로 MFCC(Mel Frequency Cepstral Coefficients), $\Delta$MFCC, $\Delta\Delta$MFCC, 39차를 추출한 다음 HMM 훈련과 CCS(Constrained Clustering Segmentation) 알고리즘(1)을 사용하여auto-segmentation을 수행하였다. 이 과정에서 대부분의 음소는 오류범위$(\pm25ms)$ 안에서 분절이 이루어지지만, 짧은 묵음, 모음+유성자음('ㅁ', 'ㄴ', 'ㄹ', 'o') 등에서 자주 오류범위를 넘어 분절이 발생하였다. 이러한 음운환경에 따른 경계의 오류를 구간별로 Wavelet 변환 신호의 MLR(Maximum Likelihood Ratio) 값을 이용, 기존 문제점을 보완하여 오류의 범위를 줄임으로서 auto-segmentation의 성능 향상을 얻을 수 있었다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.255-256
• /
• 2019

한글 폰트를 만드는 데는 자음+모음 조합으로 약 11,500자 정도의 글자가 필요하다. 디자이너가 글자 하나씩 전부 디자인 하는 것도 굉장한 부담요소이고, 한글폰트를 제작하는데 있어 3개월 이상의 소요 기간과 3000만 원 이상의 비용부담 또한 무시 못 할 요소이다. 게다가 카피라이트 폰트에 대한 저작권 문제 또한 골칫거리다. 그래서 이를 최소한으로 하고자 딥 러닝의 방식중 하나인 GAN(생성적 적대 신경망)을 통해서 디자이너가 399자만 작성하고 나머지는 컴퓨터가 디자이너의 폰트 디자인을 인식하고 자동으로 만들어 주는 프로그램을 고안하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.2
• /
• pp.101-112
• /
• 1995

In order to construct a feature map-based phoneme classification system for speech recognition, two procedures are usually required. One is clustering and the other is labeling. In this paper, we present a phoneme classification system based on the Kohonen's Self-Organizing Feature Map (SOFM) for clusterer and labeler. It is known that the SOFM performs self-organizing process by which optimal local topographical mapping of the signal space and yields a reasonably high accuracy in recognition tasks. Consequently, SOFM can effectively be applied to the recognition of phonemes. Besides to improve the performance of the phoneme classification system, we propose the learning algorithm combined with the classical K-mans clustering algorithm in fine-tuning stage. In order to evaluate the performance of the proposed phoneme classification algorithm, we first use totaly 43 phonemes which construct six intra-class feature maps for six different phoneme classes. From the speaker-dependent phoneme classification tests using these six feature maps, we obtain recognition rate of $87.2\%$ and confirm that the proposed algorithm is an efficient method for improvement of recognition performance and convergence speed.

• Korean Journal of Cognitive Science
• /
• v.7 no.1
• /
• pp.57-74
• /
• 1996

This paper presents a comparison of recognition performance of the features used inthe recent handwritten korean character recognition.This research aims at providing the basis for feature selecion in order to improve not only the recognition rate but also the efficiency of recognition system.For the comparison of feature performace,we analyzed the characteristics of theose features and then,classified them into three rypes:global feature(image transformation)type,statistical feature type,and local/ topological feature type.For each type,we selected four or five features which seem more suitable to represent the characteristics of korean alphabet,and performed recongition experiments for the first consonant,horizontal vowel,and vertical vowel of a korean character, respectively.The classifier used in our experiments is a multi-layered perceptron with one hidden layer which is trained with backpropagation algorithm.The training and test data in the experiment are taken from 30sets of PE92. Experimental results show that 1)local/topological features outperform the other two type features in terms of recognition rates 2)mesh and projection features in statical feature type,walsh and DCT features in global feature type,and gradient and concavity features in local/topological feature type outperform the others in each type, respectively.

• Journal of Korea Game Society
• /
• v.9 no.4
• /
• pp.67-80
• /
• 2009

In this paper, we described the development of a Korean Manual Alphabet (KMA) learning game with avatar. KMA letters correspond to the vocabulary of Korean Sign Language (KSL) when spelling a word. Each KMA letter corresponds to a letter of the Korean Alphabet (KA) and KA is represented as hand shapes by sign language user. We developed a KMA learning game for a beginner to learn KMA letters from sign language avatar and practice KMA presentation easily. The system composed of sign language teacher avatar GUI popup window based on OpenGL, KMA letter recognition module, KA letter raining game module and USB camera. A user learns a KMA letter with expressing KA syllabic from avatar and inputs a KMA letter to the system using USB camera. We evaluated the efficiency of the developed system through the verification of users.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.10
• /
• pp.1114-1120
• /
• 2009

The conductivity of various electro-threads is analyzed, and the washable electro-thread embroidery UHF RFID tag antennas using the character shape without T-matching structure are designed by adding a T-matching structure. The RFID tag antenna using the electro-thread is easy to be embedded on a cloth as a wearable antenna because it is flexible and different from general copper inlay shape and tape type tag. The embroidery tag antennas are designed with the English alphabet 'F' and the Korea alphabet 'ㄹ' character. Those are easy to be applied to general clothes. The parameters of antennas are optimized and fabricated. The characteristics and the reading range patterns of the tag antennas are measured. The reading ranges of wet tags(tap water, sea water and soapy water) are tested and compared.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.3
• /
• pp.53-60
• /
• 1998

In this paper, we proposed a set of ANSI-Korean character patterns for handwriting recognition that can be used as an input method of mobile computers like PDA (Personal Digital Assistant). In the case of bilinguals, two kinds of alphabets are written alternatively So the method of input character mode change must be provided, and this cause discomfort of writing. Our proposed written character patterns have some constraint but permit ANSI-Korean mixed writing without mode change keeping original form of alphabets and can be recognized with simple algorithm relatively. For ANSI character we analysis Graffiti and propose new writing pattern, which is more similar to original form. There are many researches about input method of unpacking Korean character and writing patterns. But they are not widely used because it's excessively contrary to original form of Korean characters. To show our proposed writing patterns usefulness, we studied the satisfaction and easiness of writing and the recognition rates. Writers are divided into two groups; PDA users, familiar to Graffiti, and others. The results satisfy usefulness in the both groups.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.481-490
• /
• 2002

Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic information has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing for off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods that effectively extracts skeleton through conditional test mask considering routing time and quality of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.