• Title/Summary/Keyword: Korean alphabet

Search Result 211, Processing Time 0.035 seconds

Fabrication of Movable Nanostructures by Selective Etching of Nanoplates (나노판의 선택적 식각에 의한 이동이 가능한 나노구조체 제작)

  • Yun Yong-Ju;Ah Chil-Seong;Yun Wan-Soo;Ha Dong-Han
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.3 s.246
    • /
    • pp.328-333
    • /
    • 2006
  • Movable nanometer-scale structures are fabricated by selective etching of single crystalline Au nanoplates. The nanostructures have arbitrary shapes like gear and alphabet 'A' with in-plane size less than 500 m and thickness of $25\sim60nm$. They could be moved successfully on the substrate using a nanornanipulator installed in a focused ion beam system. Our approach is expected to be useful in fabricating various kinds of nanocomponents which can play a role as building blocks for the sophisticated nanodevices or micromachines.

Recognition of Handwritten-Hangeul by shape Pattern (Shape Pattern에 의한 필기체의 한글 인식)

  • 박종욱;이주근
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.5
    • /
    • pp.1-9
    • /
    • 1985
  • In this paper, a new methods which decomposes the handwritten-Hangout shape panerns into subpatterns and recognizes the decomposed subpatterns are proposed. the feature vcfices arc detected by searching boundary of the shape pattern and a topolo-gical structure is represented by a bridge links and contact links between the feature vertices. From the tpcological structure, Hangout shape patterns are decomposed into the subpatterns of 44-Korean alphabet. The 학obol and the local attributes are extracted from the subpattrrns and the subpatterns are recognized by matching those attributes with the dictionary. It is assured that this method is more effect and reasonable for deformed handwrioen Hangout shape patterns. Experimental results show that recognition rate is 99(%) and recogni-tion time is also reduced as those using the thinning process.

  • PDF

Uncertainty Fusion of Sensory Information Using Fuzzy Numbers

  • Park, Sangwook;Lee, C. S. George
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1001-1004
    • /
    • 1993
  • The Multisensor Fusion Problem (MFP) deals with the methodologies involved in effectively combining together homogeneous or non-homegeneous information obtained from multiple redundant or disparate sensors in order to perform a task more accurately, efficiently, and reliably. The inherent uncertainties in the sensory information are represented using Fuzzy Numbers, -numbers, and the Uncertainty-Reductive Fusion Technique (URFT) is introduced to combine the multiple sensory information into one consensus -number. The MFP is formulated from the Information Theory perspective where sensors are viewed as information sources with a fixed output alphabet and systems are modeled as a network of information processing and processing and propagating channels. The performance of the URFT is compared with other fusion techniques in solving the 3-Sensor Problem.

  • PDF

Using Higher Order Neuron on the Supervised Learning Machine of Kohonen Feature Map (고차 뉴런을 이용한 교사 학습기의 Kohonen Feature Map)

  • Jung, Jong-Soo;Hagiwara, Masafumi
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.5
    • /
    • pp.277-282
    • /
    • 2003
  • In this paper we propose Using Higher Order Neuron on the Supervised Learning Machine of the Kohonen Feature Map. The architecture of proposed model adopts the higher order neuron in the input layer of Kohonen Feature Map as a Supervised Learning Machine. It is able to estimate boundary on input pattern space because or the higher order neuron. However, it suffers from a problem that the number of neuron weight increases because of the higher order neuron in the input layer. In this time, we solved this problem by placing the second order neuron among the higher order neuron. The feature of the higher order neuron can be mapped similar inputs on the Kohonen Feature Map. It also is the network with topological mapping. We have simulated the proposed model in respect of the recognition rate by XOR problem, discrimination of 20 alphabet patterns, Mirror Symmetry problem, and numerical letters Pattern Problem.

Recognition of the Korean alphabet Using Neural Oscillator Phase model Synchronization (신경 진동자 위상모델의 동기화를 이용한 한글인식)

  • Kwon, Yong-Bum;Song, Hong-Jun;Park, Young-Sik;Lee, Joon-Tark
    • Proceedings of the KIEE Conference
    • /
    • 2003.07d
    • /
    • pp.2280-2282
    • /
    • 2003
  • 신경 진동자는 이미지정보의 해석, 음성인식, 지질 변화 예측 등의 진동하는 시스템에 응용되어진다. 이러한 진동하는 시스템에 기존의 역전파 알고리즘을 이용하는 경우, 복잡 다양한 입력 패턴을 추정하기가 어려우므로 학습단계에서 더 많은 양의 학습 데이터가 필요하게 되며 수렴 속도의 지연과 근사화가 어렵다. 따라서 본 논문에서는 모델에 대한 함수의 근사화가 쉬우며 학습하는 구조를 가지는 신경 진동자에 의한 위상 동기화 특성을 연구하고 이를 이용한 한글 문자 인식시스템을 구현하였다.

  • PDF

Implementation of Symmetrec Three Layered Network for Large Capacity Optical Associative Memory (대용향 광 연상기억을 위한 대칭 삼층구조의 구현)

  • 서호형;이상수
    • Korean Journal of Optics and Photonics
    • /
    • v.3 no.3
    • /
    • pp.191-197
    • /
    • 1992
  • We have developed a new optical associative memory system hased on the symmetric three layered neural network model, uhing two holograms and a LCIV. In the experiment, four Korean alphabet letters (ㄹ, ㅅ, ㅇ, ㅈ) are used as memory patterns. The results are compared with those of the two layered network and the IIopfield models. The results show that more than 95% recognition ablity is obtained for thc input which has the error rate less than 12%.

  • PDF

A Consideration of the Shape Similarity between Hangeul Typeface Design and Latin Alphabet Typeface Design - focused on YoonDesign Fonts (한글디자인과 라틴 알파벳디자인의 형태유사성 고찰 1 - 윤디자인 폰트를 중심으로 -)

  • Park, Jae-Hong
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2021.07a
    • /
    • pp.123-124
    • /
    • 2021
  • 본 논문은 기존 폰트 디자인을 고찰하여 한글과 라틴 알파벳 디자인의 형태 유사성을 향상시키기 위한 기초 자료를 제공한다. 고찰을 위해 윤디자인 대표 폰트 20종을 선정하였다. 형태적 관점에서 글자 디자인적 유사성을 찾기 위해 낱자, 낱글자, 낱말, 문장을 기준으로 고찰하였다. 윤디자인 대표 폰트 20종의 한글과 라틴 알파벳 글자 디자인의 결과는 다음과 같다. 첫째, 낱자(자소) 디자인은 동일한 형태이지만, 크기와 비례가 변화할 수 있다. 둘째, 낱글자(음절) 디자인은 낱글자 전체의 디자인을 위해 부분적으로 다른 형태를 디자인할 수 있다. 셋째, 낱말(단어) 디자인은 낱말의 우월효과를 고려하여야 한다. 넷째, 문장의 디자인은 글줄의 흐름을 고려하여 글자의 크기, 비례와 기준선을 디자인하여야 한다.

  • PDF

A Consideration on the Identifiability for Blind Signal Separation in MIMO LTI Channels (MIMO LTI 채널에서의 블라인드 신호분리시의 식별성에 대한 고찰)

  • Kwon, Soon-Man;Kim, Seog-Joo;Lee, Jong-Moo;Kim, Choon-Kyung;Cho, Chang-Hee
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.265-267
    • /
    • 2004
  • A blind separation problem in a multiple-input-multiple-output (MIMO) linear time-invariant (LTI) system with finite-alphabet inputs is considered. A discrete-time matrix equation model is used to describe the input-output relation of the system in order to make full use of the advantages of modern digital signal processing techniques. At first, ambiguity problem is investigated. Then, based on the results of the investigation, a new identifiability condition is proposed for the case of an input-data set which is widely used in digital communication. A probability bound such that an arbitrary input matrix satisfies the identifiability condition is derived. Finally, Monte-Carlo simulation is performed to demonstrate the validity of our suggestions.

  • PDF

A study on the combination algorithm of Korean alphabet to develope the Hangul fonts for computers (컴퓨터형 한글 서체 개발을 위한 자소 결합 알고리즘 연구)

  • Kim, Yun-Sik;Eom, Jeong-Kook;Song, Man-Suk
    • Annual Conference on Human and Language Technology
    • /
    • 1998.10c
    • /
    • pp.341-344
    • /
    • 1998
  • 컴퓨터 상에서 모든 한글 음절을 구현하고자 하면 현대한글 11,172음절의 완성형 코드나 조합형 코드를 사용해야 하는데 조합형의 경우 글자의 미려도가 떨어지는 문제성이 발생되므로 자소 벌수를 늘려 그 문제점을 보완하려는 연구가 진행되어 왔다. 이는 메모리 및 코드처리상 비효율적인 요소가 많으므로 본 논문에서는 자소는 초 중 종성 각각 6벌씩만 제작한 후 자소의 어울림에 따라 자소의 이동과 변형으로 그 미려도를 추구할 수 있는 방안을 제시하고자 한다.

  • PDF

Ortho-phonic Alphabet Creation by the Musical Theory and its Segmental Algorithm (악리론으로 본 정음창제와 정음소 분절 알고리즘)

  • Chin, Yong-Ohk;Ahn, Cheong-Keung
    • Speech Sciences
    • /
    • v.8 no.2
    • /
    • pp.49-59
    • /
    • 2001
  • The phoneme segmentation is a very difficult problem in speech sound processing because it has found out segmental algorithm in many kinds of allophone and coarticulation's trees. Thus system configuration for the speech recognition and voice retrieval processing has a complex system structure. To solve it, we discuss a possibility of new segmental algorithm, which is called the minus a thirds one or plus in tripartitioning(삼분손익) of twelve temporament(12 율려), first proposed by Prof. T. S. Han. It is close to oriental and western musical theory. He also has suggested a 3 consonant and 3 vowel phonemes in Hunminjungum(훈민정음) invented by the King Sejong in the 15th century. In this paper, we suggest to newly name it as ortho-phonic phoneme(OPP/정음소), which carries the meaning of 'the absoluteness and independency'. OPP also is acceptable to any other languages, for example IPA. Lastly we know that this algorithm is constantly applicable to the global language and is very useful to construct a voice recognition and retrieval structuring engineering.

  • PDF