• Journal of KIISE:Software and Applications
• /
• v.26 no.5
• /
• pp.647-656
• /
• 1999

본 논문에서는 오프라인 무제약 필기 한글 단어를 인식하기 위한 시스템을 제안한다. 제안된 단어 인식 시스템은 크게 다석가지 모듈-문자 분리,조합행렬생성, 특징 추출, 문자인식, 사전 후처리 -로 구성되어 있다. 문자 분리 모듈은 입력된 단어 영상을 하나의 문자보다 더 작은 이미지 조각으로 과다 분리하며 , 조합 행렬 생성모듈에서는 동적 프로그래밍 기법을 이용하여 분리된 이미지 조각들로부터 사전상의 모든 단어들과 대응되는 가능한 모든 조합을 생성한다. 문자인식모듈은 각 그룹에 대하여 일괄적으로 얻어진 특징과 유니그램을 이용하여 문자인식을 수행한다. 마지막으로 사전 후처리 모듈에서는 각 그룹에 대한 문자인식 결과와 단어 사전을 사용하여 입력단어에 대한 최종 인식 결과를 도출한다. 본 문에서 제안한 방법은 문자 분리, 문자 인식 및 후처리를 상호 보완적으로 결합함으로써 한글이 포함된 무제약 필기 문자열을 효과적으로 인식할 수 있다. 제안된 시스템의 성능을 평가하기 위하여 실제 우편 봉투 상에 쓰여진 필기 한글 단어 200개를 대상으로 실험을 하였다. 실험 결과 200개의 단어중 172개의 단어를 정인식하여 86%의 정확도를 얻을 수 있었으며 나머지 28개의 오인식된 단어들을 분석한 결과 대부분의 오류는 문자 인식기의 낮은 신뢰도 때문임을 알 수 있었다. 또한, 하나의 단어를 인식하기 위하여 약 2초가 소요되었다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2106-2112
• /
• 1999

In decision-making, information is the thing manufactured as the useful type for decision -making. We can improve the efficiency of decision-making by elimination of unnecessary information. Rough set is the theory that can classify and reduce the unnecessary. But the reduction process of rough set becomes more complex according to the number of attribute and tuple. After eliminating of the dispensable attributes using $\chi$2 and rough set, the indispensable attributes are used for the units of input layers in neural network. This rough-neural network can support more correct decision-making of neural network.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.16 no.4
• /
• pp.1-12
• /
• 1979

This article is a sequel to " Korean Character Processing: Part I. Theoretical Foundation " and deals with the practical and historical aspects of the same subject. We discuss , in the first half, the functional design of Korean I/O terminals, Korean character generators based on the conversion algorithm and dot matrix fonts, input keyboard configuration ( trade -offs between a key set and the number of key -strokes ), and the conditions to be considered for binary code design. The second half of the article is devoted to the history of Korean Character processing which is seen from the personal viewpoints. The recorded works are classified into 4 groups according to their maj or contents. Then we bring up each problematic issue to give a critical review of articles . Issues related to output (conversion process) and input ( character recognition) are separated. The bibliography is given in a chronological order.cal order.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.963-972
• /
• 1997

In imformation retrival, query reformulation algorithms construct querise from a set of intial input and feedback documents, and retrieval performance cna be varied by different sets of input documents. In this study, we developed a criterion for measuring the performance sensitivity of query reformulation algorithms to unput sets. In addition, we also propose a way of mesuring the changes in retrived area, (CIRA) during qucry reformulation. We cimpared CIRAs of query refromulation algorithms (i.e., query tree, DNF method, and Dillon's method) using three test sets:the CACM, CISI, and Medlars. In the experiments, the query tree showed the highest decreasing CIRA during refirmulations, which means the fastest convergence rate to an output set. For sensitivity analysis, the query tree sored the highest sensitivity to different input sets even though its differences to the tther algorithms are very small.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1139-1148
• /
• 2003

Biometric system has been studied as an optimal solution for preventing or reducing the peculation or loss of ID. Nowadays, face recognition has been spot-lighted as a future biometric system because it is not forced to contact the part of human body with the specific input area of the system. However, there is some limitations to get the constant facial features because the size of face area is varied by the capturing distance or tilt of the face. In this paper, we can extract constant facial features within the predefined threshold using the simple geometric processing such as image scaling, transformation, and rotation for frontal face images. This face recognition system identifies faces with 92% of accuracy for the 400 images of 40 different people.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1289-1295
• /
• 1999

본 논문에서는 스위치의 운용 알고리즘에 따라 시뮬레이션 프로그램을 이용하여 입/출력 버퍼의 셀 손실율을 측정하였다. 그 결과 셀 손실에 영향을 주는 요소로서, 셀 도착 간격 시간(k(a))과 SPEEDUP FACTOR(SF) en 가지 요소에 따라 셀손실을 평가할 수 있음을 알 수 있었다. 셀 도착 간격 시간 혹은 주기성은 비트가 셀로 모이는데 걸리는 시간을 의미하며 스위치 속도 SF는 임의의 한 슬롯내에서 한 입력단에서 출력단으로 서비스 가능한 셀의 수를 나타내고 있다. 시뮬레이션의 결과에서 보면 입력 버퍼에서는 주지성에 따라, 출력 버퍼에서는 SF의 크기에 따라 셀손실율이 커진다는 사실을 알 수 있었다. 따라서 보다 정확한 고속 스위칭 향상을 위해서는 입/출력 버퍼의 크기 결정이 중요하다. 본 논문의 시뮬레이션 결과에서는 입력 버퍼가 100x셀 일 때 출력 버퍼가 40x셀 정도의 크기가 적합하다는 것을 얻어내었다. 물론 입/출력 버퍼를 크게 한다면 셀 손실이 작아지지만, 하드웨어를 구성하는데 문제점이 발생될 것이기 때문이다. 그리고 본 논문 결과치중 셀 도착 분포 상황은 변동계수 모델링 성정에 따라 SF가 처리하는 서비스의 셀 도착 분포에 의 \ulcorner달라지지만, 변동계수가 전혀 없는 이상적인 경우(CV=1)를 제외한 경우의 SF값을 만족한다고 하겠다. 끝으로 입/출력 버퍼를 가진 스위치 구조는 단지 출력 버퍼를 갖는 스위치 보다 지연이 크지만, VLSI의 발달로 셀의 처리 속도가 증가하므로 더 많은 장점을 갖게 될 것이다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2116-2124
• /
• 2000

In this paper we propose combustion control of refuse incineration plant using fuzzy model and genetic algorithm. At first fuzzy modelling is performed to obtain fuzzy model of the refuse incineration plant and obtained fuzzy model predicts outputs of the plant when inputs are given. Fuzzy model ca be used to obtain control strategy, and train and enhance operators' skill by simulating the plant. Then genetic algorithms search and find out optimal control inputs over all possible solutions in respect to desired outputs and these are inserted to plant. In order to testify proposed control method, computer simulation was carried out. As a result, ISE of fuzzy model of refuse incineration plant is 0.015 and ITAE of control by proposed method, 352 which is better than that by manual operation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.6
• /
• pp.650-662
• /
• 1989

In this paper, a new algorithm for feature extraction and classification of recognizing Hanguel patterns is proposed. Inputed patterns classify into six basic formal patterns and divided into subregion of Hanguel phoneme and extract the crook feature from position information of the each subregion. Hanguel patterns are defined and are made of the indexed-sequence file using these crook features points. Hanguel patterns are recognized by retrievignt ehses two files such as feature indexed-sequence file and standard dictionary file. Thi paper show that the algorithm is very simple and easily construct the software system. Experimental result presents the output of feature extraction and grouping of input patterns. Proposed algorithm extract the crooked feature using distance transformation method within the rectangle of enclosure the characters. That uses the informationof relative position feature. It represents the 97% of recognition ratio.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.73-77
• /
• 2007

In this paper, we propose a VLSI architecture of an LMS filter based on a Cyclo-static scheduler for fast computation of LMS filteing algorithm which is widely used in adptive filtering area. This process is composed of two steps: scheduling and circuit synthesis. The scheduling step accepts a fully specified flow graph(FSFG) as an input, and generates an optimal Cyclo-static schedule in the sense of the sampling rate, the number of processors, and the input-output delay. Then the generated schedule is transformed so that the number of communication edges between the processors. The circuit synthesis part translates the modified schedule into a complete circuit diagram by performing resource allocations. The VLSI layout generation can be performed easily by an existing silicon compiler.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.1
• /
• pp.112-117
• /
• 2004

This paper suggests the design and analysis of the fuzzy sliding mode control for a nonlinear system using Takagi-Sugeno(T-S) fuzzy model. In this control scheme, identifying procedure that the input gain matrices in a T-S fuzzy model are manipulated into the same one is needed. The input disturbances generated in the identifying procedure are resolved by incorporating the disturbance treatment method of the conventional sliding mode control. The proposed control strategy can also treat the input disturbances that can not be linearized in the linearization procedure of T-S fuzzy modeling. Design example for the nonlinear system, an inverted pendulum on a cart, demonstrates the utility and validity of the proposed control scheme.