http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
이형렬 김천과학대학 2003 김천과학대학 논문집 Vol.29 No.-
A thinning algorithm is a vary important factor in order to increase recognition rate in the character recognition. This paper is the study of a parpllel thinning algorithm available for the recognition of various characters, and it proposes the thinning algorithm which can extract the skeleton of the recognized character almost similar to the original pattern by using the depth value of each pixel constructing the lines. Characteristics of the proposed algorithm are easiness of implementation of parallelism, the result of thinning is one pixel width. The proposed algorithm requires small number of iteration and only a single pass per iteration; hence, it is substantially faster than other algorithms.
이형렬 김천과학대학 2001 김천과학대학 논문집 Vol.27 No.-
This paper proposes character recognition system for complex color documents. The proposed system consists of two components : text extraction and text recognition. It extracts text regions using a neural network that trains a set of texture discrimination masks for the given texture clases : text region and non-text region. And it extracts character-segments from the text regions using location and color information. Character recognition is performed by the comparison of the extracted character-segment and the templates that represent shapes of characters. To assess the validity, the experiments are performed with a variety of documents.
이형렬 김천과학대학 1997 김천과학대학 논문집 Vol.23 No.-
The problems of SK combinator graph reduction machine are large graph traversal space to search nodes of combinator and many execution of garbage collector result from allocation of additional space. In order to reduce graph traversal space, this paper proposed new reduction machine that transform reduction rule and node cdnstruction. In addition, to reduce execution time of garbage collector, this paper proposed varient node size depending on combinator. And then show experimental result for proposed reduction machine.
포화이진리트의 최소 영역 수직 수평 드로잉 알고리즘에 관한 연구
이형렬 김천과학대학 1996 김천과학대학 논문집 Vol.22 No.-
The graph embedding is the one-to-one mapping from the source graph to the target graph. In general, the source graph represents the structure of the computation to perform and the target graph is better suited to implementation in the computer environment at hand. In this paper, the problem of embedding a full binary tree with the minimal area to the square grid, which can be used in VI,SI design, is studied. The h-v drawing is defined to be the grid embedding which employs only the horizontal and the vertical straight line as edges. This paper presents a minimal area algorithm for the h-v drawing of a full binary tree with n nodes, which takes O(n) time.
이형렬,김홍읍 김천과학대학 2002 김천과학대학 논문집 Vol.28 No.-
Information representing the thickness of the original lines from the thinning results can be applied efficiently in order to implement the automated vectorizing system. This paper propose a preprocessing scheme of thinning which can show the information of the original lines' thickness of the thinning result. In the proposed scheme, the depth of each pixel constructing the lines of map was calculated, which was represented by the number of layers composed of neighboring pixels surrounding the original pixel. And then the original lines' thickness could be recognized through the depth information of the skeleton from the thinning results. We implemented the proposed scheme and experimented on a contour map. Using the depth information of the skeleton, we could easily distinguish each line of the contour either an intermediate or an index contour.
비평가인자 함수언어의 다중스레드 코드 생성을 위한 생성기의 설계
김홍읍,이형렬 김천과학대학 1998 김천과학대학 논문집 Vol.24 No.-
Non-strict functional language with implicit parallelism needs dynamic scheduling and synchronization, because of non-strict's mechanism. Multithreaded model is efficient parallel processing model to solve latency time, dynamic scheduling, synchronization problemby combination of dataflow mode and von Neumann model. This model's efficiency is determined by construcion of thread and source language. This paper's generator translates kernel language, intermediate code, from non-strict functional language with implicit parallelism. Now and then generator translates multithreaded code from kernel language through dataflow graph.