• English Language & Literature Teaching
• /
• v.11 no.4
• /
• pp.97-120
• /
• 2005

Production and perception of second language sounds are typically influenced by second language learners' native language sounds. In this study we investigate how the Korean language influences Korean speakers' production of English alphabets. In the experiment conducted to prepare for this study 16 native speakers of Korean pronounced English alphabets. Then three native speakers of English evaluated the Korean subjects' pronunciation of them. The results show that the Korean subjects' native language (i.e., Korean) influences their production of the English alphabets. When Korean has sounds corresponding to English alphabets, the English subjects rate the Korean subjects' production of them good. For instance, Korean has voiceless stop phonemes, hence their production of English alphabets was rated good by the English subjects. The Korean subjects' production of English alphabets containing the sounds that do not exist in Korean was rated poor by the English subjects. For instance, Korean does not have voiced fricative phonemes, hence their production of English alphabets was rated poor.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.2
• /
• pp.157-160
• /
• 2003

In this paper, we describe how to represent lower case hand-written English alphabets by a sequence of two to seven fuzzy sets. Each fuzzy set represents an arc segment of the character and each arc segment is assumed to be a part of an ellipse. The part of an ellipse is defined by five quantities; its short and long radii, its orientation angle, whether it is a part of the lower half or the upper half, and whether it is the full half or a part of a half. Hence, we use the Cartesian product of five fuzzy sets to represent each arc segment. We show that this representation is a translation, rotation, and scaling invariant and that it can be used to generate the hand-written English alphabets. The representation we describe is different from the one proposed earlier by the author and when compared with the previous representation, the one described in this paper simulates more closely the behavior of how one writes English characters.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.32-35
• /
• 2003

In this paper, we describe how to represent lower case hand-written English alphabets by a sequence of two to seven fuzzy sets. Each fuzzy set represents an arc segment of the character and each arc segment is assumed to be a part of an ellipse. The part of an ellipse is defined by five quantities: its short and long radii, its orientation angle, whether it is a part of the lower half or the upper half and whether it is the full half or a part of a half. Hence, we use the Cartesian product of five fuzzy sets to represent each arc segment. We show that this representation is a translation, rotation, and scaling invariant and that it can be used to generate the hand-written English alphabets. The representation we describe is different from the one proposed earlier by the author and when compared with the previous representation, the one described in this paper simulates more closely the behavior of how one writes English characters.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.6
• /
• pp.593-598
• /
• 2014

Hand gesture recognition based on vision is a challenging task in human-robot interaction. The sign language of finger spelling alphabets has been tested as a kind of hand gesture. In this paper, we test hand gesture recognition by detecting the contour shape and orientation of hand with visual image. The method has three stages, the first stage of finding hand component separated from the background image, the second stage of extracting the contour feature over the hand component and the last stage of comparing the feature with the reference features in the database. Here, finger spelling alphabets are used to verify the performance of our system and our method shows good performance to discriminate finger alphabets.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.7
• /
• pp.836-843
• /
• 1988

For the efficient recognition of Korean alphabets, a new procedure which is applicable for the generation of phase filters with reduced resolution requirements and capable of implementing distortion tolerant pattern recognition is proposd. The performance of these filters and their advantages for Korean alphabets recognition is demonstrated.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.9
• /
• pp.1340-1347
• /
• 1989

For the efficient recognition of Korean Alphabets, a tree structure discrimination algorithm employing NRF-SDF concept is proposed. This algorithm consists of several main-steps, which contain several sub-steps. Each step contains vowels or consonants for training image. This algorithm reduces processing and recognition time than any other conventional algorithms for recognition of Korean Alphabets. A simulation results indicated that this algorithm has a satisfactory performance.

• Journal of the Ergonomics Society of Korea
• /
• v.27 no.3
• /
• pp.7-14
• /
• 2008

In this study, four alternatives for the arrangement of Korean alphabets on computer keyboards are developed and analyzed to find the better design than the KS(Korean Standard) keyboard. Among the developed four modified models MOD 1 to MOD4, we suggest MOD3 as the best design which incorporates the keys usage frequencies and the compatibility of present standard.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1073-1078
• /
• 2016

(${\delta}$, ${\gamma}$)-matching for strings over integer alphabets can be applied to such fields as musical melody and share prices on stock markets. In this paper, we define ${\delta}$-approximate periods and ${\gamma}$-approximate periods of strings over integer alphabets. We also present two $O(n^2)$-time algorithms, each of which finds minimum ${\delta}$-approximate periods and minimum ${\gamma}$-approximate periods, respectively. Then, we provide the experimental results of execution times of both algorithms.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.900-904
• /
• 1991

In this paper, our study for the recognition of Hand-written Korean characters, Arabic numbers and alphabets by neural netwoks. This System extracts feature of character by using the MESH feature point of handwritten character, Arabic numbers and alphabets. To reduce the input image data, features are extracted from each input images. A MLP(multi-layer perceptron) with one hidden layer was trained with a modified BEP(back error propagation) algorithm. This method extracts feature sets of the characters directly from the scanner and can enhance computation speed without using the special preprocesses such as size normalization, smoothing, and thinning.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.149-152
• /
• 2001

The goals of this papper are not only to maximize of performance but also to reduce the response time for the real-time printed alphabets recognition system using the backpropagation algorithm in the artificial neural network. The Genesis board and MIL(Matrox Image Library) package were used to real-time acquisition, processing and display of images. Through this experiment proved the possibility of real-time recognition processing by comparing response times of the system and proposing the method to reduce of order of the output vectors.