• Title/Summary/Keyword: recursive

Search Result 1,606, Processing Time 0.028 seconds

A Study on Progressive Removing Radar Clutter by Wavelet and Recursive Mathematical Morphology (Wavelet과 반복적 수리형태학을 이용한 레이더 클러터의 점진적 제거에 관한 연구)

  • Jeong, Gi-Ryong
    • Journal of Navigation and Port Research
    • /
    • v.26 no.2
    • /
    • pp.209-213
    • /
    • 2002
  • MRA(Multi-resolution analysis) algorithm by Wavelet and morphology with $3{\times}3$ SQ(square) SE(structure element) is efficient to remove ship's radar clutter progressively and enhances detecting performance. Smoothing efficiency of RMM (Recursive mathematical Morphology) is better than that of Morphology. So, to get a better result than that of old algorithms, this paper proposes a new MRA algorithm which uses Wavelet and Recursive mathematical Morphology with $3{\times}3$ RHR(rhombus) SE. Simulation result of the proposed algorithm shows that PSNR is 0.65~1.50db better than that of old method.

Radial basis function network design for chaotic time series prediction (혼돈 시계열의 예측을 위한 Radial Basis 함수 회로망 설계)

  • 신창용;김택수;최윤호;박상희
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.45 no.4
    • /
    • pp.602-611
    • /
    • 1996
  • In this paper, radial basis function networks with two hidden layers, which employ the K-means clustering method and the hierarchical training, are proposed for improving the short-term predictability of chaotic time series. Furthermore the recursive training method of radial basis function network using the recursive modified Gram-Schmidt algorithm is proposed for the purpose. In addition, the radial basis function networks trained by the proposed training methods are compared with the X.D. He A Lapedes's model and the radial basis function network by nonrecursive training method. Through this comparison, an improved radial basis function network for predicting chaotic time series is presented. (author). 17 refs., 8 figs., 3 tabs.

  • PDF

A modeling for an ionospheric channel using recursive digital filter (Recursive 디지털 필터에 의한 전리층 채널 모델링)

  • 김성진
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.5 no.2
    • /
    • pp.143-150
    • /
    • 2004
  • In this paper, a recursive digital filter realization for an ionospheric channel model is proposed. This realization is in the form of a cascade of identical second-order all-pass filters, and is determined by only three parameters; two coefficients of an all-pass section, and the number of sections. The values of these parameters are optimized by a nonlinear optimization algorithm called the "downhill simplex method", so that the resulting time delay function closely approximates that of the ionospheric channel model. Comparing with the nonrecursive digital filter realization, it can be shown that the proposed recursive-digital-filter-realization is advantageous in points of view for the numbers of filter coefficients and the realization.

  • PDF

Fast Bilateral Filtering Using Recursive Gaussian Filter for Tone Mapping Algorithm

  • Dewi, Primastuti;Nam, Jin-Woo;Cha, Eui-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.176-179
    • /
    • 2010
  • In this paper, we propose a fast implementation of Bilateral filter for tone mapping algorithm. Bilateral filter is able to preserve detail while at the same time prevent halo-ing artifacts because of improper scale selection by ensuring image smoothed that not only depend on pixel closeness, but also similarity. We accelerate Bilateral filter by using a piecewise linear approximation and recursive Gaussian filter as its domain filter. Recursive Gaussian filter is scale independent filter that combines low cost 1D filter which makes this filter much faster than conventional convolution filter and filtering in frequency domain. The experiment results show that proposed method is simpler and faster than previous method without mortgaging the quality.

  • PDF

Mode analysis of end-milling process by RLSM (RLSM 모델링에 의한 엔드밀링 시스템의 모드 분석)

  • Kim, J.D.;Yoon, M.C.;Kim, K.H.
    • Journal of Power System Engineering
    • /
    • v.15 no.5
    • /
    • pp.54-60
    • /
    • 2011
  • In this study, an analytical realization of end-milling system was introduced using recursive parametric modeling analysis. Also, the numerical mode analysis of end-milling system with different conditions was performed systematically. In this regard, a recursive least square(RLS) modeling algorithm and the natural mode for real part and imaginary one was discussed. This recursive approach (RLSM) can be adopted for the on-line system identification and monitoring of an end-milling for this purpose. After experimental practice of the end-milling, the end-milling force was obtained and it was used for the calculation of FRF(Frequency response function) and mode analysis. Also the FRF was analysed for the prediction of a end-milling system using recursive algorithm.

A Device of Parallelism Control in POSIX Based Parallelization of Recursive Algorithms (POSIX스레드에 의한 재귀적 알고리즘의 병렬화에서 병렬성 제어 방안)

  • Lee, Hyung-Bong;Baek, Chung-Ho
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.249-258
    • /
    • 2002
  • One of the jai or purposes of multiprocessor system is to get a high efficiency in performance improvement. But in most cases, it is unavoidable to use some special programming languages or tools for full use of multiprocessor system. In general, loop and recursive call statements of algorithms are considered as typical parts for parallelization. Especially, recursive call statements are easy to parallelize conceptually without support of any special languages or tools. But it is difficult to control the degree of parallelism caused by high depth of recursive call leading to execution crash. This paper proposes a device to control Parallelism in the process of POSIX thread bated parallelization of recursive algorithms. For this, we define the concept of thread and process in UNIX system, and analyze the results of experimental application of the device to quick sorting algorithm.

Computation of Blocking Probability in a Loss System

  • Na, Seong-Ryong
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2005.05a
    • /
    • pp.203-207
    • /
    • 2005
  • A loss system where two types of customers arrive in accordance with two independent Poisson processes is considered. An efficient recursive formula is developed for calculating the loss probability when the number of servers is large. Some practical examples regarding the performance evaluation of telecommunications networks are discussed.

  • PDF