2015
DOI: 10.1016/j.ifacol.2015.09.066
|View full text |Cite
|
Sign up to set email alerts
|

Identification of Equation Error Models from Small Samples using Compressed Sensing Techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
5
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
3

Relationship

3
6

Authors

Journals

citations
Cited by 14 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…(2) During-Estimation: This class of methods tries to estimate the model structure along with model parameters. The core idea is to utilize regularization or sparsity constraints in compressed sensing techniques for model structure determination (Perepu and Tangirala, 2015).…”
Section: Introductionmentioning
confidence: 99%
“…(2) During-Estimation: This class of methods tries to estimate the model structure along with model parameters. The core idea is to utilize regularization or sparsity constraints in compressed sensing techniques for model structure determination (Perepu and Tangirala, 2015).…”
Section: Introductionmentioning
confidence: 99%
“…(2) During-Estimation: This class of methods tries to estimate the model structure along with model parameters. The core idea is to utilize regularization or sparsity constraints in compressed sensing techniques for model structure determination (Perepu and Tangirala, 2015). (3) Post-Estimation: In these approaches, a certain model structure is assumed, and its correctness is checked after estimation.…”
Section: Introductionmentioning
confidence: 99%
“…Over the last few years considerable progress has been made in the precise reconstruction of the zero and nonzero elements in an unknown sparse parameter vector of a stochastic dynamics system based on its input and output observations, for example, the compressed sensing (CS) based identification methods [29] [34] and the corresponding adaptive/online algorithms [10] [20] [23], the variable selection algorithms [12] [22] [38], etc. The basic idea of CS theory is to obtain a sparsest estimate of the parameter vector by minimizing the L 0 norm, i.e., the number of nonzero elements, with L 2 constraints [7] [14].…”
Section: Introductionmentioning
confidence: 99%
“…the dynamics of systems, in [29] [34] [37] the CS method is applied to the parameter estimation of linear systems and in [10] [20] [23] the adaptive algorithms such as least mean square (LMS), Kalman filtering (KF), Expectation Maximization (EM), and projection operator are introduced. The variable selection problem aims to find the true but unknown contributing variables of a system among many alternative ones.…”
Section: Introductionmentioning
confidence: 99%