• Title/Summary/Keyword: Recursive Method

Search Result 743, Processing Time 0.028 seconds

Noise Statistics Estimation Using Target-to-Noise Contribution Ratio for Parameterized Multichannel Wiener Filter (변수내장형 다채널 위너필터를 위한 목적신호대잡음 기여비를 이용한 잡음추정기법)

  • Hong, Jungpyo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.12
    • /
    • pp.1926-1933
    • /
    • 2022
  • Parameterized multichannel Wiener filter (PMWF) is a linear filter that can control the trade-off between residual noise and signal distortion using the embedded parameter. To apply the PMWF to noisy inputs, accurate noise estimation is important and multichannel minima-controlled recursive averaging (MMCRA) is widely used. However, in the case of the MMCRA, the accuracy of noise estimation decreases when a directional interference is involved into the array inputs. Consequently, the performance of the PMWF is degraded. Therefore, we propose a noise power spectral density (PSD) estimation method for the PMWF in this paper. The proposed method is based on a consecutive process of eigenvalue decomposition on noisy input PSD, estimation of the target component contribution using directional information, and exponential weighting for improved estimation of the target contribution. For evaluation, four objective measures were compared with the MMCRA and we verify that the PMWF with the proposed noise estimation method can improve performance in environments where directional interfereces exist.

A novel adaptive unscented Kalman Filter with forgetting factor for the identification of the time-variant structural parameters

  • Yanzhe Zhang ;Yong Ding ;Jianqing Bu;Lina Guo
    • Smart Structures and Systems
    • /
    • v.32 no.1
    • /
    • pp.9-21
    • /
    • 2023
  • The parameters of civil engineering structures have time-variant characteristics during their service. When extremely large external excitations, such as earthquake excitation to buildings or overweight vehicles to bridges, apply to structures, sudden or gradual damage may be caused. It is crucially necessary to detect the occurrence time and severity of the damage. The unscented Kalman filter (UKF), as one efficient estimator, is usually used to conduct the recursive identification of parameters. However, the conventional UKF algorithm has a weak tracking ability for time-variant structural parameters. To improve the identification ability of time-variant parameters, an adaptive UKF with forgetting factor (AUKF-FF) algorithm, in which the state covariance, innovation covariance and cross covariance are updated simultaneously with the help of the forgetting factor, is proposed. To verify the effectiveness of the method, this paper conducted two case studies as follows: the identification of time-variant parameters of a simply supported bridge when the vehicle passing, and the model updating of a six-story concrete frame structure with field test during the Yangbi earthquake excitation in Yunnan Province, China. The comparison results of the numerical studies show that the proposed method is superior to the conventional UKF algorithm for the time-variant parameter identification in convergence speed, accuracy and adaptability to the sampling frequency. The field test studies demonstrate that the proposed method can provide suggestions for solving practical problems.

A study on the Improved Convergence Characteristic over Weight Updating of Recycling Buffer RLS Algorithm (재순환 버퍼 RLS 알고리즘에서 가중치 갱신을 이용한 개선된 수렴 특성에 관한 연구)

  • 나상동
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5B
    • /
    • pp.830-841
    • /
    • 2000
  • We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-1, we may compute the updated estimate of this vector at iteration a upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RL algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the (B+1)times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.

  • PDF

An Early Termination Algorithm of Prediction Unit (PU) Search for Fast HEVC Encoding (HEVC 고속 부호화를 위한 PU 탐색 조기 종료 기법)

  • Kim, Jae-Wook;Kim, Dong-Hyun;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.19 no.5
    • /
    • pp.627-630
    • /
    • 2014
  • The latest video coding standard, high efficiency video coding (HEVC) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure which allows recursive splitting into four equally sized blocks. At each depth level, each CU is partitioned into variable sized blocks of prediction units (PUs). However, the determination of the best CU partition for each coding tree unit (CTU) and the best PU mode for each CU causes a dramatic increase in computational complexity. To reduce such computational complexity, we propose a fast PU decision algorithm that early terminates PU search. The proposed method skips the computation of R-D cost for certain PU modes in the current CU based on the best mode and the rate-distortion (RD) cost of the upper depth CU. Experimental results show that the proposed method reduces the computational complexity of HM12.0 to 18.1% with only 0.2% increases in BD-rate.

An Improved Adaptive Background Mixture Model for Real-time Object Tracking based on Background Subtraction (배경 분리 기반의 실시간 객체 추적을 위한 개선된 적응적 배경 혼합 모델)

  • Kim Young-Ju
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.6 s.38
    • /
    • pp.187-194
    • /
    • 2005
  • The background subtraction method is mainly used for the real-time extraction and tracking of moving objects from image sequences. In the outdoor environment, there are many changeable environment factors such as gradually changing illumination, swaying trees and suddenly moving objects , which are to be considered for an adaptive processing. Normally, GMM(Gaussian Mixture Model) is used to subtract the background by considering adaptively the various changes in the scenes, and the adaptive GMMs improving the real-time Performance were Proposed and worked. This paper, for on-line background subtraction, employed the improved adaptive GMM, which uses the small constant for learning rate a and is not able to speedily adapt the suddenly movement of objects, So, this paper Proposed and evaluated the dynamic control method of a using the adaptive selection of the number of component distributions and the global variances of pixel values.

  • PDF

Real-Time Vehicle Mass Estimator for Active Rollover Prevention Systems (차량 전복 방지 장치를 위한 실시간 차량 질량 추정 시스템)

  • Han, Kwang-Jin;Kim, In-Keun;Kim, Seung-Ki;Huh, Kun-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.6
    • /
    • pp.673-679
    • /
    • 2012
  • Vehicle rollover is a serious kind of accident, particularly for sport utility vehicles, and its occurrence can be minimized by utilizing active rollover prevention systems. The performance of these protection systems is very sensitive to vehicle inertial parameters such as the vehicle's mass and center of mass. These parameters vary with the number of passengers and in different load situations. In this paper, a unified method for vehicle mass estimation is proposed that takes into account the available driving conditions. Three estimation algorithms are developed based on longitudinal, lateral, and vertical vehicle motion, respectively. Then, the three algorithms are combined to extract information on the vehicle's mass during arbitrary vehicle maneuvering. The performance of the proposed vehicle mass estimation method is demonstrated through real-time experiments.

Development of finite element analysis program and simplified formulas of bellows and shape optimization (벨로우즈에 대한 유한요소해석 프로그램 및 간편식의 개발과 형상최적설계)

  • Koh, Byung-Kab;Park, Gyung-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.21 no.8
    • /
    • pp.1195-1208
    • /
    • 1997
  • Bellows is a component in piping systems which absorbs mechanical deformation with flexibility. Its geometry is an axial symmetric shell which consists of two toroidal shells and one annular plate or conical shell. In order to analyze bellows, this study presents the finite element analysis using a conical frustum shell element. A finite element analysis is developed to analyze various bellows. The validity of the developed program is verified by the experimental results for axial and lateral stiffness. The formula for calculating the natural frequency of bellows is made by the simple beam theory. The formula for fatigue life is also derived by experiments. The shape optimal design problem is formulated using multiple objective optimization. The multiple objective functions are transformed to a scalar function by weighting factors. The stiffness, strength and specified stiffness are considered as the multiple objective function. The formulation has inequality constraints imposed on the fatigue limit, the natural frequencies, and the manufacturing conditions. Geometric parameters of bellows are the design variables. The recursive quadratic programming algorithm is selected to solve the problem. The results are compared to existing bellows, and the characteristics of bellows is investigated through optimal design process. The optimized shape of bellows is expected to give quite a good guideline to practical design.

Rainfall Prediction of Seoul Area by the State-Vector Model (상태벡터 모형에 의한 서울지역의 강우예측)

  • Chu, Chul
    • Water for future
    • /
    • v.28 no.5
    • /
    • pp.219-233
    • /
    • 1995
  • A non-stationary multivariate model is selected in which the mean and variance of rainfall are not temporally or spatially constant. And the rainfall prediction system is constructed which uses the recursive estimation algorithm, Kalman filter, to estimate system states and parameters of rainfall model simulataneously. The on-line, real-time, multivariate short-term, rainfall prediction for multi-stations and lead-times is carried out through the estimation of non-stationary mean and variance by the storm counter method, the normalized residual covariance and rainfall speed. The results of rainfall prediction system model agree with those generated by non-stationary multivariate model. The longer the lead time is, the larger the root mean square error becomes and the further the model efficiency decreases form 1. Thus, the accuracy of the rainfall prediction decreases as the lead time gets longer. Also it shows that the mean obtained by storm counter method constitutes the most significant part of the rainfall structure.

  • PDF

Improvement of the Linear Predictive Coding with Windowed Autocorrelation (윈도우가 적용된 자기상관에 의한 선형예측부호의 개선)

  • Lee, Chang-Young;Lee, Chai-Bong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.2
    • /
    • pp.186-192
    • /
    • 2011
  • In this paper, we propose a new procedure for improvement of the linear predictive coding. To reduce the error power incurred by the coding, we interchanged the order of the two procedures of windowing on the signal and linear prediction. This scheme corresponds to LPC extraction with windowed autocorrelation. The proposed method requires more calculational time because it necessitates matrix inversion on more parameters than the conventional technique where an efficient Levinson-Durbin recursive procedure is applicable with smaller parameters. Experimental test over various speech phonemes showed, however, that our procedure yields about 5 % less power distortion compared to the conventional technique. Consequently, the proposed method in this paper is thought to be preferable to the conventional technique as far as the fidelity is concerned. In a separate study of speaker-dependent speech recognition test for 50 isolated words pronounced by 40 people, our approach yielded better performance too.

Estimating the Regularizing Parameters for Belief Propagation Based Stereo Matching Algorithm (Belief Propagation 기반 스테레오 정합을 위한 정합 파라미터의 추정방식 제안)

  • Oh, Kwang-Hee;Lim, Sun-Young;Hahn, Hee-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.1
    • /
    • pp.112-119
    • /
    • 2010
  • This paper defines the probability models for determining the disparity map given stereo images and derives the methods for solving the problem, which is proven to be equivalent to an energy-based stereo matching. Under the assumptions the difference between the pixel on the left image and the corresponding pixel on the right image and the difference between the disparities of the neighboring pixels are exponentially distributed, a recursive approach for estimating the MRF regularizing parameter is proposed. Usually energy-based stereo matching methods are so sensitive to the parameter that it should be carefully determined. The proposed method alternates between estimating the parameter with the intermediate disparity map and estimating the disparity map with the estimated parameter, after computing it with random initial parameter. It is shown that the parameter estimated by the proposed method converges to the optimum and its performance can be improved significantly by adjusting the parameter and modifying the energy term.