• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.727-728
• /
• 2006

In this paper, we analyzed the color restoration method to be used in the Multi-Scale Retinex and proposed new color restoration method. and, we compared the result of the algorithm to be proposed with conventional algorithm through the experiment.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2702-2704
• /
• 2001

In this Letter, we propose a comprehensive design methodology of hybri'd Fuzzy controllers (HFC). The HFC comes as a form of a convex combination of a standard PID controller and a fuzzy controller. The design procedure dwells on the use of evolutionary computing (genetic algorithm) and an auto-tuning algorithm. The tuning of the scaling factors of the HFC is an essential component of the entire optimization process. A numerical study is presented and a detailed comparative analysis is also included.

• Communications for Statistical Applications and Methods
• /
• v.6 no.3
• /
• pp.843-848
• /
• 1999

Support vector machine(SVM) is a new and very promising classification and regression technique developed by Bapnik and his group at AT&T Bell laboratories. However it has failed to establish itself as common machine learning tool. This is partly due to the fact that SVM is not easy to implement and its standard implementation requires the optimization package for quadratic programming. In this paper we present simple iterative Kernl Adatron algorithm for nonparametric regression which is easy to implement and guaranteed to converge to the optimal solution and compare it with neural networks and projection pursuit regression.

• Journal of the Korean Society for Precision Engineering
• /
• v.29 no.12
• /
• pp.1304-1312
• /
• 2012

According to the successful development of hybrid vehicle, hybridization of construction equipments like excavator, wheel loader, and backhoe etc., is gaining increasing attention. However, hybridization of excavator and commercial vehicle is very different. Therefore a specialized energy management control algorithm for excavator should be developed. In this paper, hybridization of excavators is investigated and a new energy management control algorithm is proposed. Four control parameters, i.e., lower baseline, upper baseline, idling generation speed, and idling generation torque, are newly introduced and a new operating principle using those four control parameters is proposed. The use of Genetic Algorithm for the optimization of the four control parameters from the view point of minimization of fuel consumption for standard excavating operation is suggested. In order to verify the proposed algorithm, dedicated simulation program of hybrid excavator was developed. The proposed algorithm is applied to a specific hydraulic excavator and 20.7% improvement of fuel consumption is achieved.

• Journal of Korea Multimedia Society
• /
• v.19 no.11
• /
• pp.1852-1861
• /
• 2016

Drowsy driving is a significant factor in traffic accidents, so driver drowsiness detection system based on computer vision for convenience and safety has been actively studied. However, it is difficult to accurately detect the driver drowsiness in complex background and environmental change. In this paper, it proposed the driver drowsiness detection algorithm to determine whether the driver is drowsy through the measurement standard of a yawn, eyes drowsy status, and nod based on facial features. The proposed algorithm detect the driver drowsiness in the complex background, and it is robust to changes in the environment. The algorithm can be applied in real time because of the processing speed faster. Throughout the experiment, we confirmed that the algorithm reliably detected driver drowsiness. The processing speed of the proposed algorithm is about 0.084ms. Also, the proposed algorithm can achieve an average detection rate of 98.48% and 97.37% for a yawn, drowsy eyes, and nod in the daytime and nighttime.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.281-285
• /
• 2011

One of the key issues in implementing RFID systems is to design anti-collision protocols for identifying all the tags in the interrogation zone of a RFID reader with the minimum identification delay. In this paper, Furthermore, in designing such protocols, the limited resources in tags and readers in terms of memory and computing capability should be fully taken into consideration. we first investigate two typical RFID anti-collision algorithms, namely RFID Gen2 Q algorithm (accepted as the worldwide standard in industrial domain) and FAFQ algorithm including their drawbacks and propose a new RFID anti-collision algorithm, which can improve the performance of RFID systems in terms of tag identification time considerably. Further, we compared performance of the proposed algorithm with Q algorithm and FAFQ algorithm through computer simulation.

• Journal of information and communication convergence engineering
• /
• v.13 no.2
• /
• pp.123-131
• /
• 2015

Training neural networks is a complex task with great importance in the field of supervised learning. In the training process, a set of input-output patterns is repeated to an artificial neural network (ANN). From those patterns weights of all the interconnections between neurons are adjusted until the specified input yields the desired output. In this paper, a new hybrid algorithm is proposed for global optimization of connection weights in an ANN. Dynamic swarms are shown to converge rapidly during the initial stages of a global search, but around the global optimum, the search process becomes very slow. In contrast, the gradient descent method can achieve faster convergence speed around the global optimum, and at the same time, the convergence accuracy can be relatively high. Therefore, the proposed hybrid algorithm combines the dynamic particle swarm optimization (DPSO) algorithm with the backpropagation (BP) algorithm, also referred to as the DPSO-BP algorithm, to train the weights of an ANN. In this paper, we intend to show the superiority (time performance and quality of solution) of the proposed hybrid algorithm (DPSO-BP) over other more standard algorithms in neural network training. The algorithms are compared using two different datasets, and the results are simulated.

• Journal of the Architectural Institute of Korea Structure & Construction
• /
• v.33 no.12
• /
• pp.53-62
• /
• 2017

Many gradient-based mathematical methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. The main objective of this paper is to propose an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) meta-heuristic algorithm that is derived using penalty function. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this paper, a discrete search strategy using the HS algorithm with a static penalty function is presented in detail and its applicability using several standard truss examples is discussed. The numerical results reveal that the HS algorithm with the static penalty function proposed in this study is a powerful search and design optimization technique for structures with discrete-sized members.

• International Journal of Computer Science & Network Security
• /
• v.23 no.2
• /
• pp.55-64
• /
• 2023

The travelling salesman problem (TSP) is an important combinatorial optimization problem that is used in several engineering science branches and has drawn interest to several researchers and scientists. In this problem, a salesman from an arbitrary node, called the warehouse, starts moving and returns to the warehouse after visiting n clients, given that each client is visited only once. The objective in this problem is to find the route with the least cost to the salesman. In this study, a meta-based ant colony system algorithm (ACSA) is suggested to find solution to the TSP that does not use local pheromone update. This algorithm uses the global pheromone update and new heuristic information. Further, pheromone evaporation coefficients are used in search space of the problem as diversification. This modification allows the algorithm to escape local optimization points as much as possible. In addition, 3-opt local search is used as an intensification mechanism for more quality. The effectiveness of the suggested algorithm is assessed on a several standard problem instances. The results show the power of the suggested algorithm which could find quality solutions with a small gap, between obtained solution and optimal solution, of 1%. Additionally, the results in contrast with other algorithms show the appropriate quality of competitiveness of our proposed ACSA.

• Journal of Information Processing Systems
• /
• v.19 no.4
• /
• pp.527-539
• /
• 2023

In the positioning algorithm of two-dimensional planar sensor array, the estimation error of time difference-ofarrival (TDOA) algorithm is difficult to avoid. Thus, how to achieve accurate positioning is a key problem of the positioning technology based on planar array. In this paper, a method of sensor reliability discrimination is proposed, which is the foundation for selecting positioning sensors with small error and excellent performance, simplifying algorithm, and improving positioning accuracy. Then, a positioning model is established. The estimation characteristics of the least square method are fully utilized to calculate and fuse the positioning results, and the non-uniform weighting method is used to correct the weighting factors. It effectively handles the decreased positioning accuracy due to measurement errors, and ensures that the algorithm performance is improved significantly. Finally, the characteristics of the improved algorithm are compared with those of other algorithms. The experiment data demonstrate that the algorithm is better than the standard least square method and can improve the positioning accuracy effectively, which is suitable for vibration detection with large noise interference.