• Journal of the Korea Convergence Society
• /
• v.6 no.1
• /
• pp.1-5
• /
• 2015

In this paper, we describe the design of a fusion labeling system which is controlled by the Wi-Fi signals. The Current labeling system which is used in the industry is designed to work independently on the production line not connected with internet network services. For such reasons, it is very inconvenient for the labeling system to transfer such labeling data of the production line to the server computer. We propose a labeling system connected to the Wi-Fi service being able to send real-time transmission of labeling data. This system can supply the labeling data of production line to the server computer in realtime and improve the production quality than the existing system.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.119-139
• /
• 2022

This paper deals with the λ-labeling and L(2, 1)-coloring of simple graphs. A λ-labeling of a graph G is any labeling of the vertices of G with different labels such that any two adjacent vertices receive labels which differ at least two. Also an L(2, 1)-coloring of G is any labeling of the vertices of G such that any two adjacent vertices receive labels which differ at least two and any two vertices with distance two receive distinct labels. Assume that a partial λ-labeling f is given in a graph G. A general question is whether f can be extended to a λ-labeling of G. We show that the extension is feasible if and only if a Hamiltonian path consistent with some distance constraints exists in the complement of G. Then we consider line graph of bipartite multigraphs and determine the minimum number of labels in L(2, 1)-coloring and λ-labeling of these graphs. In fact we obtain easily computable formulas for the path covering number and the maximum path of the complement of these graphs. We obtain a polynomial time algorithm which generates all Hamiltonian paths in the related graphs. A special case is the Cartesian product graph K_n☐K_n and the generation of λ-squares.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.10
• /
• pp.1355-1360
• /
• 2020

In a map, placing the labels, corresponding to names or explanations of specific features, is called map labeling. In this paper, n points on a line are given, and placing rectangular labels for the points is considered. Particularly, the labels have a same height and their lower sides lie on a straight line in the upper of the line on which the given points are. The points and the labels are connected by polygonal lines, which are called leader lines. The leader lines are classified into straight leader lines and bended leader lines, where the straight leader line consists of only the vertical line and the bended leader line consists of vertical, horizontal, vertical lines. The problem is placing the labels to minimize the number of bended leader lines, and we propose an O(nlogn)-time algorithm, which improves the O(n2)-time algorithm previously provided in [13].

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2002.04a
• /
• pp.357-362
• /
• 2002

Most of battery industries are growing explosively as a core strategy industry for the development of the semi-conductor, the LCD, and the mobile communication device. In this thesis, dynamic characteristics of the steel can labeling machine on the automatic cell assembly line are studied. Dynamic characteristic analysis consists of dynamic behavior analysis and finite element analysis and is necessary for effective design of machines. In the dynamic behavior analysis, the displacement, velocity, applied force and angular velocity of each components are simulated according to each part. In the FEA, stress analysis, mode analysis, and frequency analysis are performed for each part. The results of these simulations are used for the design specification investigation and compensation for optimal design of cell manufacturing line. Therefore, Virtual Engineering of the steel can labeling machine on the automatic cell assembly line systems are modeled and simulated. 3D motion behavior is visualized under real-operating condition on the computer window. Virtual Prototype make it possible to save time by identifying design problems early in development, cut cost by reducing making hardware prototype, and improve quality by quickly optimizing full-system performance. As the first step of CAE which integrates design, dynamic modeling using ADAMS and FEM analysis using NASTRAN are developed.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1171-1176
• /
• 2003

In this paper, we propose an effective bar code detection algorithm using the feature analysis and the labeling. After computing the direction of pixels using four line operators, we obtain the histogram about the direction of pixels by a block unit. We calculate the difference between the maximum value and the minimum value of the histogram and consider the block that have the largest difference value as the block of the bar code region. We get the line passing by the bar code region with the selected block but detect blocks of interest to get the more accurate line. The largest difference value is used to decide the threshold value to obtain the binary image. After obtaining a binary image, we do the labeling about the binary image. Therefore, we find blocks of interest in the bar code region. We calculate the gradient and the center of the bar code with blocks of interest, and then get the line passing by the bar code and detect the bar code. As we obtain the gray level of the line passing by the bar code, we grasp the information of the bar code.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.1
• /
• pp.80-89
• /
• 1992

This paper presents algorithms which are region labeling and data structure of a boundary segmentation as image intermediate description process. In the method, the algorithms are region labeling, boundary segmentation, line and curve fitting and extracting data structure of each segment. As a result, a data structure of image is described by a set of region number, segment number, line or curve, starting point and end point of each segment and coefficient of line or curve. These data structures would serve for higher level processing as object recognition. For example we will use this data structure to solve the correspondence problem of stereoscopic image information. And we verified these algorithms through the image reconstruction of data structure.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.267-270
• /
• 2010

In filtering of urban lidar data, low outliers or opening underground areas may cause errors that some ground points are labelled as non-ground objects. To solve such a problem, this paper proposes an automated method which consists of RANSAC algorithm, one-dimensional labeling, and morphology filter. All processes are conducted along the lidar scan line profile for efficient computation. Lidar data over Dajeon, Korea is used and the final results are evaluated visually. It is shown that the proposed method is quite promising in urban dem generation.

• Journal of Microbiology and Biotechnology
• /
• v.21 no.5
• /
• pp.477-482
• /
• 2011

There are accumulating evidences suggesting that connexin (Cx), a gap junction channel-forming protein, acts as a growth suppressor in various cancer cells, and this effect is attributeed to the gap junction-mediated intercellular communication (GJIC). In order to characterize the relationship between the growth-arresting activity of Cx26 and its cytoplasmic localizations after expression, we linked a nuclear export signal (NES) sequence to Cx26 cDNA before transfecting into a rat breast cancer cell line. A confocal fluorescent microscopic observation revealed that the insertion of NES minimized the nuclear expression of Cx26, and increased its cytoplasmic expression, including plasma membrane junctions. Total cell counting and BrdUrd-labeling experiments showed that the growth of the breast cancer cells was inhibited by 74% upon transfection of Cx26-NES, whereas only 9% inhibition was observed with only Cx26 cDNA.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.4
• /
• pp.359-365
• /
• 2011

This study aims at filtering ALS points into ground and non-ground effectively through labeling and window based algorithm by utilizing 2D adjacency based on scan line. Firstly, points adjacency is constructed through minimal search based on scan line. Connected component labeling algorithm is applied to classify raw ALS points into ground and non-ground by utilizing the adjacency structure. Then, some small objects are removed by morphology filtering, and isolated ground points are restored by IDW estimation. The experimental results shows that the method provides good filtering performance( about 97% accuracy) for diverse sites, and the overall processing takes less time than converting raw data into TIN or raster grid.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.5
• /
• pp.841-849
• /
• 2001

The pixel information of the object was obtained sequentially and pixels were clustered to a label by the line labeling method. Feature points were determined by finding the slope for edge pixels after selecting the fixed number of edge pixels. The slope was estimated by the least square method to reduce the detection error. Once a matching point was determined by comparing the feature information of the object and the pattern, the parameters for translation, scaling and rotation were obtained by selecting the longer line of the two which passed through the matching point from left and right sides. Finally, modified Hausdorff Distance has been used to identify the similarity between the object and the given pattern. The multi-label method was developed for recognizing the patterns with more than one label, which performs the modified Hausdorff Distance twice. Experiments have been performed to verify the performance of the proposed algorithm and method for simple target image, complex target image, simple pattern, and complex pattern as well as the partially hidden object. It was proved via experiments that the proposed image matching algorithm for recognizing the object had a good performance of matching.