2017
DOI: 10.1016/j.automatica.2017.07.055
|View full text |Cite
|
Sign up to set email alerts
|

A nonparametric kernel-based approach to Hammerstein system identification

Abstract: In this paper, we propose a novel algorithm for the identification of Hammerstein systems. Adopting a Bayesian approach, we model the impulse response of the unknown linear dynamic system as a realization of a zero-mean Gaussian process. The covariance matrix (or kernel) of this process is given by the recently introduced stable-spline kernel, which encodes information on the stability and regularity of the impulse response. The static nonlinearity of the model is identified using an Empirical Bayes approach-t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
30
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
2
1

Relationship

3
6

Authors

Journals

citations
Cited by 47 publications
(31 citation statements)
references
References 46 publications
1
30
0
Order By: Relevance
“…The concept of exact decomposition will be made clear throughout the paper. We also demonstrate strong connections with our recently proposed method [25], effectively proving that, although the two approaches are inherently different, the estimates obtained with the two methods are equivalent. Finally, we show, through several numerical experiments, that the proposed method outperforms both the algorithm proposed in [2] and the standard matlab system identification toolbox function for Hammerstein system identification.…”
Section: Introductionsupporting
confidence: 55%
“…The concept of exact decomposition will be made clear throughout the paper. We also demonstrate strong connections with our recently proposed method [25], effectively proving that, although the two approaches are inherently different, the estimates obtained with the two methods are equivalent. Finally, we show, through several numerical experiments, that the proposed method outperforms both the algorithm proposed in [2] and the standard matlab system identification toolbox function for Hammerstein system identification.…”
Section: Introductionsupporting
confidence: 55%
“…Consider the complete-data likelihood (39). From (32) we have that log q w = E log p(y, v, g, w; τ ) , where the expectation is taken with respect to q g .…”
Section: A3 Proof Of Theoremmentioning
confidence: 99%
“…In order to employ EMtype algorithms, one has to define a latent variable; in our problem, a natural choice is s 11 . Then, a (local) solution to (22) is achieved by iterating over the following steps: (E-step) Given an estimateη (k) (computed at the k-th iteration of the algorithm), compute…”
Section: Computation Of the Solution Of The Marginal Likelihood Cmentioning
confidence: 99%
“…The effectiveness of the proposed method is demonstrated through numerical experiment. The method proposed in this paper is close in spirit to some recently proposed kernelbased techniques for blind system identification [21] and Hammerstein system identification [22].…”
Section: Introductionmentioning
confidence: 99%