• Title/Summary/Keyword: Least Squares Algorithm

Search Result 564, Processing Time 0.03 seconds

A two-stage and two-step algorithm for the identification of structural damage and unknown excitations: numerical and experimental studies

  • Lei, Ying;Chen, Feng;Zhou, Huan
    • Smart Structures and Systems
    • /
    • v.15 no.1
    • /
    • pp.57-80
    • /
    • 2015
  • Extended Kalman Filter (EKF) has been widely used for structural identification and damage detection. However, conventional EKF approaches require that external excitations are measured. Also, in the conventional EKF, unknown structural parameters are included as an augmented vector in forming the extended state vector. Hence the sizes of extended state vector and state equation are quite large, which suffers from not only large computational effort but also convergence problem for the identification of a large number of unknown parameters. Moreover, such approaches are not suitable for intelligent structural damage detection due to the limited computational power and storage capacities of smart sensors. In this paper, a two-stage and two-step algorithm is proposed for the identification of structural damage as well as unknown external excitations. In stage-one, structural state vector and unknown structural parameters are recursively estimated in a two-step Kalman estimator approach. Then, the unknown external excitations are estimated sequentially by least-squares estimation in stage-two. Therefore, the number of unknown variables to be estimated in each step is reduced and the identification of structural system and unknown excitation are conducted sequentially, which simplify the identification problem and reduces computational efforts significantly. Both numerical simulation examples and lab experimental tests are used to validate the proposed algorithm for the identification of structural damage as well as unknown excitations for structural health monitoring.

Neuro-fuzzy based approach for estimation of concrete compressive strength

  • Xue, Xinhua;Zhou, Hongwei
    • Computers and Concrete
    • /
    • v.21 no.6
    • /
    • pp.697-703
    • /
    • 2018
  • Compressive strength is one of the most important engineering properties of concrete, and testing of the compressive strength of concrete specimens is often costly and time consuming. In order to provide the time for concrete form removal, re-shoring to slab, project scheduling and quality control, it is necessary to predict the concrete strength based upon the early strength data. However, concrete compressive strength is affected by many factors, such as quality of raw materials, water cement ratio, ratio of fine aggregate to coarse aggregate, age of concrete, compaction of concrete, temperature, relative humidity and curing of concrete. The concrete compressive strength is a quite nonlinear function that changes depend on the materials used in the concrete and the time. This paper presents an adaptive neuro-fuzzy inference system (ANFIS) for the prediction of concrete compressive strength. The training of fuzzy system was performed by a hybrid method of gradient descent method and least squares algorithm, and the subtractive clustering algorithm (SCA) was utilized for optimizing the number of fuzzy rules. Experimental data on concrete compressive strength in the literature were used to validate and evaluate the performance of the proposed ANFIS model. Further, predictions from three models (the back propagation neural network model, the statistics model, and the ANFIS model) were compared with the experimental data. The results show that the proposed ANFIS model is a feasible, efficient, and accurate tool for predicting the concrete compressive strength.

Study on Satellite Vibration Control Using Adaptive Algorithm

  • Oh, Choong-Seok;Oh, Se-Boung;Bang, Hyo-Choong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2120-2125
    • /
    • 2005
  • The principal idea of vibration isolation is to filter out the response of the system over the corner frequency. The isolation objectives are to transmit the attitude control torque within the bandwidth of the attitude control system and to filter all the high frequency components coming from vibration equipment above the bandwidth. However, when a reaction wheels or control momentum gyros control spacecraft attitude, vibration inevitably occurs and degrades the performance of sensitive devices. Therefore, vibration should be controlled or isolated for missions such as Earth observing, broadcasting and telecommunication between antenna and ground stations. For space applications, technicians designing controller have to consider a periodic vibration and disturbance to ensure system performance and robustness completing various missions. In general, past research isolating vibration commonly used 6 degree order freedom isolators such as Stewart and Mallock platforms. In this study, the vibration isolation device has 3 degree order freedom, one translational and two rotational motions. The origin of the coordinate is located at the center-of-gravity of the upper plane. In this paper, adaptive notch filter finds the disturbance frequency and the reference signal in filtered-x least mean square is generated by the notch frequency. The design parameters of the notch filter are updated continuously using recursive least square algorithm. Therefore, the adaptive filtered-x least mean square algorithm is applied to the vibration suppressing experiment without reference sensor. This paper shows the experimental results of an active vibration control using an adaptive filtered-x least mean squares algorithm.

  • PDF

A New Input Estimation Algorithm for Target Tracking Problem

  • Lee, Hungu;Tahk, Min-Jea
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1998.10a
    • /
    • pp.323-328
    • /
    • 1998
  • In this paper, a new input estimation algorithm is proposed for target tracking problem. The unknown target maneuver is approximated by a linear combination of independent time functions and the coefficients are estimated by using a weighted least-squares estimation technique. The proposed algorithm is verified by computer simulation of a realistic two-dimensional tracking problem. The proposed algorithm provides significant improvements in estimation performance over the conventional input estimation techniques based on the constant-input assumption.

  • PDF

A License-Plate Image Binarization Algorithm Based on Least Squares Method for License-Plate Recognition of Automobile Black-Box Image (블랙박스 영상용 자동차 번호판 인식을 위한 최소 자승법 기반의 번호판 영상 이진화 알고리즘)

  • Kim, Jin-young;Lim, Jongtae;Heo, Seo Weon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.5
    • /
    • pp.747-753
    • /
    • 2018
  • In the license-plate recognition systems for automobile black Image, the license-plate image frequently has a shadow due to outdoor environments which are frequently changing. Such a shadow makes unpredictable errors in the segmentation process of individual characters and numbers of the license plate image, and reduces the overall recognition rate. In this paper, to improve the recognition rate in these circumstance, a license-plate image binarization algorithm is proposed removing the shadow effectively. The propose algorithm splits the license-plate image into the regions with the shadow and without. To find out the boundary of two regions, the algorithm estimates the curve for shadow boundary using the least-squares method. The simulation is performed for the license-plate image having its shadow, and the results show much higher recognition rate than the previous algorithm.

MSE Convergence Characteristic over Tap Weight Updating of RBRLS Algorithm Filter (RBRLS 알고리즘의 탭 가중치 갱신에 따른 MSE 성능 분석)

  • 김원균;윤찬호;곽종서;나상동
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.11a
    • /
    • pp.248-251
    • /
    • 1999
  • 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 i(oration n upon the arrival of new data. The RLS algorithm may be viewed as a special case of the Kalman filter. Indeed this special relationship between the RLS algorithm and the Kalman filter is considered. 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. The resulting rate of convergence is therefore typically an order of magnitude faster than the simple LMS algorithm. This improvement in performance, however, Is achieved at the expensive of a large increase in computational complexity.

  • PDF

Studies on the Resistivity Inversion -1. Automatic Interpretation of Electrical Resistivity Sounding Data- (비저항반전(比抵抗反轉)에 관한 연구(硏究) (1. 전기비저항수직탐사(電氣比抵抗垂直探査) 데이터의 자동해석(自動解析)))

  • Kim, Hee Joon
    • Economic and Environmental Geology
    • /
    • v.14 no.3
    • /
    • pp.193-201
    • /
    • 1981
  • The problem of automatic inversion of apparent resistivity sounding curves resulting from horizontally layered earth models is solved using the least-squares technique. This method, which makes use of damped least-squares algorithm in conjunction with digital filtering technique, is found to be speedier and more accurate than the conventional curve-matching method. Four sounding curves were chosen to test the inversion scheme. The analysis of the theoretical sounding data associated with a three-layer model illustrates clear advantages over the conventional curve-matching method. The usefulness of the inversion method is also shown when applied to the actual field data. It was found that the best fit earth models coincide with the subsurface structures confirmed by drilling.

  • PDF

Analysis of Dynamic Crack Propagation using MLS Difference Method (MLS 차분법을 이용한 동적균열전파 해석)

  • Yoon, Young-Cheol;Kim, Kyeong-Hwan;Lee, Sang-Ho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.27 no.1
    • /
    • pp.17-26
    • /
    • 2014
  • This paper presents a dynamic crack propagation algorithm based on the Moving Least Squares(MLS) difference method. The derivative approximation for the MLS difference method is derived by Taylor expansion and moving least squares procedure. The method can analyze dynamic crack problems using only node model, which is completely free from the constraint of grid or mesh structure. The dynamic equilibrium equation is integrated by the Newmark method. When a crack propagates, the MLS difference method does not need the reconstruction of mode model at every time step, instead, partial revision of nodal arrangement near the new crack tip is carried out. A crack is modeled by the visibility criterion and dynamic energy release rate is evaluated to decide the onset of crack growth together with the corresponding growth angle. Mode I and mixed mode crack propagation problems are numerically simulated and the accuracy and stability of the proposed algorithm are successfully verified through the comparison with the analytical solutions and the Element-Free Galerkin method results.

A FITTING OF PARABOLAS WITH MINIMIZING THE ORTHOGONAL DISTANCE

  • Kim, Ik-Sung
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.2
    • /
    • pp.669-684
    • /
    • 1999
  • We are interested in the problem of fitting a curve to a set of points in the plane in such a way that the sum of the squares of the orthogonal distances to given data points ins minimized. In[1] the prob-lem of fitting circles and ellipses was considered and numerically solved with general purpose methods. Especially in [2] H. Spath proposed a special purpose algorithm (Spath's ODF) for parabolas y-b=$c($\chi$-a)^2$ and for rotated ones. In this paper we present another parabola fitting algorithm which is slightly different from Spath's ODF. Our algorithm is mainly based on the steepest descent provedure with the view of en-suring the convergence of the corresponding quadratic function Q(u) to a local minimum. Numerical examples are given.

Development of a Characteristic Point Detection Algorithm for the Calculation of Pulse Wave Velocity (맥파전달속도 계산을 위한 특징점 검출 알고리즘 개발)

  • Lee, Lark-Beom;Im, Jae-Joong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.5
    • /
    • pp.902-907
    • /
    • 2008
  • Shape of the pulse waveform is affected by the visco-elasticity characteristics of the arterial wall and the reflection waves generated at the bifurcations of arterial branches. This study was designed to improve the accuracy for the extraction of pulse wave features, then proved the superiority of the developed algorithm by clinical evaluation. Upstroke point of the pulse wave was used as an extraction feature since it is minimally affected by the waveform variation. R-peak of the ECG was used as a reference to decide the minimum level, then intersection of the least squares of regression line was used as an upstroke point. Developed algorithm was compared with the existing minimum value detection algorithm and tangent-intersection algorithm using data obtained from 102 subjects. Developed algorithm showed the least standard deviation of $0.29{\sim}0.44\;m/s$ compared with that of the existing algorithms, $0.91{\sim}3.66\;m/s$. Moreover, the rate of standard deviation of more than 1.00m/s for the PWV values reduced with the range of $29.0{\sim}42.4%$, which proved the superiority of the newly developed algorithm.