• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.959-968
• /
• 2019

In the agricultural industry, wireless sensor network technology has being applied by utilizing various sensors and embedded systems. In particular, a lot of researches are being conducted to diagnose diseases of crops early by using sensor network. There are some difficulties on traditional research how to diagnose crop diseases is not practical for agriculture. This paper proposes the algorithm which enables to investigate and analyze the crop leaf image taken by image camera and detect the infected area within the image. We applied the enhanced k-means clustering method to the images captured at horticulture facility and categorized the areas in the image. Then we used the edge detection and edge tracking scheme to decide whether the extracted areas are located in inside of leaf or not. The performance was evaluated using the images capturing tomato leaves. The results of performance evaluation shows that the proposed algorithm outperforms the traditional algorithms in terms of classification capability.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.2
• /
• pp.379-384
• /
• 2022

In a wireless sensor network, a large number of sensor nodes are deployed in an environment where direct access is difficult. It is difficult to supply power, such as replacing the battery or recharging it. It is very important to use the energy with the sensor node. Therefore, an important consideration to increase the lifetime of the network is to minimize the energy consumption of each sensor node. If the energy of the wireless sensor node is exhausted and discharged, it cannot function as a sensor node. Therefore, it is a method proposed in various protocols to minimize the energy consumption of nodes and maintain the network for a long time. We consider the center point and residual energy of the cluster, and the plot point and K-means (WSN suggests optimal clustering). We want to evaluate the performance of the KOCED protocol. We compare protocols to which the K-means algorithm, one of the latest machine learning methods, is applied, and present performance evaluation factors.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.21 no.7
• /
• pp.91-97
• /
• 2022

Pipes transport and supply fuel in various categories; however, corrosion occurs because of the external environment, impurities are mixed in the fuel, and substances leak to the outside, which can lead to serious accidents. Therefore, in this study, inspection equipment using a laser scanner was manufactured to classify conditions according to the degree of corrosion of the outer wall of the pipe, and the corrosion height and maximum value of the pipe were obtained from the surface information. Using the k-means method, it was classified into four states, and the standard of the average height and maximum height of corrosion for each state was derived.

• Proceedings of the Korean Statistical Society Conference
• /
• 2004.11a
• /
• pp.171-174
• /
• 2004

기업들이 심화된 경쟁체제 속에서 고객에 대한 보다 심층적인 이해를 필요로 하고 정보기술의 발달로 각 요소활동내용의 데이터화가 가능해짐에 따라 CRM으로 대변되는 고객 정보의 전략적 활용이 매우 중요하게 되었다. 이를 위해 기업은 고객에 대한 이해를 바탕으로 고객관리 및 마케팅을 수행하기 위한 필수적인 도구인 고객세분화를 수행하고 있다. 본 연구에서는 신용카드고객의 카드사용행태에 근거하여 서로 유사한 사용행태를 보이는 고객군으로 세분화하는 과정을 소개한다. 고객이 실제로 카드를 사용하면서 발생시킨 거래정보에만 의존하여 고객세분화를 수행하였으며 이는 마케팅의 관점에서 상당히 의미 있는 내용이라 볼 수 있다. 고객세분화를 위하여 데이터마이닝기법인 k-평균군집방법과 최장연결법에 의한 계보적 군집방법을 활용하였다

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.374-379
• /
• 2007

This paper focuses on the improvement of fault detection algorithm in FRTU(feeder remote terminal unit) on the feeder of distribution power system. FRTU is applied to fault detection schemes for phase fault and ground fault. Especially, cold load pickup and inrush restraint functions distinguish the fault current from the normal load current. FRTU shows FI(Fault Indicator) when the fault current is over pickup value or inrush current. STFT(Short Time Fourier Transform) analysis provides the frequency and time Information. FCM(Fuzzy C-Mean clustering) algorithm extracts characteristics of harmonics. The neural network system as a fault detector was trained to distinguish the inruih current from the fault status by a gradient descent method. In this paper, fault detection is improved by using FCM and neural network. The result data were measured in actual 22.9kV distribution power system.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.6
• /
• pp.1100-1105
• /
• 2006

Severe distortions of colors in the obtained images have made it difficult for color codes to expand their applications. To reduce the effect of color distortions on reading colors, it will be more desirable to statistically process as many pixels in the individual color region as possible, than relying on some regularly sampled pixels. This process may require segmentation, which usually requires edge detection. However, edges in color codes can be disconnected due tovarious distortions such as zipper effect and reflection, to name a few, making segmentation incomplete. Edge linking is also a difficult process. In this paper, a more efficient approach to reducing the effect of color distortions on reading colors, one that excludes precise edge detection for segmentation, was obtained by employing the k-means clustering algorithm. And, in detecting color codes, the properties of both six safe colors and grays were utilized. Experiments were conducted on 144, 4M-pixel, outdoor images. The proposed method resulted in a color-code detection rate of 100% fur the test images, and an average color-reading accuracy of over 99% for the detected codes, while the highest accuracy that could be achieved with an approach employing Canny edge detection was 91.28%.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.529-542
• /
• 2000

Recent years, the use of multimedia information is rapidly increasing, and the video media is the most rising one than any others, and this field Integrates all the media into a single data stream. Though the availability of digital video is raised largely, it is very difficult for users to make the effective video access, due to its length and unstructured video format. Thus, the minimal interaction of users and the explicit definition of video structure is a key requirement in the lately developing image and video management systems. This paper defines the terms and hierarchical video structure, and presents the system, which construct the clustering-based video hierarchy, which facilitate users by browsing the summary and do a random access to the video content. Instead of using a single feature and domain-specific thresholds, we use multiple features that have complementary relationship for each other and clustering-based methods that use normalization so as to interact with users minimally. The stage of shot boundary detection extracts multiple features, performs the adaptive filtering process for each features to enhance the performance by eliminating the false factors, and does k-means clustering with two classes. The shot list of a result after the proposed procedure is represented as the video hierarchy by the intelligent unsupervised clustering technique. We experimented the static and the dynamic movie videos that represent characteristics of various video types. In the result of shot boundary detection, we had almost more than 95% good performance, and had also rood result in the video hierarchy.

• Journal of Navigation and Port Research
• /
• v.28 no.3
• /
• pp.185-191
• /
• 2004

The mean and Clustering are important methods of data mining, which is now widely applied to various multi-attributes problem However, feature weighting and feature selection are important in those methods bemuse features may differ in importance and such differences need to be considered in data mining with various multiful-attributes problem. In addition, in the event of arithmetic mean, which is inadequate to figure out the most fitted result for structure of evaluation with attributes that there are weighted and ranked. Moreover, it is hard to catch hold of a specific character for assume the form of user's group. In this paper. we propose a dispersion mean algorithm for evaluation of similarity measure based on the geometrical figure. In addition, it is applied to mean classified by user's group. One of the key issues to be considered in evaluation of the similarity measure is how to achieve objectiveness that it is not change over an item ranking in evaluation process.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.451-455
• /
• 2008

In this paper, the k-nearest templates method is proposed to combine multiple classifiers effectively. First, the method decomposes training samples of each class into several subclasses based on the outputs of classifiers to represent a class as multiple models, and estimates a localized template by averaging the outputs for each subclass. The distances between a test sample and templates are then calculated. Lastly, the test sample is assigned to the class that is most frequently represented among the k most similar templates. In this paper, C-means clustering algorithm is used as the decomposition method, and k is automatically chosen according to the intra-class compactness and inter-class separation of a given data set. Since the proposed method uses multiple models per class and refers to k models rather than matches with the most similar one, it could obtain stable and high accuracy. In this paper, experiments on UCI and ELENA database showed that the proposed method performed better than conventional fusion methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.302-305
• /
• 2019

국민 청원 사이트가 뛰어난 접근성과 신속성으로 인하여 국민들로부터 많은 관심을 받고 있다. 현재 국민청원 사이트의 카테고리 분류는 '미래', '성장동력' 등을 포함한 16개의 카테고리 및 기타로 구성되어 있으나 그 기준이 모호하여 많은 청원글들이 기타 카테고리로 분류되고 있는 상황이다. 이는 청원글의 내용을 명확히 반영하지 않고 미리 정의된 카테고리 구조를 사용하고 있는데서 기인한다고 할 수 있다. 본 논문에서는 보다 구체적으로 정의된 카테고리를 정의하고자 추천 순으로 1,500개의 청원글을 수집하였고, 수집된 청원글의 내용을 바탕으로 카테고리 구조를 추출하였다. 먼저, k-평균 알고리즘을 적용하여 청원글을 군집하여 대분류를 정의하였고, 보다 구체적인 세부 분류를 정의하기 위하여 토픽모델링을 실시하였다. 본 논문에서 제시하는 계층적 카테고리 구조는 청원글의 내용을 바탕으로 대분류와 세부분류로 구성된 것이므로 새로운 청원글을 등록하거나 분류하는 데 적절한 것으로 보인다.