• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.687-693
• /
• 2012

In this paper, we propose a optimal deployment method for cooperative exploration of swarm robots. The proposed method consists of two parts such as optimal deployment and path planning. The optimal area deployment is proposed by the K-mean Algorithm and Voronoi tessellation. The path planning is proposed by the potential field method and A* Algorithm. Finally, the numerical experiments demonstrate the effectiveness and feasibility of the proposed method.

• The Journal of the Acoustical Society of Korea
• /
• v.35 no.4
• /
• pp.280-287
• /
• 2016

In this paper, we propose a normalization algorithm that can be applied to adaptive filters for multi-channel active noise control. The FxLMS (Filtered-x Least Mean Square) algorithm for the single-channel active noise control can be normalized in the same way as the NLMS (Normalized Least Mean Square) algorithm, whereas in case of the multi-channel active noise control, the single-channel normalization for the FxLMS algorithm cannot be extended to the normalization for the multi-channel FxLMS algorithm straightforwardly. First, we adopt a generalized normalization algorithm for the multi-channel FxLMS algorithm based on the principle of minimal disturbance and then, proposed a normalized algorithm considering only diagonal elements to avoid computation for matrix inversion. We carried out performance comparisons of the proposed algorithm with other algorithms without normalization. It is shown that the proposed algorithm presents better convergence characteristics under non-stationary environments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.579-582
• /
• 2015

The Mean-Shift is a robustness algorithm that can be used for tracking the object using the similarity of histogram distributions of target model and target candidate. However, Mean-shift using hue information has disadvantage of tracking a wrong target when the target and background has similar hue distributions. We then propose a robust Mean-Shift tracking algorithm using new image that combined upper 4bit-planes in hue and saturation, respectively.

• Transactions on Electrical and Electronic Materials
• /
• v.14 no.4
• /
• pp.187-192
• /
• 2013

Because of the importance of small target detection in infrared images, many studies have been carried out in this area. Using a Kalman filter and mean shift algorithm, this study proposes an algorithm to track multiple small moving targets even in cases of target disappearance and appearance in serial infrared images in an environment with many noises. Difference images, which highlight the background images estimated with a background estimation filter from the original images, have a relatively very bright value, which becomes a candidate target area. Multiple target tracking consists of a Kalman filter section (target position prediction) and candidate target classification section (target selection). The system removes error detection from the detection results of candidate targets in still images and associates targets in serial images. The final target detection locations were revised with the mean shift algorithm to have comparatively low tracking location errors and allow for continuous tracking with standard model updating. In the experiment with actual marine infrared serial images, the proposed system was compared with the Kalman filter method and mean shift algorithm. As a result, the proposed system recorded the lowest tracking location errors and ensured stable tracking with no tracking location diffusion.

• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.275-280
• /
• 2021

With the development of communication networks, the processes of exchanging and transmitting information rapidly developed. As millions of images are sent via social media every day, also wireless sensor networks are now used in all applications to capture images such as those used in traffic lights, roads and malls. Therefore, there is a need to reduce the size of these images while maintaining an acceptable degree of quality. In this paper, we use Python software to apply K-mean Clustering algorithm to compress RGB images. The PSNR, MSE, and SSIM are utilized to measure the image quality after image compression. The results of compression reduced the image size to nearly half the size of the original images using k = 64. In the SSIM measure, the higher the K, the greater the similarity between the two images which is a good indicator to a significant reduction in image size. Our proposed compression technique powered by the K-Mean clustering algorithm is useful for compressing images and reducing the size of images.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.915-918
• /
• 2001

In this paper we study a new convergence behavior of the least mean fourth (LMF) algorithm where the error raised to the power of four is minimized for a multiple sinusoidal input and Gaussian measurement noise. Here we newly obtain the convergence equation for the sum of the mean of the squared weight errors, which indicates that the transient behavior can differ depending on the relative sizes of the Gaussian noise and the convergence constant. It should be noted that no similar results can be expected from the previous analysis by Walach and Widrow.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.155-158
• /
• 2010

In this article, we proposed a new interference canceller using the adaptive algorithm. We designed constant modulus algorithm-correlation normailized least mean square (CMA-CNLMS) for wireless system. This structure is normalized LMS algorithm using correlation between the desired and input signal for cancelling the interference signals in the wideband code division multiple access (WCDMA) system. We showed that the proposed algorithm could improve the Mean Square Error (MSE) performance of LMS algorithm. MATLAB (Matrix Laboratory) is employed to analyze the proposed algorithm and to compare it with the experimental results. The MSE value of the LMS with mu=0.0001 was measured as - 12.5 dB, and that of the proposed algorithm was -19.5 dB which showed an improvement of 7dB.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.1
• /
• pp.33-41
• /
• 2011

This paper considers a topological optimization of a network design with mean packet delay and node connectivity constraints. The objective is to find the topological layout of links, at minimal cost. This Problem is known to be NP-hard. To efficiently solve the problem, a scatter search algorithm is proposed. An illustrative example is used to explain and test the proposal approach. Experimental results show evidence that the proposal approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic approach.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.1
• /
• pp.46-51
• /
• 2007

In this paper, we propose a new data clustering method using local probability and hypothesis theory. To cluster the test data set we analyze the local area of the test data set using local probability distribution and decide the candidate class of the data set using mean standard deviation and variance etc. To decide each class of the test data, statistical hypothesis theory is applied to the decided candidate class of the test data set. For evaluating, the proposed classification method is compared to the conventional fuzzy c-mean method, k-means algorithm and Discriminator analysis algorithm. The simulation results show more accuracy than results of fuzzy c-mean method, k-means algorithm and Discriminator analysis algorithm.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.777-786
• /
• 2008

Human face avatar is important information in nowadays, such as describing real people in virtual world. In this paper, we have presented a face avatar creation and warping algorithm by using face feature analysis method, in order to detect face feature, we utilized local mean method based on facial feature appearance and face geometric information. Then detect facial candidates by using it's character in $YC_bC_r$ color space. Meanwhile, we also defined the rules which are based on face geometric information to limit searching range. For analyzing face feature, we used face feature points to describe their feature, and analyzed geometry relationship of these feature points to create the face avatar. Then we have carried out simulation on PC and embed mobile device such as PDA and mobile phone to evaluate efficiency of the proposed algorithm. From the simulation results, we can confirm that our proposed algorithm will have an outstanding performance and it's execution speed can also be acceptable.