• Journal of the Semiconductor & Display Technology
• /
• 제9권3호
• /
• pp.59-63
• /
• 2010

This paper proposes computer visual inspection algorithms for various LCD defects which are found in a manufacturing process. Modular vision processing steps are required in order to detect different types of LCD defects. Those key modules include RGB filtering for pixel defects, gray-scale morphological processing and Hough transform for line defects, and adaptive threshold for spot defects. The proposed algorithms can give users detailed information on the type of defects in the LCD panel, the size of defect, and its location. The machine vision inspection system is implemented using C language in an embedded Linux system for a high-speed real-time image processing. Experiment results show that the proposed algorithms are quite successful.

• The Journal of the Acoustical Society of Korea
• /
• 제18권3E호
• /
• pp.37-43
• /
• 1999

In this paper, we present a new technique for the optimal local decomposition of convex structuring elements on a hexagonal grid, which are used as templates for morphological image processing. Each basis structuring element in a local decomposition is a local convex structuring element, which can be contained in hexagonal window centered at the origin. Generally, local decomposition of a structuring element results in great savings in the processing time for computing morphological operations. First, we define a convex structuring element on a hexagonal grid and formulate the necessary and sufficient conditions to decompose a convex structuring element into the set of basis convex structuring elements. Further, a cost function was defined to represent the amount of computation or execution time required for performing dilations on different computing environments and by different implementation methods. Then the decomposition condition and the cost function are applied to find the optimal local decomposition of convex structuring elements, which guarantees the minimal amount of computation for morphological operation. Simulation shows that optimal local decomposition results in great reduction in the amount of computation for morphological operations. Our technique is general and flexible since different cost functions could be used to achieve optimal local decomposition for different computing environments and implementation methods.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• 제31B권11호
• /
• pp.97-108
• /
• 1994

A modified Karhunen-Loeve transformation technique using normalization and simultaneous diagonalization of two sample covariance matrices is proposed to separate the object from the background. The transformation technique for the separation of local data structure through maximizing the ratio of sample variances between two classes was identified as a promising one for a preprocessing of multi-variate signal processing algorithms using neighborhood operators including morphological filtering. To relate the separation quality of the proposed technique to a morphological measure, average height was defined by using morphological pattern spectrum. A practical implementation of the transformation technique was tested experimentally and the theoretical results were confirmed.

• Journal of the Institute of Convergence Signal Processing
• /
• 제14권1호
• /
• pp.57-61
• /
• 2013

A hybrid genetic algorithm based learning method for the morphological neural networks (MNN) is proposed. The morphological neural networks are based on max-plus algebra, therefore, it is difficult to optimize the coefficients of MNN by the learning method with derivative operations. In order to solve the difficulty, a hybrid genetic algorithm based learning method to optimize the coefficients of MNN is used. Through the image compression/reconstruction experiment using test images extracted from standard image database(SIDBA), it is confirmed that the quality of the reconstructed images obtained by the proposed method is better than that obtained by the conventional neural networks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2017년도 추계학술발표대회
• /
• pp.799-802
• /
• 2017

We attempt to combines concepts of Morphological Operator(MO) and Convolutional Neural Networks(CNN) to improve image-to-image translation. To do this, we propose an operation that approximates morphological operations. Also we propose S-Convolution, an operation that extends the operation to use multiple filters like CNN. The experiment result shows that it can learn MO with big filter using multiple S-convolution layer of small filter. To validate effectiveness of the proposed layer in image-to-image translation we experiment with GAN with S-convolution applied. The result showed that GAN with S-convolution can achieve distinct result from that of GAN with CNN.

• The Journal of the Korea institute of electronic communication sciences
• /
• 제7권5호
• /
• pp.967-974
• /
• 2012

In this paper, a vehicle detection algorithm with HD CCTV camera images using GMM(Gaussian Mixture Model) algorithm and mathematical morphological processing is proposed. At the first stage, background could be estimated using GMM from CCTV input image signal and then object could be separated from difference image of the input image and background image. At the second stage, candidated object were reformed by using mathematical morphological processing. Finally, vehicle object could be detected using vehicle size informations depend on distance and vehicle type in tunnel. Through real experiments in tunnel, it is shown that the proposed system works well.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• 제48권9호
• /
• pp.1167-1174
• /
• 1999

In this paper, we present a new technique for the local decomposition of convex structuring elements for morphological image processing. Local decomposition of a structuring element consists of local structuring elements, in which each structuring element consists of a subset of origin pixel and its eight neighbors. Generally, local decomposition of a structuring element reduces the amount of computation required for morphological operations with the structuring element. A unique feature of our approach is the use of linear integer programming technique to determine optimal local decomposition that guarantees the minimal amount of computation. We defined a digital convex polygon, which, in turn, is defined as a convex structuring element, and formulated the necessary and sufficient conditions to decompose a digital convex polygon into a set of basis digital convex polygons. We used a set of linear equations to represent the relationships between the edges and the positions of the original convex polygon, and those of the basis convex polygons. Further. a cost function was used represent the total processing time required for computation of dilation/erosion with the structuring elements in a decomposition. Then integer linear programming was used to seek an optimal local decomposition, that satisfies the linear equations and simultaneously minimize the cost function.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제17권11호
• /
• pp.1264-1270
• /
• 1992

MF(Morphological filter) is generally composed of several morphological operation, which are the diverse structuring element. The two basic operation are erosion and dilation. The two other operation, opening and closing, are defined based on these two operation. Performance of open-closing(OC) is better exellent than close-opening(CO) to reduce noise of image data with Gaussian noise. In this paper, to use the hybrid median filter in processing the image, is shown that hybrid median filter has better results image quality than other filters, to analyze by computer simulation.

• Language and Information
• /
• 제6권2호
• /
• pp.105-128
• /
• 2002

Morphologically annotated corpora are the basis for many tasks of computational linguistics. Most current approaches use statistically driven methods of morphological analysis, that provide just POS-tags. While this is sufficient for some applications, a rule-based full morphological analysis also yielding lemmatization and segmentation is needed for many others. This work thus aims at 〔1〕 introducing a rule-based Korean morphological analyzer called Kormoran based on the principle of linearity that prohibits any combination of left-to-right or right-to-left analysis or backtracking and then at 〔2〕 showing how it on be used as a POS-tagger by adopting an ordinary technique of preprocessing and also by filtering out irrelevant morpho-syntactic information in analyzed feature structures. It is shown that, besides providing a basis for subsequent syntactic or semantic processing, full morphological analyzers like Kormoran have the greater power of resolving ambiguities than simple POS-taggers. The focus of our present analysis is on Korean text.

• ETRI Journal
• /
• 제46권1호
• /
• pp.137-153
• /
• 2024

This study introduces a new approach in Korean morphological analysis combining dictionary-based techniques with Transformer-based deep learning models. The key innovation is the use of a BERT-based reranking system, significantly enhancing the accuracy of traditional morphological analysis. The method generates multiple suboptimal paths, then employs BERT models for reranking, leveraging their advanced language comprehension. Results show remarkable performance improvements, with the first-stage reranking achieving over 20% improvement in error reduction rate compared with existing models. The second stage, using another BERT variant, further increases this improvement to over 30%. This indicates a significant leap in accuracy, validating the effectiveness of merging dictionary-based analysis with contemporary deep learning. The study suggests future exploration in refined integrations of dictionary and deep learning methods as well as using probabilistic models for enhanced morphological analysis. This hybrid approach sets a new benchmark in the field and offers insights for similar challenges in language processing applications.