• Journal of the Korean Society of Visualization
• /
• v.19 no.1
• /
• pp.28-35
• /
• 2021

In this study, an image processing method for the measurement of two-phase bubbly flow is developed. Shadowgraphy images obtained by high-speed camera are used for analysis. Some bubbles are generated as single unit and others are overlapped or clustered. Single bubbles can be easily analyzed using parameters such as bubble shape, centroid, and area. But overlapped bubbles are difficult to transform clustered bubbles into segmented bubbles. Several approaches were proposed for the bubble segmentation such as Hough transform, connection point method and watershed. These methods are not enough for bubble segmentation. In order to obtain the size distribution of bubbles, we present a method of splitting overlapping bubbles using watershed and approximating them to ellipse. There is only 5% error difference between manual and automatic analysis. Furthermore, the error can be reduced down to 1.2% when a correction factor is used. The ellipse fitting algorithm developed in this study can be used to measure bubble parameters accurately by reflecting the shape of the bubbles.

• Journal of Korean Society for Quality Management
• /
• v.49 no.2
• /
• pp.201-211
• /
• 2021

Purpose: This paper proposes a density adaptive grid algorithm for the k-NN regression model to reduce the computation time for large datasets without significant prediction accuracy loss. Methods: The proposed method utilizes the concept of the grid with centroid to reduce the number of reference data points so that the required computation time is much reduced. Since the grid generation process in this paper is based on quantiles of original variables, the proposed method can fully reflect the density information of the original reference data set. Results: Using five real-life datasets, the proposed k-NN regression model is compared with the original k-NN regression model. The results show that the proposed density adaptive grid-based k-NN regression model is superior to the original k-NN regression in terms of data reduction ratio and time efficiency ratio, and provides a similar prediction error if the appropriate number of grids is selected. Conclusion: The proposed density adaptive grid algorithm for the k-NN regression model is a simple and effective model which can help avoid a large loss of prediction accuracy with faster execution speed and fewer memory requirements during the testing phase.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.6
• /
• pp.626-633
• /
• 2009

A motion planning algorithm is presented in this paper for a commercialized quadruped walking of robot pet. Stable walking is the basic requirement for a commercial-purpose legged robot. In order to secure the walking stability, modified body sway to the centroid of support polygon is addressed. By representation of walking motion with respect to the world coordinate system rather than body coordinate, it is possible to design the several gaits in unified fashion. The initial gait posture is introduced to maximize the stride and to achieve fast walking. The proposed walking motion planning is verified through computer simulation and experiments.

• Journal of Biosystems Engineering
• /
• v.24 no.3
• /
• pp.253-258
• /
• 1999

This study was conducted to develop an automatic egg inspection system for detecting creaked eggs based on acoustic impulse response. This system includes a sound generator, a sound sensor with signal conditioner, and a computer. The sound generator that hit the sharp of the dull edges of an egg was constructed with a ceramic ball pendulum attached to a rotary type solenoid. The signal conditioner included a pre-amplifier and a digital signal processing (DSP) board. The parameters for distinguishing cracked and normal eggs were the area, the geometric centroid and the resonance frequency of power spectrum of the acoustic signal generated. An algorithm for on-line detection of the continuous transferring eggs was developed. The performance tests resulted with 91% success rate to separate cracked and normal eggs at the rate of 1 second per an egg.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.579-583
• /
• 2001

In the area of data clustering in high dimensional space, one of the difficulties is the time-consuming process for computing vector similarities. It becomes worse in the case of the agglomerative algorithm with the group-average link and mean centroid method, because the cluster similarity must be recomputed whenever the cluster center moves after the merging step. As a solution of this problem, we present an incremental method of similarity computation, which substitutes the scalar calculation for the time-consuming calculation of vector similarity with several measures such as the squared distance, inner product, cosine, and minimum variance. Experimental results show that it makes clustering speed significantly fast for very high dimensional data.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.20 no.2
• /
• pp.119-129
• /
• 2002

On the process of cross-media color reproduction, a key feature is the use of gamut mapping techniques to adjust the different color gamuts between displays and printers. Even though a nunber of gamut mapping algorithms were published in the past, only limited colorimetric evaluation of them has been carried out to date. In this paper, the multi-anchor points clipping method(MAPC) was proposed as a new gamut mapping algorithm compensating the defects of the current algorithms such as nearest point clipping method(NPC), centroid clipping method(SLIN), straight clipping method(LLIN) and maximum chroma clipping method(CUSP).

• Journal of the Chungcheong Mathematical Society
• /
• v.16 no.2
• /
• pp.43-57
• /
• 2003

The boundary of a typical period-2 component in the degree-3 bifurcation set is formulated by a parametrization of its image which is the unit circle under the multiplier map. Some properties on the geometry of the boundary are investigated including the root point, the cusp and the length as well as the area bounded by the boundary curve. The centroid of the area for the period-2 component was numerically found with high accuracy and compared with its center. An algorithm drawing the boundary curve with Mathematica codes is proposed and its implementation exhibits a good agreement with the analysis presented here.

• Journal of Information Processing Systems
• /
• v.8 no.3
• /
• pp.421-436
• /
• 2012

Different types of fingerprint detection algorithms that are based on extraction of minutiae points are prevalent in recent literature. In this paper, we propose a new algorithm to locate the virtual core point/centroid of an image. The Euclidean distance between the virtual core point and the minutiae points is taken as a random variable. The mean, variance, skewness, and kurtosis of the random variable are taken as the statistical parameters of the image to observe the similarities or dissimilarities among fingerprints from the same or different persons. Finally, we verified our observations with a moment parameter-based analysis of some previous works.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.629-632
• /
• 2002

본 논문에서는 획득 영상에서 k-평균 알고리즘에 의한 무게중심을 이용하여 이동 물체를 검출하고 추적하는 방법을 제안하였다. 이동 물체의 검출은 획득 영상에 대하여 차영상 후 에지 검출에 의해 수행된다. 제안한 검출 방법은 빛의 밝기와 각도에 의해 발생된 그림자 등의 변형을 제거하고, 이동 물체만을 검출할 수 있어, 빛에 영향을 받은 영상에 대해서도 이동 물체를 양호하게 검출할 수 있다. 물체 추적은 검출된 이동 물체에 대하여 k-평균 알고리즘으로 세 개의 물체 무게중심을 구하고, 무게중심 부근의 화소 평균값과 무게중심간의 거리를 구한다. 다음 프레임들에 대하여 탐색영역의 화소 평균값에 의해 후보 무게중심을 구하고, 물체 무게중심과 구한 후보 무게중심들의 표준편차와 무게중심간의 거리 차를 이용하여 이동 물체를 추적한다. 그 결과, 이동 물체의 추적 속도를 개선시켰고, 물체 추적 오차율을 줄였다.

• Journal of Biosystems Engineering
• /
• v.17 no.2
• /
• pp.143-155
• /
• 1992

The aim of this study is to develop a general purpose algorithm for analyzing geometrical features of agricultural products and microscopic particles regardless of their numbers, shapes and positions with a computer vision system. Primarily, boundary informations of an image were obtained by Scan Line Coding and Scan & Chain Coding methods and then with these informations, geometrical features such as area, perimeter, lengths, widths, centroid, major and minor axes, equivalent circle diameter, number of individual objects, etc, were analyzed. The algorithms developed in this study was evaluated with test images consisting of a number of randomly generated ellipsoids or a few synthesized diagrams having different features. The result was successful in terms of accuracy.