• Title/Summary/Keyword: Robust algorithm

Search Result 2,732, Processing Time 0.026 seconds

A Robust Principal Component Neural Network

  • Changha Hwang;Park, Hyejung;A, Eunyoung-N
    • Communications for Statistical Applications and Methods
    • /
    • v.8 no.3
    • /
    • pp.625-632
    • /
    • 2001
  • Principal component analysis(PCA) is a multivariate technique falling under the general title of factor analysis. The purpose of PCA is to Identify the dependence structure behind a multivariate stochastic observation In order to obtain a compact description of it. In engineering field PCA is utilized mainly (or data compression and restoration. In this paper we propose a new robust Hebbian algorithm for robust PCA. This algorithm is based on a hyperbolic tangent function due to Hampel ef al.(1989) which is known to be robust in Statistics. We do two experiments to investigate the performance of the new robust Hebbian learning algorithm for robust PCA.

  • PDF

A tuning method for robust PID controller (강인 PID 제어기 설계)

  • 윤상준;이상정
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.585-588
    • /
    • 1996
  • The conventional output feedback robust control designs are very useful for systems under parameter perturbation and uncertain disturbance. However these designs are very complicated and not easily implemented for industrial applications. So, this paper proposes a robust PID controller design method via genetic searching algorithm.

  • PDF

A Study on Linear Matrix Inequalities Robust Active Suspension Control System Design Algorithm

  • Park, Jung-Hyen
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.1
    • /
    • pp.105-109
    • /
    • 2008
  • A robust optimal control system design algorithm in active suspension equipment adopting linear matrix inequalities control system design theory is presented. The validity of the linear matrix inequalities robust control system design in active suspension system through the numerical examples is also investigated.

Thai Classical Music Matching Using t-Distribution on Instantaneous Robust Algorithm for Pitch Tracking Framework

  • Boonmatham, Pheerasut;Pongpinigpinyo, Sunee;Soonklang, Tasanawan
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1213-1228
    • /
    • 2017
  • The pitch tracking of music has been researched for several decades. Several possible improvements are available for creating a good t-distribution, using the instantaneous robust algorithm for pitch tracking framework to perfectly detect pitch. This article shows how to detect the pitch of music utilizing an improved detection method which applies a statistical method; this approach uses a pitch track, or a sequence of frequency bin numbers. This sequence is used to create an index that offers useful features for comparing similar songs. The pitch frequency spectrum is extracted using a modified instantaneous robust algorithm for pitch tracking (IRAPT) as a base combined with the statistical method. The pitch detection algorithm was implemented, and the percentage of performance matching in Thai classical music was assessed in order to test the accuracy of the algorithm. We used the longest common subsequence to compare the similarities in pitch sequence alignments in the music. The experimental results of this research show that the accuracy of retrieval of Thai classical music using the t-distribution of instantaneous robust algorithm for pitch tracking (t-IRAPT) is 99.01%, and is in the top five ranking, with the shortest query sample being five seconds long.

Velocity Matching Algorithm Using Robust H₂Filter (강인 H₂필터를 이용한 속도정합 알고리즘)

  • Yang, Cheol Gwan;Sim, Deok Seon;Park, Chan Guk
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.4
    • /
    • pp.363-363
    • /
    • 2001
  • We study on the velocity matching algorithm for transfer alignment of inertial navigation system(INS) using a robust H₂ filter. We suggest an uncertainty model and a discrete robust H₂filter for INS and apply the suggested robust H₂ filter to the uncertainty model. The discrete robust H₂filter is shown by simulation to have better performance time and accuracy than Kalman filter.

High-Quality and Robust Reversible Data Hiding by Coefficient Shifting Algorithm

  • Yang, Ching-Yu;Lin, Chih-Hung
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.429-438
    • /
    • 2012
  • This study presents two reversible data hiding schemes based on the coefficient shifting (CS) algorithm. The first scheme uses the CS algorithm with a mean predictor in the spatial domain to provide a large payload while minimizing distortion. To guard against manipulations, the second scheme uses a robust version of the CS algorithm with feature embedding implemented in the integer wavelet transform domain. Simulations demonstrate that both the payload and peak signal-to-noise ratio generated by the CS algorithm with a mean predictor are better than those generated by existing techniques. In addition, the marked images generated by the variant of the CS algorithm are robust to various manipulations created by JPEG2000 compression, JPEG compression, noise additions, (edge) sharpening, low-pass filtering, bit truncation, brightness, contrast, (color) quantization, winding, zigzag and poster edge distortion, and inversion.

Robust Construction of Voronoi Diagram of Circles by Region-Expansion Algorithm (영역 확장법을 통한 평면에서 원들의 보로노이 다이어그램의 강건한 계산)

  • Kim, Donguk
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.3
    • /
    • pp.52-60
    • /
    • 2019
  • This paper presents a numerically robust algorithm to construct a Voronoi diagram of circles in the plane. The circles are allowed to have intersections among them, but one circle cannot fully contain another circle. The Voronoi diagram is a tessellation of the plane into Voronoi regions of given circles. Each circle has its Voronoi region which is defined by a set of points in the plane closer to the circle than any other circles. The distance from a point p to a circle $c_i$ of center $p_i$ and radius $r_i$ is ${\parallel}p-p_i{\parallel}-r_i$, which is the closest Euclidean distance from p to the circle boundary. The proposed algorithm first constructs the point Voronoi diagram of centers of given circles, then it enlarges each point to the circle and expands its Voronoi region accordingly. This region-expansion process is done by local modifications and after completing this process for the whole circles the desired circle Voronoi diagram can be obtained. The proposed algorithm is numerically robust and we provide with a few examples to show its robustness. The algorithm runs in $O(n^2)$ time in the worst case and O(n) time on average where n is the number of the circles. The experiment shows that the region-expansion algorithm is robust and runs fast with strong linear time behavior.

A Robust Track-following Control with Multiple Constraints Using Genetic Algorithm (유전자 알고리즘을 이용한 다중 제한 조건을 만족하는 강인 트랙 추종 제어)

  • Lee, Moon-Noh;Lee, Hong-Kyu;Jin, Kyoung-Bog
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.22 no.3
    • /
    • pp.275-283
    • /
    • 2012
  • This paper presents a design method of a robust tracking controller satisfying multiple constraints using genetic algorithm. A robust $H_{\infty}$ constraint with loop shaping is used to address disturbance attenuation with error limits and a loop gain constraint is considered so as not to enlarge the tracking loop gain and bandwidth unnecessarily. The robust $H_{\infty}$ constraint is expressed by a matrix inequality and the loop gain constraint is considered as an objective function so that genetic algorithm can be applied. Finally, a robust tracking controller can be obtained by integrating genetic algorithm with LMI approach. The proposed tracking controller design method is applied to the track-following system of an optical DVD recording drive and is evaluated through the experimental results.

Sliding Mode Control for Robot Manipulator Usin Evolution Strategy (Evolution Strategy를 이용한 로봇 매니퓰레이터의 슬라이딩 모드 제어)

  • 김현식;박진현;최영규
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 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.

  • PDF

Solving Robust EOQ Model Using Genetic Algorithm

  • Lim, Sung-Mook
    • Management Science and Financial Engineering
    • /
    • v.13 no.1
    • /
    • pp.35-53
    • /
    • 2007
  • We consider a(worst-case) robust optimization version of the Economic Order Quantity(EOQ) model. Order setup costs and inventory carrying costs are assumed to have uncertainty in their values, and the uncertainty description of the two parameters is supposed to be given by an ellipsoidal representation. A genetic algorithm combined with Monte Carlo simulation is proposed to approximate the ellipsoidal representation. The objective function of the model under ellipsoidal uncertainty description is derived, and the resulting problem is solved by another genetic algorithm. Computational test results are presented to show the performance of the proposed method.