• Knowledge Management Research
• /
• v.10 no.4
• /
• pp.17-30
• /
• 2009

This study is concerned with suggesting a new clustering algorithm to evaluate the value of papers which were supported by research grants by Korea Research Fund (KRF). The algorithm is based on an extended version of a conventional PSO (Particle Swarm Optimization) mechanism. In other words, the proposed algorithm is based on integration of k-means algorithm and simulated annealing mechanism, named KASA-PSO. To evaluate the robustness of KASA-PSO, its clustering results are evaluated by research grants experts working at KRF. Empirical results revealed that the proposed KASA-PSO clustering method shows improved results than conventional clustering method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.2
• /
• pp.24-31
• /
• 2011

This paper proposes spatio-temporal denoising algorithm based on nonlocal means. Though the conventional denoising algorithms based on nonlocal means have good performance in noise removal, it is difficult to implement them into the hardware system due to much computational load and the need for several frame buffers. Therefore we adopted infinite impulse response temporal noise reduction algorithm in the proposed algorithm. Proposed algorithm shows less artificial denoised result in the motionless region. In the motion region, spatial filter based on efficiently improved nonlocal means algorithm conduct noise removal with less motion blur. Experimental results including comparisons with conventional algorithms for various noise levels and test images show the proposed algorithm has a good performance in both visual and quantitative criteria.

• The Journal of Bigdata
• /
• v.1 no.1
• /
• pp.19-22
• /
• 2016

Many Studies have been actively conducted on the early diagnosis of the crop pest utilizing IT technology. The purpose of the paper is to discuss on the image processing method capable of detecting the crop leaf pest prematurely by analyzing the image of the leaf received from the camera sensor. This paper proposes an algorithm of diagnosing leaf infection by utilizing an improved K means clustering method. Leaf infection grouping test showed that the proposed algorithm illustrated a better performance in the qualitative evaluation.

• Journal of Digital Convergence
• /
• v.13 no.2
• /
• pp.135-140
• /
• 2015

General CHMM vocabulary recognition system is model observation probability for vocabulary recognition of recognition rate's low. Used as the limiting unit is applied only to some problem in the phoneme model. Also, they have a problem that does not conform to the needs of the search range to meaning of the words in the vocabulary. Performs a phoneme recognition using GMM to improve these problems. We solve the problem according to the limited search words characterized by an improved k-means algorithm. Measure the effectiveness represented by the accuracy and reproducibility as compared to conventional system performance experiments. Performance test results accuracy is 83%p, and recall is 67%p.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.576-582
• /
• 2011

In this paper, we proposed the improved Advanced Detail Enhancement algorithm that improve the blurring by the lossy compression with CODEC and reduce the ringing artifacts in restoration. The conventional algorithm needs much amount of the process by the use of RGB color space. To improve this, we only used the luminance value in YCbCr color space. We verified that the performance of the improved algorithm with Y color value, the luminance value, is equal to the conventional algorithm with RGB color value and that the operation time of the improved is shorter about 24% than the conventional through the measurement of the operation time with Kodak standard images.

• Journal of Korea Society of Industrial Information Systems
• /
• v.25 no.6
• /
• pp.159-169
• /
• 2020

A cold chain logistics (CCL) model for chilled food (-1℃ to 8℃) distributed in China was developed in this study. The CCL model consists of a distribution center (DC) and distribution target points (DT). The objective function of the CCL model is to minimize the total distribution routes of all distributors. To find the optimal result of the objective function, the hybrid genetic algorithm (HGA) approach is proposed. The HGA approach was constructed by combining the improved K-means and genetic algorithm (GA) approaches. In the case study, three scenarios were considered for the CCL model based on the distribution routes and the available distance, and they were solved using the proposed HGA approach. Analysis results showed that the distribution costs and mileage were reduced by approximately 19%, 20% and 16% when the proposed HGA approach was used.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.224-230
• /
• 2013

Lane boundary detection plays a key role in the driver assistance system. This study proposes a robust method for detecting lane boundary in severe environment. First, a horizontal line detects form the original image using improved Vertical Mean Distribution Method (iVMD) and the sub-region image which is under the horizontal line, is determined. Second, we extract the lane marking from the sub-region image using Canny edge detector. Finally, K-means clustering algorithm classifi left and right lane cluster under variant illumination, cracked road, complex lane marking and passing traffic. Experimental results show that the proposed method satisfie the real-time and efficient requirement of the intelligent transportation system.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.6
• /
• pp.315-320
• /
• 2017

Estimating the correct pose of augmented objects on the real camera view efficiently is one of the most important questions in image tracking area. In computer vision, Homography is used for camera pose estimation in augmented reality system with markerless. To estimating Homography, several algorithm like SURF features which extracted from images are used. Based on extracted features, Homography is estimated. For this purpose, RANSAC algorithm is well used to estimate homography and DCS-RANSAC algorithm is researched which apply constraints dynamically based on Constraint Satisfaction Problem to improve performance. In DCS-RANSAC, however, the dataset is based on pattern of feature distribution of images manually, so this algorithm cannot classify the input image, pattern of feature distribution is not recognized in DCS-RANSAC algorithm, which lead to reduce it's performance. To improve this problem, we suggest the KCS-RANSAC algorithm using K-means clustering in CS-RANSAC to cluster the images automatically based on pattern of feature distribution and apply constraints to each image groups. The suggested algorithm cluster the images automatically and apply the constraints to each clustered image groups. The experiment result shows that our KCS-RANSAC algorithm outperformed the DCS-RANSAC algorithm in terms of speed, accuracy, and inlier rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1773-1795
• /
• 2020

Unmanned aerial vehicles (UAVs) network are a very vibrant research area nowadays. They have many military and civil applications. Limited bandwidth, the high mobility and secure communication of micro UAVs represent their three main problems. In this paper, we try to address these problems by means of secure clustering, and a security clustering algorithm based on integrated trust value for UAVs network is proposed. First, an improved the k-means++ algorithm is presented to determine the optimal number of clusters by the network bandwidth parameter, which ensures the optimal use of network bandwidth. Second, we considered variables representing the link expiration time to improve node clustering, and used the integrated trust value to rapidly detect malicious nodes and establish a head list. Node clustering reduce impact of high mobility and head list enhance the security of clustering algorithm. Finally, combined the remaining energy ratio, relative mobility, and the relative degrees of the nodes to select the best cluster head. The results of a simulation showed that the proposed clustering algorithm incurred a smaller computational load and higher network security.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.5
• /
• pp.2375-2382
• /
• 2011

The user clustering for web navigation pattern discovery is very useful to get preference and behavior pattern of users for web pages. In addition, the information by the user clustering is very essential for web personalization or customer grouping. In this paper, an algorithm for clustering the web navigation path of users is proposed and then some special navigation patterns can be recognized by the algorithm. The proposed algorithm has two clustering phases. In the first phase, all paths are classified into k-groups on the bases of the their similarities. The initial solution obtained in the first phase is not global optimum but it gives a good and feasible initial solution for the second phase. In the second phase, the first phase solution is improved by revising the k-means algorithm. In the revised K-means algorithm, grouping the paths is performed by the hyperplane instead of the distance between a path and a group center. Experimental results show that the proposed method is more efficient.