• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.379-382
• /
• 1996

Evolution Strategy is used as an effective search algorithm in optimization problems and Sliding Mode Control is well known as a robust control algorithm. In this paper, we propose a Sliding Mode Control Method for robot manipulator using Evolution Strategy. Evolution Strategy is used to estimate Sliding Mode Control Parameters such as sliding surface gradient, continuous function boundary layer, unknown plant parameters and switching gain. Experimental results show the proposed control scheme has accurate and robust performances with effective search ability.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.7
• /
• pp.673-679
• /
• 2012

This paper introduces robust tracking algorithm for fast and erratic moving object. CAMSHIFT algorithm has less computation and efficient performance for object tracking. However, the method fails to track a object if it moves out of search window by fast velocity and/or large movement. The size of the search window in CAMSHIFT algorithm should be selected manually also. To solve these problems, we propose an efficient prediction technique for fast movement of object using Kalman Filter with automatic initial setting and variable configuration technique for search window. The proposed method is compared to the traditional CAMSHIFT algorithm for searching and tracking performance of objects on test image frames.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.271-287
• /
• 2019

The synchronization scheme based on moving average is robust and suitable for the same rule to be adopted in embedding watermark and synchronization code, but the imperceptibility and search efficiency is seldom reported. The study aims to improve the original scheme for robust audio watermarking. Firstly, the survival of the algorithm from desynchronization attacks is improved. Secondly, the scheme is improved in inaudibility. Objective difference grade (ODG) of the marked audio is significantly changed. Thirdly, the imperceptibility of the scheme is analyzed and the derived result is close to experimental result. Fourthly, the selection of parameters is optimized based on experimental data. Fifthly, the search efficiency of the scheme is compared with those of other synchronization code schemes. The experimental results show that the proposed watermarking scheme allows the high audio quality and is robust to common attacks such as additive white Gaussian noise, requantization, resampling, low-pass filtering, random cropping, MP3 compression, jitter attack, and time scale modification. Moreover, the algorithm has the high search efficiency and low false alarm rate.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.430-435
• /
• 2014

The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.486-489
• /
• 2002

This paper proposes a tabu search (TS) algorithm to optimal weight selection in design of robust H$_{\infty}$ power system stabilize. (PSS), In H$_{\infty}$ control design, the weight selection and the representation of system uncertainties are the major difficulties. To cope with these problems, TS is employed to automatically search for the optimal weights. On the other hand, the normalized coprime factorization (NCF) is used. The H$_{\infty}$ controller can be directly developed without ${\gamma}$-iteration. Also, the pole-zero cancellation phenomena are prevented. The performance and robustness of the proposed PSS under different loading conditions are investigated in comparison with a robust tuned PSS by examining the case of a single machine infinite bus (SMIB) system. The simulation results illustrate the effectiveness and robustness of the proposed PSS.

• Structural Engineering and Mechanics
• /
• v.65 no.4
• /
• pp.415-422
• /
• 2018

The Conjugate Finite-Step Length" (CFSL) algorithm is proposed to improve the efficiency and robustness of first order reliability method (FORM) for reliability analysis of highly nonlinear problems. The conjugate FORM-based CFSL is formulated using the adaptive conjugate search direction based on the finite-step size with simple adjusting condition, gradient vector of performance function and previous iterative results including the conjugate gradient vector and converged point. The efficiency and robustness of the CFSL algorithm are compared through several nonlinear mathematical and structural/mechanical examples with the HL-RF and "Finite-Step-Length" (FSL) algorithms. Numerical results illustrated that the CFSL algorithm performs better than the HL-RF for both robust and efficient results while the CFLS is as robust as the FSL for structural reliability analysis but is more efficient.

• Journal of Broadcast Engineering
• /
• v.12 no.5
• /
• pp.503-515
• /
• 2007

A new fast motion estimation algorithm is presented in this paper. The algorithm, named Enhanced Cross-Diamond Search (ECDS), is based on the Diamond Search (DS) algorithm. The DS algorithm, even though faster than the most well-known algorithms, was found not to be very robust in terms of objective and subjective qualities for several sequences and the algorithm searches unnecessary candidate blocks. We propose a novel ECDS algorithm using a small cross search as the initial step, and large/small DS patterns as subsequent steps for fast block motion estimation. Experimental results show that the ECDS is much more robust, provides a faster searching speed, and smaller distortions than other popular fast block-matching algorithms.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.65-74
• /
• 2021

Digital image processing and retrieving have increasingly become very popular on the Internet and getting more attention from various multimedia fields. That results in additional privacy requirements placed on efficient image matching techniques in various applications. Hence, several searching methods have been developed when confidential images are used in image matching between pairs of security agencies, most of these search methods either limited by its cost or precision. This study proposes a secure and efficient method that preserves image privacy and confidentially between two communicating parties. To retrieve an image, feature vector is extracted from the given query image, and then the similarities with the stored database images features vector are calculated to retrieve the matched images based on an indexing scheme and matching strategy. We used a secure content-based image retrieval features detector algorithm called Speeded-Up Robust Features (SURF) algorithm over public cloud to extract the features and the Honey Encryption algorithm. The purpose of using the encrypted images database is to provide an accurate searching through encrypted documents without needing decryption. Progress in this area helps protect the privacy of sensitive data stored on the cloud. The experimental results (conducted on a well-known image-set) show that the performance of the proposed methodology achieved a noticeable enhancement level in terms of precision, recall, F-Measure, and execution time.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2262-2267
• /
• 2018

In electric machine design, there is a large computation cost for finite element analyses (FEA) when analyzing nonlinear characteristics in the machine Therefore, for the optimal design of an electric machine, designers commonly use an optimization algorithm capable of excellent convergence performance. However, robustness consideration, as this factor can guarantee machine performances capabilities within design uncertainties such as the manufacturing tolerance or external perturbations, is essential during the machine design process. Moreover, additional FEA is required to search robust optimum. To address this issue, this paper proposes a computationally efficient robust optimization algorithm. To reduce the computational burden of the FEA, the proposed algorithm employs a useful technique which termed static analysis assisted technique (SAAT). The proposed method is verified via the effective robust optimal design of electric machine to reduce cogging torque at a reasonable computational cost.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.5
• /
• pp.798-806
• /
• 2003

Structural optimization has been carried out in continuous or discrete design space. Methods for continuous design have been well developed though they are finding the local optima. On the contrary, the existing methods for discrete design are extremely expensive in computational cost or not robust. In this research, an algorithm using tabu search is developed fur the discrete structural designs. The tabu list and the neighbor function of the Tabu concepts are introduced to the algorithm. It defines the number of steps, the maximum number for random searches and the stop criteria. A tabu search is known as the heuristic approach while genetic algorithm and simulated annealing algorithm are attributed to the stochastic approach. It is shown that an algorithm using the tabu search with random moves has an advantage of discrete design. Furthermore, the suggested method finds the reliable optimum for the discrete design problems. The existing tabu search methods are reviewed. Subsequently, the suggested method is explained. The mathematical problems and structural design problems are investigated to show the validity of the proposed method. The results of the structural designs are compared with those from a genetic algorithm and an orthogonal array design.