• Title/Summary/Keyword: Recursive Function

Search Result 206, Processing Time 0.025 seconds

Fast Approach for Stereo Balancing Mapping Function

  • Kim, J.S.;Lee, S.K.;Kim, T.Y.;Lee, J.Y.;Choi, J.S.
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.286-289
    • /
    • 2009
  • This paper presents an effective approach to minimize recursive computations for balancing stereo pairs by using disparity vector errors and its directional histogram. A stereo balancing function is computed from the correspondent pixels between two images, and a simple approach is to find the matching blocks of two images. However, this procedure requires recursive operation, and its computation cost is very high. Therefore, in this paper, we propose an efficient balance method using structural similarity index and a partial re-searching scheme to reduce the computation cost considerably. For this purpose, we determine if re-searching for each block is necessary or not by using the errors and the directional histogram of disparity vectors. Experiment results show that the performance of the proposed approach can save the computations significantly with ignorable image quality degradation compared with full re-search approach.

  • PDF

Translation utilizing Dynamic Structure from Recursive Procedure & Function in C to VHDL (C의 재귀 호출로부터 동적 구조를 활용한 VHDL로의 변환)

  • Hong, Seung-Wan;Lee, Jeong-A
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.10
    • /
    • pp.3247-3261
    • /
    • 2000
  • In recent years, as the complexity of signal processmg systems Increases, the needs for dcslgners to mlx up hardware-part and software-part grow more and more considering both performance and cost There exist many algorilhms In C for vanous Signal processung apphcations. We have to translate the algonlhm C to hardware descnptlon language(HDL), If portion or the algonlhm needs to be unplcmenled in hardwarc pari of the syslcm. For this translation. it's dtfftcult to handle dynamic memory allocalion, function calls, pointer manipoJalion. This research shows a design method for a hardware model about recursive calls which was classified into software part of the system previously [or the translation from C to VHDL. The benefits of havlIlg recursive calls m hardware structure can be quite high since provides flexbility in hardware/software partitioming in codesign sysem.

  • PDF

A Recursive Method of Transforming a Response Variable for Linearity

  • Seo, Han-Son
    • Communications for Statistical Applications and Methods
    • /
    • v.5 no.2
    • /
    • pp.297-306
    • /
    • 1998
  • We consider a graphical method for visualizing the strictly monotonic transformation of t(y) so that the regression function E(t(y)$\mid$x) is linear in the predictor vector x. Cook and Weisberg (1994) proposed an inverse response plot which relies on the results of Li & Duan (1989) to obtain consistent estimates. Based on the recursive addition of the results from the two dimensional plots, we propose a new procedure which can be used when the consistency result is in doubt.

  • PDF

GLOBAL ATTRACTIVITY OF THE RECURSIVE SEQUENCE $x_{n+1}$ = $\frac{\alpha-{\beta}x_{n-1}}{\gamma+g(x_n)}$

  • Ahmed, A. M.
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.1_2
    • /
    • pp.275-282
    • /
    • 2008
  • Our aim in this paper is to investigate the global attractivity of the recursive sequence $x_{n+1}$ = $\frac{\alpha-{\beta}x_{n-1}}{\gamma+g(x_n)}$ under specified conditions. We show that the positive (or zero for $\alpha$ = 0) equilibrium point of the equation is a global attractor with a basin that depends on certain conditions posed on the coefficients and the function g(x).

  • PDF

Real-time recursive identification of unknown linear systems (미지의 선형 시스템에 대한 실시감 회귀 모델링)

  • 최수일;김병국
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.548-553
    • /
    • 1992
  • In this paper and recursive version of orthogonal ARMA identification algorithm is proposed. The basic algorithm is based on Gram-Schmidt orthogonalization of automatically selected basis functions from specified function space, but does not require explicit creation of orthogonal functions. By using two dimensional autocorrelations and crosscorrelations of input and output with constant data length, identification algorithm is extended to cope slowly time-varying or order-varying delayed system.

  • PDF

An SQL Function for the Construction of Recursively Structured XML values from the Relational Data (관계 데이터로부터 재귀적 구조의 XML 값을 생성하는 SQL 함수)

  • Park, Sung-Chul;Park, Young-Chul
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.4
    • /
    • pp.309-313
    • /
    • 2009
  • SQL:2003 standard provides SQL/XML publishing functions to publish the result of an SQL query as XML values but it does not provide any SQL/XML publishing function that can publish the result of a recursive query as recursively structured XML values. Therefore, for the relational tuples which are connected directly or indirectly according to given conditions, to publish both the contents of them and the relationship among them as XML values with the use of appropriate SQL/XML publishing functions, we have to write a nested SQL query. Writing that query, however, is not easy provided that the depth of the connections is deep even if we know the depth of them and is not possible once the depth of the connections is not known in advance. In order to resolve that problem, we propose a new SQL function XMLNEST that can publish the result of a recursive query as recursively structured XML values.

A Recursive Restoration Scheme of B-Scan Ultrasonographic Images in Noisy Case (잡음을 고려한 회귀방법에 의한 초음파 진단기의 화상개선)

  • Kim, Sun-I.;Min, Byoung-G.;Ko, Myoung-S.
    • Journal of Biomedical Engineering Research
    • /
    • v.3 no.1
    • /
    • pp.35-42
    • /
    • 1982
  • The objective of this phantom study is to develop a digital method for improving the lateral resolution of B-scan ultrasonographic images irs medical application of ultrasound. By utilizing a discrete state-space modeling approach and Kalman-Buch method for analysis of the transducer's beam profile and the measurement and sampling noise, a stable recursive restoration of the object image was obtained for improved lateral resolution. The point spread function (PSF) was measured for the reflective signals after scanning the small pins located along the depth of interest. One major advantage of the present recursive scheme over the transform method is in its applicability for the space-variant imaging, such as in the case of the rotational movement of transducer.

  • PDF

Recursive Design of Nonlinear Disturbance Attenuation Control for STATCOM

  • Liu Feng;Mei Shengwei;Lu Qiang;Goto Masno
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.spc2
    • /
    • pp.262-269
    • /
    • 2005
  • In this paper, a nonlinear robust control approach is applied to design a controller for the Static Synchronous Compensator (STATCOM). A robust control dynamic model of STATCOM in a one-machine, infinite-bus system is established with consideration of the torque disturbance acting on the rotating shaft of the generator set and the disturbance to the output voltage of STATCOM. A novel recursive approach is utilized to construct the energy storage function of the system such that the solution to the disturbance attenuation control problem is acquired, which avoids the difficulty involved in solving the Hamilton-Jacobi-Issacs (HJI) inequality. Sequentially, the nonlinear disturbance attenuation control strategy of STATCOM is obtained. Simulation results demonstrate that STATCOM with the proposed controller can more effectively improve the voltage stability, damp the oscillation, and enhance the transient stability of power systems compared to the conventional PI+PSS controller.

An Experimental Study on Realtime Estimation of a Nominal Model for a Disturbance Observer: Recursive Least Squares Approach (실시간 공칭 모델 추정 외란관측기에 관한 실험 연구: 재귀최소자승법)

  • Lee, Sang-Deok;Jung, Seul
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.8
    • /
    • pp.650-655
    • /
    • 2016
  • In this paper, a novel RLS-based DOB (Recursive Least Squares Disturbance Observer) scheme is proposed to improve the performance of DOB for nominal model identification. A nominal model can be generally assumed to be a second order system in the form of a proper transfer function of an ARMA (Autoregressive Moving Average) model. The RLS algorithm for the model identification is proposed in association with DOB. Experimental studies of the balancing control of a one-wheel robot are conducted to demonstrate the feasibility of the proposed method. The performances between the conventional DOB scheme and the proposed scheme are compared.

Recursive Estimation of Euclidean Distance between Probabilities based on A Set of Random Symbols (랜덤 심볼열에 기반한 확률분포의 반복적 유클리드 거리 추정법)

  • Kim, Namyong
    • Journal of Internet Computing and Services
    • /
    • v.15 no.4
    • /
    • pp.119-124
    • /
    • 2014
  • Blind adaptive systems based on the Euclidean distance (ED) between the distribution function of the output samples and that of a set of random symbols generated at the receiver matching with the distribution function of the transmitted symbol points estimate the ED at each iteration time to examine its convergence state or its minimum ED value. The problem is that this ED estimation obtained by block?data processing requires a heavy calculation burden. In this paper, a recursive ED estimation method is proposed that reduces the computational complexity by way of utilizing the relationship between the current and previous states of the datablock. The relationship provides a ground that the currently estimated ED value can be used for the estimation of the next ED without the need for processing the whole new data block. From the simulation results the proposed recursive ED estimation shows the same estimation values as that of the conventional method, and in the aspect of computational burden, the proposed method requires only O(N) at each iteration time while the conventional block?processing method does $O(N^2)$.