• Smart Media Journal
• /
• v.1 no.4
• /
• pp.27-34
• /
• 2012

In this paper, a novel text binarization is presented that can deal with some complex conditions, such as shadows, non-uniform illumination due to highlight or object projection, and messy backgrounds. To locate the target text region, a focus line is assumed to pass through a text region. Next, connected component analysis and stroke width estimation based on location information of the focus line is used to locate the bounding box of the text region, and each box of connected components. A series of classifications are applied to identify whether each CC(Connected component) is text or non-text. Also, a modified K-means clustering method based on an HCL color space is applied to reduce the color dimension. A text binarization procedure based on location of text component and seed color pixel is then used to generate the final result.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.1
• /
• pp.113-118
• /
• 2011

This paper proposes computer visual inspection algorithms for PCB defects which are found in a manufacturing process. The proposed method can detect open circuit and short circuit on bare PCB without using any reference images. It performs adaptive threshold processing for the ROI (Region of Interest) of a target image, median filtering to remove noises, and then analyzes connected components of the binary image. In this paper, the connected components of circuit pattern are defined as 6 types. The proposed method classifies the connected components of the target image into 6 types, and determines an unclassified component as a defect of the circuit. The analysis of the original target image detects open circuits, while the analysis of the complement image finds short circuits. 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.

• Journal of the Semiconductor & Display Technology
• /
• v.21 no.1
• /
• pp.22-26
• /
• 2022

This paper proposes a new method for the recognition of road surface marks and numbers. The proposed method designates a region of interest on the road surface without first detecting a lane. The road surface markings are extracted by location and size using a connection component analysis. Distortion due to the perspective effect is minimized by normalizing the size of the road markings. The road surface marking of the connected component is recognized by matching it with the stored road marking templates. The proposed method is implemented using C language in Raspberry Pi 4 system with a camera module for a real-time image processing. The system was fixedly installed in a moving vehicle, and it recorded a video like a vehicle black box. Each frame of the recorded video was extracted, and then the proposed method was tested. The results show that the proposed method is successful for the recognition of road surface marks and numbers.

• International Journal of Contents
• /
• v.8 no.1
• /
• pp.30-38
• /
• 2012

Text extraction and binarization are the important pre-processing steps for text recognition. The performance of text binarization strongly related to the accuracy of recognition stage. In our proposed method, the first stage based on line detection and shape feature analysis applied to locate the position of a business card and detect the shape from the complex environment. In the second stage, several local regions contained the possible text components are separated based on the projection histogram. In each local region, the pixels grouped into several connected components based on the connected component labeling and projection histogram. Then, classify each connect component into text region and reject the non-text region based on the feature information analysis such as size of connected component and stroke width estimation.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.8
• /
• pp.1883-1897
• /
• 1993

Interactive computer-aided analysis of mechanical systems has recently been undergoing an evolution due to highly efficient computer graphics. The industrial implementation of state-of-the-art analytical developments in mechanisms has been facilitated by computer-aided design packages because these rigid-body mechanism analysis programs dramatically reduce the time required for linkage design. This paper proposes a component modular approach to computeraided kinematic motion analysis for general planar multiloop mechanisms. Most multiloop mechanisms can be decomposed into serveral components. The kinematic properties (position, velocity, and acceleration) of every node can then be determined from the kinematic analysis of the corresponding component modules by a closed-form solution procedure. In this paper, 8 types of modules are defined and formulations for kinematic analysis of the component modules are derived. Then a computer-aided kinematic analysis program is developed using the proposed approach and the solution procedure of an example shows the effectiveness and accuracy on the approach.

• Journal of Power Electronics
• /
• v.18 no.3
• /
• pp.746-756
• /
• 2018

Harmonic resonance exists in grid-connected inverter systems. In order to determine the network components that contribute to harmonic resonance and the composition of the resonant circuit, sensitivity theory is applied to the resonance characteristic analysis. Based on the modal analysis, the theory of sensitivity is applied to derive a formula for determining the sensitivities of each network component parameter under a resonance circumstance that reflects the participation of the network component. The solving formula is derived for both parallel harmonic resonance and series harmonic resonance. This formula is adopted to a 4-node grid-connected test system. The analysis results reveal that for a certain frequency, the participation of parallel resonance and series resonance are not the same. Finally, experimental results demonstrate that the solving formula for sensitivity is feasible for grid-connected systems.

• The Journal of the Korea Contents Association
• /
• v.22 no.6
• /
• pp.56-68
• /
• 2022

Recently, as the demand for real-time processing increases, studies on a dynamic graph that changes over time has been actively done. There is a connected components processing algorithm as one of the algorithms for analyzing dynamic graphs. GPUs are suitable for large-scale graph calculations due to their high memory bandwidth and computational performance. However, when computing the connected components of a dynamic graph using the GPU, frequent data exchange occurs between the CPU and the GPU during real graph processing due to the limited memory of the GPU. The proposed scheme utilizes the Weighted-Quick-Union algorithm to process large-scale graphs on the GPU. It supports fast connected components computation by applying the size to the connected component label. It computes the connected component by determining the parts to be recalculated and minimizing the data to be transmitted to the GPU. In addition, we propose a processing structure in which the GPU and the CPU execute asynchronously to reduce the data transfer time between GPU and CPU. We show the excellence of the proposed scheme through performance evaluation using real dataset.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.4
• /
• pp.826-832
• /
• 2016

In this paper, we propose a tongue diagnosis system for determining the presence of specific taste crack area as a first step in the digital tongue diagnosis system that anyone can use easily without special equipment and expensive digital tongue diagnosis equipment. Training DB was developed by the Haar-like feature, Adaboost learning on the basis of 261 pictures which was collected in Oriental medicine. Tongue candidate regions were detected from the input image by the learning results and calculated the average value of the HUE component to separate only the tongue area in the detected candidate regions. A tongue area is separated through the Connected Component Labeling from the contour of tongue detected. The palate regions were divided by the relative width and height of the tongue regions separated. Image on the taste area is converted to gray image and binarized with each of the average brightness values. A crack in the presence or absence was determined via Connected Component Labeling with binary images.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.11 no.3
• /
• pp.177-183
• /
• 2003

Vibration analysis using component mode synthesis method was carried out to identify that to some extent each component contributed to the whole vibration of a powertrain consisting of several components. This analysis helped decide the component to be modified to reduce the powertrain weight, without degrading its current vibration characteristics. As a result, a cylinder block was chosen as a redesign object. Topology optimization analysis was performed to design the topology of the cylinder block whose flange connected with the transmission was chosen to be the design domain. After all, a new prototype of cylinder block was manufactured based on the analysis results for the verification experiment. It was confirmed from the analytical and experimental results that u optimally designed cylinder block had an advantage over the current one in the powertrain weight, with the powertrain vibration characteristics improved slightly.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1297-1309
• /
• 2016

In this paper, an efficient connected component labeling (CCL) method was proposed. The proposed method is based on GPU parallelism. The CCL is very important in various applications where images are analysed. However, the label of each pixel is dependent on the connectivity of adjacent pixels so that it is not very easy to be parallelized. In this paper, a GPU-based parallel CCL techniques were proposed and applied to the analysis of radar signal. Since the radar signals contains complex and large data, the efficiency of the algorithm is crucial when realtime analysis is required. The experimental results show the proposed method is efficient enough to be successfully applied to this application.