• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.2
• /
• pp.152-163
• /
• 2022

In this paper, we present a method to enable an unmanned aerial vehicle to drop the sonobuoy, an essential element of anti-submarine warfare, in an optimal deployment. To this end, an environment simulating the distribution of sound detection performance was configured through the Unity game engine, and the environment directly configured using Unity ML-Agents and the reinforcement learning algorithm written in Python from the outside communicated with each other and learned. In particular, reinforcement learning is introduced to prevent the accumulation of wrong actions and affect learning, and to secure the maximum detection area for the sonobuoy while the vehicle flies to the target point in the shortest time. The optimal placement of the sonobuoy was achieved by applying the Deep Deterministic Policy Gradient (DDPG) algorithm. As a result of the learning, the agent flew through the sea area and passed only the points to achieve the optimal placement among the 70 target candidates. This means that an autonomous aerial vehicle that deploys a sonobuoy in the shortest time and maximum detection area, which is the requirement for optimal placement, has been implemented.

• Information Systems Review
• /
• v.24 no.1
• /
• pp.39-57
• /
• 2022

This paper proposes the GMOPTBoost algorithm to improve the performance of the AdaBoost algorithm for bankruptcy prediction in which class imbalance problem is inherent. AdaBoost algorithm has the advantage of providing a robust learning opportunity for misclassified samples. However, there is a limitation in addressing class imbalance problem because the concept of arithmetic mean accuracy is embedded in AdaBoost algorithm. GMOPTBoost can optimize the geometric mean accuracy and effectively solve the category imbalance problem by applying Gaussian gradient descent. The samples are constructed according to the following two phases. First, five class imbalance datasets are constructed to verify the effect of the class imbalance problem on the performance of the prediction model and the performance improvement effect of GMOPTBoost. Second, class balanced data are constituted through data sampling techniques to verify the performance improvement effect of GMOPTBoost. The main results of 30 times of cross-validation analyzes are as follows. First, the class imbalance problem degrades the performance of ensembles. Second, GMOPTBoost contributes to performance improvements of AdaBoost ensembles trained on imbalanced datasets. Third, Data sampling techniques have a positive impact on performance improvement. Finally, GMOPTBoost contributes to significant performance improvement of AdaBoost ensembles trained on balanced datasets.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.3
• /
• pp.2192-2200
• /
• 2015

In this paper, we propose an efficient vehicle image compensation algorithm based on Histogram Equalization. The proposed a vehicle image compensation algorithm was elimination to the vehicle image shake using motion compensation and motion estimation. And, algorithm was calculated the histogram of pixel values from each sub-image by dividing the image as the constant size areas in order to image enhancement. Also, it had enhancement to the image by adjusting the gradient. The proposed algorithm was evaluate the difference between of performance and time, image by applied to the IP, and were confirmed the image enhancement with removing of vehicle camera image shake. In this paper, the proposed vehicle image enhancement algorithm was demonstrated effectiveness when compared to existing vehicle image stabilization, because the elimination of shake for the vehicle images used real-time processing without using a memory. And it was obtained the reduction effect of the computation time by the calculated through block matching, and obtained the better restoration result for naturalness of the image with the lowest noise.

• Spatial Information Research
• /
• v.21 no.5
• /
• pp.63-72
• /
• 2013

This paper analyzed the flood propagation characteristics of each flood elevation due to failure of embankment in Muju Namdae Stream using recursive call algorithm. A flood propagation order by the flood elevation was estimated by setting destruction point at Beonggu and Chasan small dam through recursive call algorithm and then, the number of grids of each flood propagation order and accumulated inundation area were calculated. Based on the flood propagation order and the grid size of DEM, flood propagation time could be predicted each flood elevation. As a result, the study could identify the process of flood propagation through distribution characteristic of the flood propagation order obtained from recursive call algorithm, and could provide basic data for protection from flood disaster by selecting the flood vulnerable area through the gradient pattern of the graph for accumulated inundation area each flood propagation order. In addition, the prediction of the flood propagation time for each flood water level using this algorithm helped provide valuable information to calculate the evacuation path and time during the flood season by predicting the flood propagation time of each flood water level.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.4 s.304
• /
• pp.21-30
• /
• 2005

In this paper, we propose lane detection and trackinB algerian using B-Snake as robust algorithm. One of chief virtues of Lane detection algorithm using B-Snake is that it is possible to specify a wider range of lane structure because B-Spline conform an arbitrary shape by control point set and that it doesn't use any camera parameter. Using a robust algorithm called CHVEP, we find the vanishing point, width of lane and mid-line of lane because of the perspective parallel line and then we can detect the both side of lane mark using B-snake. To demonstrate that this algorithm is robust against noise, shadow and illumination variations in road image, we tested this algorithm about various image divided by weather-fine, rainy and cloudy day. The percentage of correct lane detection is over 95$\%$.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.46-52
• /
• 2023

With billions of IoT (Internet of Things) devices populating various emerging applications across the world, detecting anomalies on these devices has become incredibly important. Advanced Intrusion Detection Systems (IDS) are trained to detect abnormal network traffic, and Machine Learning (ML) algorithms are used to create detection models. In this paper, the NSL-KDD dataset was adopted to comparatively study the performance and efficiency of IoT anomaly detection models. The dataset was developed for various research purposes and is especially useful for anomaly detection. This data was used with typical machine learning algorithms including eXtreme Gradient Boosting (XGBoost), Support Vector Machines (SVM), and Deep Convolutional Neural Networks (DCNN) to identify and classify any anomalies present within the IoT applications. Our research results show that the XGBoost algorithm outperformed both the SVM and DCNN algorithms achieving the highest accuracy. In our research, each algorithm was assessed based on accuracy, precision, recall, and F1 score. Furthermore, we obtained interesting results on the execution time taken for each algorithm when running the anomaly detection. Precisely, the XGBoost algorithm was 425.53% faster when compared to the SVM algorithm and 2,075.49% faster than the DCNN algorithm. According to our experimental testing, XGBoost is the most accurate and efficient method.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.1E
• /
• pp.56-64
• /
• 1995

The least mean fourth (LMF) adaptive algorithm is a stochastic gradient method that minimizes the error in the mean fourth sense. Despite its potential advantages, the algorithm is much less popular than the conventional least mean square (LMS) algorithm in practice. This seems partly because the analysis of the LMF algorithm is much more difficult than that of the LMS algorithm, and thus not much still has been known about the algorithm. In this paper, we explore the statistical convergence behavior of the LMF algorithm when the input to the adaptive filter is zero-mean, wide-sense stationary, and Gaussian. Under a system idenrification mode, a set of nonlinear evolution equations that characterizes the mean and mean-squared behavior of the algorithm is derived. A condition for the conbergence is then found, and it turns out that the conbergence of the LMF algorithm strongly depends on the choice of initial conditions. Performances of the LMF algorithm are compared with those of the LMS algorithm. It is observed that the mean convergence of the LMF algorithm is much faster than that of the LMS algorithm when the two algorithms are designed to achieve the same steady-state mean-squared estimation error.

• Earthquakes and Structures
• /
• v.14 no.1
• /
• pp.1-10
• /
• 2018

Seismic retrofitting of existing buildings and design of earth-quake resistant buildings are important issues associated with earthquake-prone zones. Use of metallic-yielding dampers as an energy dissipation system is an acceptable method for controlling damages in structures and improving their seismic performance. In this study, the optimal distribution of dampers for reducing the seismic response of steel frames with multi-degrees freedom is presented utilizing the uniform distribution of deformations. This has been done in a way that, the final configuration of dampers in the frames lead to minimum weight while satisfying the performance criteria. It is shown that such a structure has an optimum seismic performance, in which the maximum structure capacity is used. Then the genetic algorithm which is an evolutionary optimization method is used for optimal arrangement of the steel dampers in the structure. In continuation for specifying the optimal accurate response, the local search algorithm based on the gradient concept has been selected. In this research the introduced optimization methods are used for optimal retrofitting in the moment-resisting frame with inelastic behavior and initial weakness in design. Ultimately the optimal configuration of dampers over the height of building specified and by comparing the results of the uniform deformation method with those of the genetic algorithm, the validity of the uniform deformation method in terms of accuracy, Time Speed Optimization and the simplicity of the theory have been proven.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.5
• /
• pp.409-419
• /
• 2013

Kinect released by Microsoft in November 2010 is a motion sensing camera in xbox360 and gives depth and color images. However, Kinect camera also generates holes and noise around object boundaries in the obtained images because it uses infrared pattern. Also, boundary flickering phenomenon occurs. Therefore, we propose a real-time virtual-view video synthesis algorithm which results in a high-quality virtual view by solving these problems. In the proposed algorithm, holes around the boundary are filled by using the joint bilateral filter. Color image is converted into intensity image and then flickering pixels are searched by analyzing the variation of intensity and depth images. Finally, boundary flickering phenomenon can be reduced by converting values of flickering pixels into the maximum pixel value of a previous depth image and virtual views are generated by applying 3D warping technique. Holes existing on regions that are not part of occlusion region are also filled with a center pixel value of the highest reliability block after the final block reliability is calculated by using a block based gradient searching algorithm with block reliability. The experimental results show that the proposed algorithm generated the virtual view image in real-time.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.8
• /
• pp.815-821
• /
• 2009

Information processing in variable and noisy environments is usually accomplished by means of adaptive filters. Among various adaptive algorithms, Least Mean Square (LMS) has become the most popular for its robustness, good tracking capabilities and simplicity, both in terms of computational load and easiness of implementation. In practical application of the LMS algorithm, the most important key parameter is the Step Size. As is well known, if the Step Size is large, the convergence rate of the algorithm will be rapid, but the steady state mean square error (MSE) will increase. On the other hand, if the Step Size is small, the steady state MSE will be small, but the convergence rate will be slow. Many researches have been proposed to alleviate this drawback by using a variable Step Size. In this paper, a new variable Step Size LMS(VSSLMS) called Categorized VSSLMS (CVSSLMS) is proposed. CVSSLMS updates the Step Size by categorizing the current status of the gradient, hence significantly improves the convergence rate. The performance of the proposed algorithm was verified from the view point of convergence rate, Excessive Mean Square Error(EMSE), and complexity through experiments.