• Journal of Industrial Convergence
• /
• v.20 no.12
• /
• pp.195-202
• /
• 2022

Underground Geospatial Information Map Management System(UGIMMS) integrates various underground facilities in the underground space into 3D mesh data, and supports to check the 3D image and location of the underground facilities in the mobile app. However, there is a problem that it takes a long time to run in the app because various underground facilities can exist in some areas executed by the app and can be seen layer by layer. In this paper, we propose a deep learning-based K-means vertex clustering algorithm as a method to reduce the execution time in the app by reducing the size of the data by reducing the number of vertices in the 3D mesh data within the range that does not cause a problem in visibility. First, our proposed method obtains refined vertex feature information through a deep learning encoder-decoder based model. And second, the method was simplified by grouping similar vertices through K-means vertex clustering using feature information. As a result of the experiment, when the vertices of various underground facilities were reduced by 30% with the proposed method, the 3D image model was slightly deformed, but there was no missing part, so there was no problem in checking it in the app.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.12
• /
• pp.43-48
• /
• 2018

In this paper, more efficient classification result could be obtained by applying the combination of the Hidden Markov Model and SVM Model to HMSV algorithm gene expression data which simulated the stochastic flow of gene data and clustering it. In this paper, we verified the HMSV algorithm that combines independently learned algorithms. To prove that this paper is superior to other papers, we tested the sensitivity and specificity of the most commonly used classification criteria. As a result, the K-means is 71% and the SOM is 68%. The proposed HMSV algorithm is 85%. These results are stable and high. It can be seen that this is better classified than using a general classification algorithm. The algorithm proposed in this paper is a stochastic modeling of the generation process of the characteristics included in the signal, and a good recognition rate can be obtained with a small amount of calculation, so it will be useful to study the relationship with diseases by showing fast and effective performance improvement with an algorithm that clusters nodes by simulating the stochastic flow of Gene Data through data mining of BigData.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.16 no.6
• /
• pp.39-47
• /
• 2008

In this research, a web-based design support system is constructed for the design process of automotive steel pulley to gather engineering knowledge from pulley design data. In the design search module, a clustering tool for design data is proposed using K-means clustering algorithm. To obtain correlational patterns between design and FEA (Finite Element Analysis) data, a Multi-layer Back Propagation Network (MBPN) is applied. With the analyzed patterns from a number of simulation data, an estimation of minimum von mises can be provided for given design parameters of pulleys. The case study revealed fast estimation of minimum stress in the pulley within 12% error.

• Journal of Biomedical Engineering Research
• /
• v.12 no.2
• /
• pp.99-106
• /
• 1991

For the automatic detection of pulmonary blood vessels, a new algorithm is proposed using the fact that human recognizes a pattern orderly according to their size. This method simulates the human recognition process by the pyramid images. For the detection of vessels using multilevel image, large and wtde ones are detected from the most compressed level, followed by the detection of small and narrow ones from the less compressed images with FCM(fuzzy c means) clustering algorithm which classifies similar data into a group. As the proposed algorithm detects blood vessels orderly according to their size, there is no need to consider the variation of parameters and the branch points which should be considered in other detection algirithms. In the detection of patterns whose size changes successively like pulmonary blood vessels, this proposed algorithm can be properly applied

• KIISE Transactions on Computing Practices
• /
• v.23 no.8
• /
• pp.481-486
• /
• 2017

There are many scientists who want to perform experiments in a cloud environment, and pay-per-use services allow scientists to pay only for cloud services that they need. However, it is difficult for scientists to select a suitable set of resources since those resources are comprised of various characteristics. Therefore, classification is needed to support the effective utilization of cloud resources. Thus, a dynamic resource clustering method is needed to reflect the characteristics of the application that scientists want to execute. This paper proposes a resource clustering analysis method that takes into account the characteristics of an application in a hybrid cloud environment. The resource clustering analysis applies a Self-Organizing Map and K-means algorithm to dynamically cluster similar resources. The results of the experiment indicate that the proposed method can classify a similar resource cluster by reflecting the application characteristics.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.1-13
• /
• 2002

In this paper, we propose an object tracking system which can be convinced of moving area shaped on objects through color sequential images, decided moving directions of foot messengers or vehicles of image sequences. In static camera, we suggests a new evaluating method extracting co-occurrence matrix with feature vectors of RGB after analyzing and blocking difference images, which is accessed to field of camera view for motion. They are energy, entropy, contrast, maximum probability, inverse difference moment, and correlation of RGB color vectors. we describe how to analyze and compute corresponding relations of objects between adjacent frames. In the clustering, we apply an algorithm of FCM(fuzzy c means) to analyze matching and clustering problems of adjacent frames of the featured vectors, energy and entropy, gotten from previous phase. In the matching phase, we also propose a method to know correspondence relation that can track motion each objects by clustering with similar area, compute object centers and cluster around them in case of same objects based on membership function of motion area of adjacent frames.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.6
• /
• pp.1215-1225
• /
• 2021

Although Artificial Intelligence (AI) techniques have shown impressive performance in various fields, they are vulnerable to adversarial examples which induce misclassification by adding human-imperceptible perturbations to the input. Previous studies to defend the adversarial examples can be classified into three categories: (1) model retraining methods; (2) input transformation methods; and (3) adversarial examples detection methods. However, even though the defense methods against adversarial examples have constantly been proposed, there is no research to classify the type of adversarial attack. In this paper, we proposed an adversarial attack family classification method based on dimensionality reduction and clustering. Specifically, after extracting adversarial perturbation from adversarial example, we performed Linear Discriminant Analysis (LDA) to reduce the dimensionality of adversarial perturbation and performed K-means algorithm to classify the type of adversarial attack family. From the experimental results using MNIST dataset and CIFAR-10 dataset, we show that the proposed method can efficiently classify five tyeps of adversarial attack(FGSM, BIM, PGD, DeepFool, C&W). We also show that the proposed method provides good classification performance even in a situation where the legitimate input to the adversarial example is unknown.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.861-866
• /
• 2007

A clustering algorithm for Gaussian Probability Distribution Function (GPDF) data called Centroid Neural Network with a Bhattacharyya Kernel (BK-CNN) is proposed in this paper. The proposed BK-CNN is based on the unsupervised competitive Centroid Neural Network (CNN) and employs a kernel method for data projection. The kernel method adopted in the proposed BK-CNN is used to project data from the low dimensional input feature space into higher dimensional feature space so as the nonlinear problems associated with input space can be solved linearly in the feature space. In order to cluster the GPDF data, the Bhattacharyya kernel is used to measure the distance between two probability distributions for data projection. With the incorporation of the kernel method, the proposed BK-CNN is capable of dealing with nonlinear separation boundaries and can successfully allocate more code vector in the region that GPDF data are densely distributed. When applied to GPDF data in an image classification probleml, the experiment results show that the proposed BK-CNN algorithm gives 1.7%-4.3% improvements in average classification accuracy over other conventional algorithm such as k-means, Self-Organizing Map (SOM) and CNN algorithms with a Bhattacharyya distance, classed as Bk-Means, B-SOM, B-CNN algorithms.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.225-231
• /
• 2013

In this study, we propose the design of optimized pRBFNNs-based night vision face recognition system using PCA algorithm. It is difficalt to obtain images using CCD camera due to low brightness under surround condition without lighting. The quality of the images distorted by low illuminance is improved by using night vision camera and histogram equalization. Ada-Boost algorithm also is used for the detection of face image between face and non-face image area. The dimension of the obtained image data is reduced to low dimension using PCA method. Also we introduce the pRBFNNs as recognition module. The proposed pRBFNNs consists of three functional modules such as the condition part, the conclusion part, and the inference part. In the condition part of fuzzy rules, input space is partitioned by using Fuzzy C-Means clustering. In the conclusion part of rules, the connection weights of pRBFNNs is represented as three kinds of polynomials such as linear, quadratic, and modified quadratic. The essential design parameters of the networks are optimized by means of Differential Evolution.

• Journal of IKEEE
• /
• v.23 no.3
• /
• pp.910-916
• /
• 2019

Non-local similarity of natural images is one of highly exploited features in various applications dealing with images. Unique edges, texture, and pattern of the images are frequently repeated over the entire image. Once the similar image blocks are classified into a cluster, representative features of the image blocks can be extracted from the cluster. The bigger the size of the cluster is the better the additive white noise can be separated. Denoising is one of major research topics in the image processing field suppressing the additive noise. In this paper, a denoising algorithm is proposed which first clusters the noisy image blocks based on similarity, extracts the feature of the cluster, and finally recovers the original image. Performance experiments with several images under various noise strengths show that the proposed algorithm recovers the details of the image such as edges, texture, and patterns while outperforming the previous methods in terms of PSNR in removing the additive Gaussian noise.