• Lingua Humanitatis
• /
• v.8
• /
• pp.331-367
• /
• 2006

In this paper I attempted to investigate the matters related with the clarification of the close relationship between writing system and pronunciation. On the way of pursuing the research on the subject I found the fact that the same topic has been the main academic target in Korea. There have been some remarks about English alphabets and pronunciation. Nevertheless, the relation between alphabet codes and pronunciation tokens wasn't considered as the main key to master the English pronunciation correctly and completely. As the main target of this paper I argue that it is necessary to comprehend the connection. Then, we can recognize the significant role of alphabetic structure for understanding the gist of pronunciation exercise. This paper is classified into four parts. Each part consists of the material to affirm the fact that writing system should be the inevitable equivalent of sound system, and vice versa. In the first section I show that the development of the way of pronouncing English words is closely related with the endeavors of the scholars. While performing the survey of the studies about the alphabetic structure of the age many scholars found that the spelling construction was recorded without any common denominator. Thus, they not only sought to stage the bedrock for the standard written form of words but also to associate the alphabet letters with phonetic features. Secondly I mention the negative aspect of the 'only spelling based English pronunciation education' for the educational goal of 'Phonics methodology.' In this part I suggest the essentiality of phonemic properties with the phonetic prospect: phonemic awareness. Thirdly I refer to the standardization of the spelling system of English. As the realm of application of the language is extended toward the various professional areas such as commercial, scientific, and cultural spheres, it is quite natural to assume that the usage of the language will be transformed according to the areas in the world. Fourthly I introduce the first English-Korean grammar book with the section of 'the introduction to English pronunciation.' At the chapter the author explained the sound features of English based on the regulation of 'Scientific Alphabet' of U.S.A. In the transcribing system all the symbols were postulated on the basis of the English alphabet form instead of the separate phonetic signs of IPA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.2
• /
• pp.157-168
• /
• 1993

In this paper, it is shown that neural networks trained with back propagation algorithm and dictionary can be applied to recognize handwritten English characters. To eliminate the useless data part and to minimize the variety of characters from the scanned image file, various preprocessings : that is, segmentation, centering, noise filtering, sealing and thinning are performed. After these, characteristic features are derived from thinned character pattern. The neural network is trained by using the extracted features for sample data, and all test data are classified into English alphabets according to their features through the neural network. Finally, the ways of reducing learning time and improving recognition rate, and the relationship between learning time and hidden layer nodes are considered. As a result of this study, after successful training, a high recognition rate has been obtained with this system for the trained patterns and about 93% for test patterns. Using dictionary, the recognition rate was about 97% for test pattern.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.255-259
• /
• 2005

To search a pattern P in a text, such index data structures as suffix trees and suffix arrays are widely used in diverse applications of string processing and computational biology. It is well known that searching in suffix trees is faster than suffix ways in the aspect of time complexity, i.e., it takes O(${\mid}P{\mid}$) time to search P on a constant-size alphabet in a suffix tree while it takes O(${\mid}P{\mid}+logn$) time in a suffix way where n is the length of the text. In this paper we present a linear-tim8 search algorithm in suffix arrays for constant-size alphabets. For a gene.al alphabet $\Sigma$, it takes O(${\mid}P{\mid}log{\mid}{\Sigma}{\mid}$) time.

• The Journal of the Korea Contents Association
• /
• v.13 no.10
• /
• pp.19-26
• /
• 2013

In the Malaysian license plates, alphabets and numerals which are made by plastic, are adhered to a frame as embossing style and occasionally characters in horizontal, vertical directions are aligned with narrow space. So the extraction of character stroke information can be hard in the vehicle images of low illumination intensity. In this paper, Malaysian license plate recognition algorithm for low illumination intensity image is proposed. DoG filtering based character stroke generation method is introduced to derive exact connected components of strokes in the vehicle image of low illumination intensity. After localization of plate by connected component analysis, characters are segmented and recognized. Algorithm is experimented for the 6,046 vehicle images captured in Kuala Lumpur by IR camera without using any special light during day and night. The experimental results show that recognition accuracy of plates is 96.1%.

• The Journal of the Korea Contents Association
• /
• v.15 no.11
• /
• pp.501-508
• /
• 2015

Most web sites, information systems use the ID/Password technique to identify and authenticate users. But ID/Password technique is vulnerable to security. The user must remember the ID/Password and, the password should include alphabets, numbers, and special characters, not to be predicted easily. User also needs to change your password periodically. In this paper, we propose the user authentication method that the user authentication information stored in the external storage to authenticate a user. If another person knows the ID/Password, he can't log in a system without the external storage. Whenever a user logs in a system, authentication information is generated, and is stored in the external storage. Therefore, the proposed user authentication method is the traditional ID/Password security technique, but it enhances security and, increases user convenience.

• The KIPS Transactions:PartB
• /
• v.14B no.5
• /
• pp.391-400
• /
• 2007

An interactive Hangul input method using the numeric phone keypad, which is applicable for mobile devices is introduced. In the proposed method, user only selects the corresponding keys by single tapping, for the alphabet of Korean letter which is desired to enter. The interface generates the subset of eligible letters for the key sequence, then the user selects the desired letter in the set. Such an interactive approach transforms the text entry interface into a multi-level interactive letter-oriented style, from the preexisting passive and single-level alphabet-oriented interface. The annoyance of key-operations, the major disadvantage of the previous methods, derived from multi-tap to clear the ambiguity of multi-assigned alphabets for the Hangul automata, can be eliminated permanently, while the additional letter selection procedure to finalize the desired letter is essential. Also the complexity of Hangul text entry is reduced since all letters can be compounded from basic alphabet selection of the writing sequence order. The advantage and disadvantage of the proposed method are analyzed through comparing with pre-existing method by experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.892-898
• /
• 2012

Rough classification methods are used to improving the recognition speed in many character recognition problems. In this case, some irreversible result can occur by an error in rough classification. Methods for duplicating each model in several classes are used in order to reduce this risk. But the errors by rough classfication can not be completely ruled out by these methods. In this paper, an recognition method is proposed to increase speed that matches models selectively without any increase in error. This method constructs a model graph using similarity between models. Then a search process begins from a particular point in the model graph. In this process, matching of unnecessary models are reduced that are not similar to the input pattern. In this paper, the proposed method is applied to the recognition problem of handwriting numbers and upper/lower cases of English alphabets. In the experiments, the proposed method was compared with the basic method that matches all models with input pattern. As a result, the same recognition rate, which has shown as the basic method, was obtained by controlling the out-degree of the model graph and the number of maintaining candidates during the search process thereby being increased the recognition speed to 2.45 times.

• The KIPS Transactions:PartB
• /
• v.14B no.6
• /
• pp.461-472
• /
• 2007

The emphasis in genome projects has Been moving towards the sequence analysis in order to extract biological "meaning"(e.g., evolutionary history of particular molecules or their functions) from the sequence. Especially. palindromic or direct repeats that appear in a sequence have a biophysical meaning and the problem is to recognize interesting patterns and configurations of words(strings of characters) over complementary alphabets. In this paper, we propose an algorithm to identify variable length palindromic pairs(longer than a threshold), where we can allow gaps(distance between words). The algorithm is called palindrome algorithm(PA) and has O(N) time complexity. A palindromic pair consists of a hairpin structure. By composing collected palindromic pairs we build n-pair palindromic patterns. In addition, we dot some of the longest pairs in a circle to represent the structure of a DNA sequence. We run the algorithm over several selected genomes and the results of E.coli K12 are presented. There existed very long palindromic pair patterns in the genomes, which hardly occur in a random sequence.

• Journal of the Korea Convergence Society
• /
• v.9 no.11
• /
• pp.53-60
• /
• 2018

This paper describes the experiments of gaze tracking utilizing a low-cost electrooculogram measuring device. The goal of the experiments is to verify whether the low-cost device can be used for a complicated human-computer interaction tool, such as the eye-writing. Two experiments are conducted for this goal: a simple gaze tracking of four directional eye-movements, and eye-writing-which is to draw letters or shapes in a virtual space. Eye-written alphabets were obtained by two PSL-iEOGs and an Arduino Uno; they were classified by dynamic positional warping after preprocessed by a wavelet function. The results show that the expected recognition accuracy of the four-directional recognition is close to 90% when noises are controlled, and the similar median accuracy (90.00%) was achieved for the eye-writing when the number of writing patterns are limited to five. In future works, additional algorithms for stabilizing the signal need to be developed.

• The Journal of the Acoustical Society of Korea
• /
• v.40 no.2
• /
• pp.169-175
• /
• 2021

Recently, an ultrasound hologram and its applications have gained attention in the ultrasound research field. However, the determination technique of transmit signal phases, which generate a hologram, has not been significantly advanced from the previous algorithms which are time-consuming iterative methods. Thus, we applied the deep learning technique, which has been previously adopted to generate an optical hologram, to generate an ultrasound hologram. We further examined the Deep learning-based Holographic Ultrasound Generation algorithm (Deep-HUG). We implement the U-Net-based algorithm and examine its generalizability by training on a dataset, which consists of randomly distributed disks, and testing on the alphabets (A-Z). Furthermore, we compare the Deep-HUG with the previous algorithm in terms of computation time, accuracy, and uniformity. It was found that the accuracy and uniformity of the Deep-HUG are somewhat lower than those of the previous algorithm whereas the computation time is 190 times faster than that of the previous algorithm, demonstrating that Deep-HUG has potential as a useful technique to rapidly generate an ultrasound hologram for various applications.