• Journal of Electrical Engineering and Technology
• /
• 제6권4호
• /
• pp.573-579
• /
• 2011

To meet the scalability and performance requirements of data analyses, which often involve voluminous data, efficient parallel or concurrent algorithms and frameworks are essential. We present a high-performance Korean morphological analyzer which employs the MapReduce framework on the graphics processing unit (GPU). MapReduce is a programming framework introduced by Google to aid the development of web search applications on a large number of central processing units (CPUs). GPUs are designed as a special-purpose co-processor. Their programming interfaces are typically formulated for graphics applications. Compared to CPUs, GPUs have greater computation power and memory bandwidth; however, GPUs are more difficult to program because of the design of their architectures. The performance of the Korean morphological analyzer using the MapReduce framework on the GPU is evaluated in comparison with the CPU-based model. The proposed Korean Morphological analyzer shows promising scalable performance on distributed computing with the GPU.

• 전기전자학회논문지
• /
• 제18권2호
• /
• pp.234-239
• /
• 2014

This paper proposes a new automatic detection method to inspect mura defects on display film surface using morphological image processing and labeling. This automatic detection method for mura defects on display films comprises 3 phases of preprocessing with morphological image processing, Gabor filtering, and labeling. Since distorted results could be obtained with the presence of non-uniform illumination, preprocessing step reduces illumination components using morphological image processing. In Gabor filtering, mura images are created with binary coded mura components using Gabor filters. Subsequently, labeling is a final phase of finding the mura defect area using the difference between large mura defects and values in the periphery. To evaluate the accuracy of the proposed detection method, detection rate was assessed by applying the method in 200 display film samples. As a result, the detection rate was high at about 95.5%. Moreover, the study was able to acquire reliable results using the Semu index for luminance mura in image quality inspection.

• 한국통신학회논문지
• /
• 제17권10호
• /
• pp.1109-1116
• /
• 1992

Mathematical morphology는 이론적 배경으로 신호 및 시스템의 기하학적 특성을 해석하는데 우수하고 잡음이 섞인 데이터를 고르기에 있어서 매우 성공적으로 적용되고 있다. 본 논문에서는 morphological필터의 하드웨어 구현은 같은 회로에서 gray scale dilation과 erosion을 수행하여 최소값과 최대값을 선택하도록 함으로써 회로의 복잡성을 줄이고 병렬처리가 가능하도록 하였다. Morphological filter의 구조는 structuring element블록, 이미지 데이타 블록, 제어 블록, ADD 블록, MIN/MAX블록으로 구성되고 실시간 처리가 가능하도록 하드웨어를 설계, one chip화 한다.

• ETRI Journal
• /
• 제42권1호
• /
• pp.101-107
• /
• 2020

For Korean language processing, morphological analysis is a critical component that requires extensive work. This morphological analysis can be conducted in an end-to-end manner without requiring a complicated feature design using a sequence-to-sequence model. However, the sequence-to-sequence model has a time complexity of O(n²) for an input length n when using the attention mechanism technique for high performance. In this study, we propose a linear-time Korean morphological analysis model using a local monotonic attention mechanism relying on monotonic alignment, which is a characteristic of Korean morphological analysis. The proposed model indicates an extreme improvement in a single threaded environment and a high morphometric F1-measure even for a hard attention model with the elimination of the attention mechanism formula.

• 한국항해학회지
• /
• 제19권3호
• /
• pp.21-28
• /
• 1995

Mathematical morphology skeleton image processing makes many partial skeleton image planes from an original binary image. And the original binary image can be reconstructed without any distortion by summing the first partial skeleton image plane and each dilated partial skeleton image planes using the same structuring element. Especially compression effects of Elias coding to the morphological globally minimal skeleton(GMS) image, is better than that of PCX and Huffman coding. And then this paper proposes mathematical morphological GMS image processing which can be applied to a binary image transmitting for facimile and big size(bigger than $64{\times}64$ size) bitmap fonts storing in a memory.

• 한국항해학회지
• /
• 제20권4호
• /
• pp.99-109
• /
• 1996

Though median filter is used for removing noise and smoothing image. But, the result of it has distortion around edge. And then, this paper proposes new noise removing algorithm by recursive morphological processing. Basic operation is same each other, but there is some different processing method between recursive morphology and general morphology theory. This recursive morphological filter can be viewed as the weighted order static filter, and then it has a weighted SE(structuring element). Especially using this algorithm to remove the 10% gaussian noise, this paper confirmed that PSNR is improved about 0.642~1.5757 db reserving edge well better than the results of the traditional median filter.

• 대한음성학회:학술대회논문집
• /
• 대한음성학회 2003년도 10월 학술대회지
• /
• pp.75-78
• /
• 2003

The paper deals with experimental results which was performed to investigate the characteristics of Korean lexical processing and representation of morphemes involved in Korean noun and verb Eojeols. The investigation is also related with the 'English past tense debate' which deals with human mental computation. Experiments using fMRI methods, show that Korean noun Eojeols and both regular and irregular verb Eojeols show a similar activation pattern. Thus, the results indicate that the morphological processing in Korean noun and verb Eojeols are performed quite differently than the Indo-European morphological processing.

• 한국언어정보학회지:언어와정보
• /
• 제15권1호
• /
• pp.1-12
• /
• 2011

This study investigates morphologically complex nouns in Korean through a series of priming studies. Two experiments examined whether morphological affixes on Korean nouns were decomposed or processed as a whole. Two types of morphological affixes were examined: morpho-syntactic case markers and the plural marker '-tul'. Results showed that priming occurred for the plural marker with SOAs of 80 ms and 160 ms, but no priming occurred for the morpho-syntactic case markers. These results suggest that the morphological processing for these two types of affixes differ. We argue that Korean nouns with the plural suffix are decomposed into the stem and affix, supporting the Decomposition Model (Pinker & Ullman, 2002). We suggest that while plural markers are truly morphological affixes, case markers in Korean are morpho-syntactic, and thus presuppose the existence of other syntactic elements, such as the matrix verb, hence the lack of priming effects.

• Journal of Information Processing Systems
• /
• 제1권1호
• /
• pp.41-48
• /
• 2005

This paper presents the development of a morphological processor for the Mongolian language, based on the two-level morphological model which was introduced by Koskenniemi. The aim of the study is to provide Mongolian syntactic parsers with more effective information on word structure of Mongolian words. First hand written rules that are the core of this model are compiled into finite-state transducers by a rule tool. Output of the compiler was edited to clarity by hand whenever necessary. The rules file and lexicon presented in the paper describe the morphology of Mongolian nouns, adjectives and verbs. Although the rules illustrated are not sufficient for accounting all the processes of Mongolian lexical phonology, other necessary rules can be easily added when new words are supplemented to the lexicon file. The theoretical consideration of the paper is concluded in representation of the morphological phenomena of Mongolian by the general, language-independent framework of the two-level morphological model.

• 정보과학회 논문지
• /
• 제43권4호
• /
• pp.430-436
• /
• 2016

형태소 분석시 나타나는 고유명사나 신조어 등의 미등록어에 대한 처리는 다양한 도메인의 문서 처리에 필수적이다. 이 논문에서는 3단계 확률 기반 형태소 분석에서 미등록어를 분리하고 태깅하기 위한 방법을 제시한다. 이 방법은 고유명사나 일반명사와 같은 개방어 뒤에 붙는 다양한 접미사를 분석하여 미등록 개방어를 추정할 수 있도록 했다. 이를 위해 형태소 품사 부착 말뭉치에서 자동으로 접미사 패턴을 학습하고, 확률 기반 형태소 분석에 맞도록 미등록 개방어의 분리 및 태깅 확률을 계산하는 방법을 제시하였다. 실험 결과, 제안한 방법은 새로운 미등록 용어가 많이 나오는 문서에서 미등록어 처리 성능을 크게 향상시켰다.