Least squares-based iterative identification methods for linear-in-parameters systems using the decomposition technique

By extending the least squares-based iterative (LSI) method, this paper presents a decomposition-based LSI (D-LSI) algorithm for identifying linear-in-parameters systems and an interval-varying D-LSI algorithm for handling the identification problems of missing-data systems. The basic idea is to apply the hierarchical identification principle to decompose the original system into two fictitious sub-systems and then to derive new iterative algorithms to estimate the parameters of each sub-system. Compared with the LSI algorithm and the interval-varying LSI algorithm, the decomposition-based iterative algorithms have less computational load. The numerical simulation results demonstrate that the proposed algorithms work quite well

Recursive State-Space Identification of Non-Uniformly Sampled-Data Systems Using QR Decomposition

A recursive least-squares (LS) state-space identification method based on the QR decomposition is proposed for non-uniformly sampled-data systems. Both cases of measuring all states and only the output(s) are considered for model identification. For the case of state measurement, a QR decomposition-based recursive LS (QRD-RLS) identification algorithm is given to estimate the state matrices. For the case of only output measurement, another identification algorithm is developed by combining the QRD-RLS approach with a hierarchical identification strategy. Both algorithms can guarantee fast convergence rate with low computation complexity. An illustrative example is shown to demonstrate the effectiveness of the proposed methods

Least Squares Based and Two-Stage Least Squares Based Iterative Estimation Algorithms for H-FIR-MA Systems

This paper studies the identification of Hammerstein finite impulse response moving average (H-FIR-MA for short) systems. A new two-stage least squares iterative algorithm is developed to identify the parameters of the H-FIR-MA systems. The simulation cases indicate the efficiency of the proposed algorithms

Data filtering-based least squares iterative algorithm for Hammerstein nonlinear systems by using the model decomposition

This paper focuses on the iterative identification problems for a class of Hammerstein nonlinear systems. By decomposing the system into two fictitious subsystems, a decomposition-based least squares iterative algorithm is presented for estimating the parameter vector in each subsystem. Moreover, a data filtering-based decomposition least squares iterative algorithm is proposed. The simulation results indicate that the data filtering-based least squares iterative algorithm can generate more accurate parameter estimates than the least squares iterative algorithm

Two Identification Methods for Dual-Rate Sampled-Data Nonlinear Output-Error Systems

This paper presents two methods for dual-rate sampled-data nonlinear output-error systems. One method is the missing output estimation based stochastic gradient identification algorithm and the other method is the auxiliary model based stochastic gradient identification algorithm. Different from the polynomial transformation based identification methods, the two methods in this paper can estimate the unknown parameters directly. A numerical example is provided to confirm the effectiveness of the proposed methods

Combined state and parameter estimation for Hammerstein systems with time-delay using the Kalman filtering

This paper discusses the state and parameter estimation problem for a class of Hammerstein state space systems with time-delay. Both the process noise and the measurement noise are considered in the system. Based on the observable canonical state space form and the key term separation, a pseudo-linear regressive identification model is obtained. For the unknown states in the information vector, the Kalman filter is used to search for the optimal state estimates. A Kalman-filter based least squares iterative and a recursive least squares algorithms are proposed. Extending the information vector to include the latest information terms which are missed for the time-delay, the Kalman-filter based recursive extended least squares algorithm is derived to obtain the estimates of the unknown time-delay, parameters and states. The numerical simulation results are given to illustrate the effectiveness of the proposed algorithms

Parameter and State Estimator for State Space Models

This paper proposes a parameter and state estimator for canonical state space systems from measured input-output data. The key is to solve the system state from the state equation and to substitute it into the output equation, eliminating the state variables, and the resulting equation contains only the system inputs and outputs, and to derive a least squares parameter identification algorithm. Furthermore, the system states are computed from the estimated parameters and the input-output data. Convergence analysis using the martingale convergence theorem indicates that the parameter estimates converge to their true values. Finally, an illustrative example is provided to show that the proposed algorithm is effective

Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches

Imaging spectrometers measure electromagnetic energy scattered in their instantaneous field view in hundreds or thousands of spectral channels with higher spectral resolution than multispectral cameras. Imaging spectrometers are therefore often referred to as hyperspectral cameras (HSCs). Higher spectral resolution enables material identification via spectroscopic analysis, which facilitates countless applications that require identifying materials in scenarios unsuitable for classical spectroscopic analysis. Due to low spatial resolution of HSCs, microscopic material mixing, and multiple scattering, spectra measured by HSCs are mixtures of spectra of materials in a scene. Thus, accurate estimation requires unmixing. Pixels are assumed to be mixtures of a few materials, called endmembers. Unmixing involves estimating all or some of: the number of endmembers, their spectral signatures, and their abundances at each pixel. Unmixing is a challenging, ill-posed inverse problem because of model inaccuracies, observation noise, environmental conditions, endmember variability, and data set size. Researchers have devised and investigated many models searching for robust, stable, tractable, and accurate unmixing algorithms. This paper presents an overview of unmixing methods from the time of Keshava and Mustard's unmixing tutorial [1] to the present. Mixing models are first discussed. Signal-subspace, geometrical, statistical, sparsity-based, and spatial-contextual unmixing algorithms are described. Mathematical problems and potential solutions are described. Algorithm characteristics are illustrated experimentally.Comment: This work has been accepted for publication in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensin

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

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

A unified wavelet-based modelling framework for non-linear system identification: the WANARX model structure

A new unified modelling framework based on the superposition of additive submodels, functional components, and wavelet decompositions is proposed for non-linear system identification. A non-linear model, which is often represented using a multivariate non-linear function, is initially decomposed into a number of functional components via the wellknown analysis of variance (ANOVA) expression, which can be viewed as a special form of the NARX (non-linear autoregressive with exogenous inputs) model for representing dynamic input–output systems. By expanding each functional component using wavelet decompositions including the regular lattice frame decomposition, wavelet series and multiresolution wavelet decompositions, the multivariate non-linear model can then be converted into a linear-in-theparameters problem, which can be solved using least-squares type methods. An efficient model structure determination approach based upon a forward orthogonal least squares (OLS) algorithm, which involves a stepwise orthogonalization of the regressors and a forward selection of the relevant model terms based on the error reduction ratio (ERR), is employed to solve the linear-in-the-parameters problem in the present study. The new modelling structure is referred to as a wavelet-based ANOVA decomposition of the NARX model or simply WANARX model, and can be applied to represent high-order and high dimensional non-linear systems