8,050 research outputs found

    Recursive search-based identification algorithms for the exponential autoregressive time series model with coloured noise

    Get PDF
    This study focuses on the recursive parameter estimation problems for the non-linear exponential autoregressive model with moving average noise (the ExpARMA model for short). By means of the gradient search, an extended stochastic gradient (ESG) algorithm is derived. Considering the difficulty of determining the step-size in the ESG algorithm, a numerical approach is proposed to obtain the optimal step-size. In order to improve the parameter estimation accuracy, the authors employ the multi-innovation identification theory to develop a multi-innovation ESG (MI-ESG) algorithm for the ExpARMA model. Introducing a forgetting factor into the MI-ESG algorithm, the parameter estimation accuracy can be further improved. With an appropriate innovation length and forgetting factor, the variant of the MI-ESG algorithm is effective to identify all the unknown parameters of the ExpARMA model. A simulation example is provided to test the proposed algorithms

    Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and Robust Subspace Recovery

    Full text link
    PCA is one of the most widely used dimension reduction techniques. A related easier problem is "subspace learning" or "subspace estimation". Given relatively clean data, both are easily solved via singular value decomposition (SVD). The problem of subspace learning or PCA in the presence of outliers is called robust subspace learning or robust PCA (RPCA). For long data sequences, if one tries to use a single lower dimensional subspace to represent the data, the required subspace dimension may end up being quite large. For such data, a better model is to assume that it lies in a low-dimensional subspace that can change over time, albeit gradually. The problem of tracking such data (and the subspaces) while being robust to outliers is called robust subspace tracking (RST). This article provides a magazine-style overview of the entire field of robust subspace learning and tracking. In particular solutions for three problems are discussed in detail: RPCA via sparse+low-rank matrix decomposition (S+LR), RST via S+LR, and "robust subspace recovery (RSR)". RSR assumes that an entire data vector is either an outlier or an inlier. The S+LR formulation instead assumes that outliers occur on only a few data vector indices and hence are well modeled as sparse corruptions.Comment: To appear, IEEE Signal Processing Magazine, July 201

    Partially coupled gradient estimation algorithm for multivariable equation-error autoregressive moving average systems using the data filtering technique

    Get PDF
    System identification provides many convenient and useful methods for engineering modelling. This study targets the parameter identification problems for multivariable equation-error autoregressive moving average systems. To reduce the influence of the coloured noises on the parameter estimation, the data filtering technique is adopted to filter the input and output data, and to transform the original system into a filtered system with white noises. Then the filtered system is decomposed into several subsystems and a filtering-based partially-coupled generalised extended stochastic gradient algorithm is developed via the coupling concept. In contrast to the multivariable generalised extended stochastic gradient algorithm, the proposed algorithm can give more accurate parameter estimates. Finally, the effectiveness of the proposed algorithm is well demonstrated by simulation examples

    Gradient-based iterative parameter estimation for bilinear-in-parameter systems using the model decomposition technique

    Get PDF
    The parameter estimation issues of a block-oriented non-linear system that is bilinear in the parameters are studied, i.e. the bilinear-in-parameter system. Using the model decomposition technique, the bilinear-in-parameter model is decomposed into two fictitious submodels: one containing the unknown parameters in the non-linear block and the other containing the unknown parameters in the linear dynamic one and the noise model. Then a gradient-based iterative algorithm is proposed to estimate all the unknown parameters by formulating and minimising two criterion functions. The stochastic gradient algorithms are provided for comparison. The simulation results indicate that the proposed iterative algorithm can give higher parameter estimation accuracy than the stochastic gradient algorithms

    Parameter estimation algorithm for multivariable controlled autoregressive autoregressive moving average systems

    Get PDF
    This paper investigates parameter estimation problems for multivariable controlled autoregressive autoregressive moving average (M-CARARMA) systems. In order to improve the performance of the standard multivariable generalized extended stochastic gradient (M-GESG) algorithm, we derive a partially coupled generalized extended stochastic gradient algorithm by using the auxiliary model. In particular, we divide the identification model into several subsystems based on the hierarchical identification principle and estimate the parameters using the coupled relationship between these subsystems. The simulation results show that the new algorithm can give more accurate parameter estimates of the M-CARARMA system than the M-GESG algorithm
    corecore