• Title/Summary/Keyword: Complex algorithm

Search Result 2,600, Processing Time 0.028 seconds

Efficient Coverage Algorithm based-on Grouping for Autonomous Intelligent Robots (자율 지능형 로봇을 위한 그룹화 기반의 효율적 커버리지 알고리즘)

  • Jeon, Heung-Seok;Noh, Sam-H.
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.2
    • /
    • pp.243-250
    • /
    • 2008
  • The coverage algorithm based on Boustrophedon path has been known to be the most efficient in places without or less obstacles If the map of an environmental area thru SLAM algorithm can be obtainable. However, the efficiency of the coverage algorithm based on Boustrophedon path drops drastically when obstacles are complex. In this paper, we propose and implement a new algorithm, which we call Group-k, that efficiently handles the complex area. The Group-k algorithm groups the obstacles and prioritizes the covering sequences with complex rank of the groups. Implementation-based experiments show about 20% improved performance when applying the nor- algorithm, compared to the Boustrophedon path algorithm.

  • PDF

QRS Detection Algorithm for ECG Analysis (ECG 진단을 위한 QRS 검출 알고리즘)

  • Hong, Sung Ho;Kim, Young Seop;Lee, Myeong Seok;Noh, Hack Youp;Chi, Yong Seok
    • Journal of the Semiconductor & Display Technology
    • /
    • v.11 no.3
    • /
    • pp.57-61
    • /
    • 2012
  • In order to analyze the ECG, it is important to pinpoint the repeat interval of the ECG. In this paper, we present an efficient algorithm for finding the QRS complex on the ECG. We escaped from the conventional methods to go through multiple steps of preprocessing to make ECG easier to find the QRS complex. We selected the candidate peak that has the possibility of the QRS complex in original ECG, and used technique to find the QRS complex among the candidate peak. In this way, we could get similar efficiency to Pan & Tompkins Algorithm that is most representative QRS complex detection algorithm, just used fewer operations than Pan & Tompkins Algorithm.

Maximum Likelihood Estimation for the Laplacian Autoregressive Time Series Model

  • Son, Young-Sook;Cho, Sin-Sup
    • Journal of the Korean Statistical Society
    • /
    • v.25 no.3
    • /
    • pp.359-368
    • /
    • 1996
  • The maximum likelihood estimation is discussed for the NLAR model with Laplacian marginals. Since the explicit form of the estimates cannot be obtained due to the complicated nature of the likelihood function we utilize the automatic computer optimization subroutine using a direct search complex algorithm. The conditional least square estimates are used as initial estimates in maximum likelihood procedures. The results of a simulation study for the maximum likelihood estimates of the NLAR(1) and the NLAR(2) models are presented.

  • PDF

A real-time QRS complex detection algorithm using topological mapping in ECG signals (심전도 신호의 위상학적 팹핑을 이용한 실시간 QRS 검출 알고리즘)

  • 이정환;정기삼;이병채;이명호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.5
    • /
    • pp.48-58
    • /
    • 1998
  • In this paper, we proposed a new algorithm using characteristics of th ereconstructed phase trajectory by topological mapping developed for a real-tiem detection of the QRS complexes of ECG signals. Using fill-factor algorithm and mutual information algorithm which are in genral used to find out the chaotic characteristics of sampled signals, we inferred the proper mapping parameter, time delay, in ECG signals and investigated QRS detection rates with varying time delay in QRS complex detection. And we compared experimental time dealy with the theoretical one. As a result, it shows that the experimental time dealy which is proper in topological mapping from ECG signals is 20ms and theoretical time delays of fill-factor algorithm and mutual information algorithm are 20.+-.0.76ms and 28.+-.3.51ms, respectively. From these results, we could easily infer that the fill-factor algorithm in topological mapping from one-dimensional sampled ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper time delay. Also with the proposed algorithm which is very simple and robust to low-frequency noise as like baseline wandering, we could detect QRS complex in real-time by simplifying preprocessing stages. For the evaluation, we implemented the proposed algorithm in C-language and applied the MIT/BIH arrhythmia database of 48 patients. The proposed algorithm provides a good performance, a 99.58% detection rate.

  • PDF

Recurrent Neural Network Adaptive Equalizers Based on Data Communication

  • Jiang, Hongrui;Kwak, Kyung-Sup
    • Journal of Communications and Networks
    • /
    • v.5 no.1
    • /
    • pp.7-18
    • /
    • 2003
  • In this paper, a decision feedback recurrent neural network equalizer and a modified real time recurrent learning algorithm are proposed, and an adaptive adjusting of the learning step is also brought forward. Then, a complex case is considered. A decision feedback complex recurrent neural network equalizer and a modified complex real time recurrent learning algorithm are proposed. Moreover, weights of decision feedback recurrent neural network equalizer under burst-interference conditions are analyzed, and two anti-burst-interference algorithms to prevent equalizer from out of working are presented, which are applied to both real and complex cases. The performance of the recurrent neural network equalizer is analyzed based on numerical results.

Tracking characteristics of the complex-LMS algorithm for a sweeping frequency sine-wave signal (주파수가 선형적으로 변하는 조화 입력에 대한 복소 최소자승오차법의 추종 특성)

  • 배상준;박영진
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.173-176
    • /
    • 1996
  • The transient behavior of the complex-LMS adaptive filter is studied when the adaptive filter is operating on a fixed or sweeping complex frequency sine-wave signal. The first-order difference equation is derived for the mean weights and its closed form solution is obtained. The transient response is represented as a function of the eigenvectors and eigenvalues of input correlation matrix. The mean-square error of the algorithm is evaluated as well. An optimal convergence parameter and filter length can be determined for sweeping frequency sine-wave signals as a function of frequency change rate and signal and noise powers.

  • PDF

Islanding Detection Based on Complex Power at the Intertie (연계점에서의 복소전력을 이용한 단독운전 판단기법)

  • Kang, Yong-Cheol;Cha, Sun-Hee;Jang, Sung-Il;Kang, Hae-Gweon;Kim, Yong-Gyun;Park, Goon-Cherl
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.12
    • /
    • pp.2167-2172
    • /
    • 2008
  • A large scale embedded generator or a micro-grid is usually interconnected to the grid through the dedicated line. Immediately after the removal of the grid supply, it must be disconnected and remain disconnected until the normal grid supplies are restored. This paper proposes an islanding detection algorithm based on complex power at the intertie. Complex power at the intertie delivered to the grid has a value depending on power flow during normal operation. When loss of mains occurs, complex power at the intertie moves to a value depending on the parameters of the dedicated line. The performance of the proposed algorithm was investigated under various operating and fault conditions. The proposed algorithm can detect an islanding operation even if no power is exchanged prior to loss of mains and discriminate the fault condition from islanding.

Multi-Level Fusion Processing Algorithm for Complex Radar Signals Based on Evidence Theory

  • Tian, Runlan;Zhao, Rupeng;Wang, Xiaofeng
    • Journal of Information Processing Systems
    • /
    • v.15 no.5
    • /
    • pp.1243-1257
    • /
    • 2019
  • As current algorithms unable to perform effective fusion processing of unknown complex radar signals lacking database, and the result is unstable, this paper presents a multi-level fusion processing algorithm for complex radar signals based on evidence theory as a solution to this problem. Specifically, the real-time database is initially established, accompanied by similarity model based on parameter type, and then similarity matrix is calculated. D-S evidence theory is subsequently applied to exercise fusion processing on the similarity of parameters concerning each signal and the trust value concerning target framework of each signal in order. The signals are ultimately combined and perfected. The results of simulation experiment reveal that the proposed algorithm can exert favorable effect on the fusion of unknown complex radar signals, with higher efficiency and less time, maintaining stable processing even of considerable samples.

Development of Self-Adaptive Meta-Heuristic Optimization Algorithm: Self-Adaptive Vision Correction Algorithm (자가 적응형 메타휴리스틱 최적화 알고리즘 개발: Self-Adaptive Vision Correction Algorithm)

  • Lee, Eui Hoon;Lee, Ho Min;Choi, Young Hwan;Kim, Joong Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.6
    • /
    • pp.314-321
    • /
    • 2019
  • The Self-Adaptive Vision Correction Algorithm (SAVCA) developed in this study was suggested for improving usability by modifying four parameters (Modulation Transfer Function Rate, Astigmatic Rate, Astigmatic Factor and Compression Factor) except for Division Rate 1 and Division Rate 2 among six parameters in Vision Correction Algorithm (VCA). For verification, SAVCA was applied to two-dimensional mathematical benchmark functions (Six hump camel back / Easton and fenton) and 30-dimensional mathematical benchmark functions (Schwefel / Hyper sphere). It showed superior performance to other algorithms (Harmony Search, Water Cycle Algorithm, VCA, Genetic Algorithms with Floating-point representation, Shuffled Complex Evolution algorithm and Modified Shuffled Complex Evolution). Finally, SAVCA showed the best results in the engineering problem (speed reducer design). SAVCA, which has not been subjected to complicated parameter adjustment procedures, will be applicable in various fields.

A Study on the Out-of-Step Detection Algorithm using Time Variation of Complex Power-Part II : Out-of-Step Detection Algorithm using a Trajectory of Complex Power (복소전력의 변화율을 이용한 동기탈조 검출 알고리즘에 관한 연구-Part II: 복소전력의 궤적 변화를 이용한 동기탈조 검출 알고리즘)

  • Kim Chul-Hwan;Heo Jeong-Yong;Kwon O-Sang
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.5
    • /
    • pp.217-225
    • /
    • 2005
  • In a power system, an out-of-step condition causes a variety of risk such as serious damage to system elements, tripping of loads and generators, mal-operation of relays, etc. Therefore, it is very important to detect the out-of-step condition and take a proper measure. Several out-of-step detection methods have been employed in relays until now. Most common method used for an out-of-step detection is based on the transition time through the blocking impedance area in R-X diagram. Also, the R-R dot out-of-step relay, the out-of-step prediction method and the adaptive out-of-step relay using the equal area criterion (EAC) and Global Positioning Satellite (GPS) technology have been developed. This paper presents the out-of-step detection algorithm using the time variation of the complex power. The complex power is calculated and the mechanical power of the generator is estimated by using the electrical power, and then the out-of-step detection algorithm which is based on the complex power and the estimated mechanical power, is presented. This algorithm may detect the instant when the generator angle passes the Unstable Equilibrium Point (UEP). The proposed out-of-step algorithm is verified and tested by using Alternative Transient Program/Electromagnetic Transient Program (ATP/EMTP) MODELS.