Square-root algorithms for maximum correntropy estimation of linear discrete-time systems in presence of non-Gaussian noise (Q1678568)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Square-root algorithms for maximum correntropy estimation of linear discrete-time systems in presence of non-Gaussian noise |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Square-root algorithms for maximum correntropy estimation of linear discrete-time systems in presence of non-Gaussian noise |
scientific article |
Statements
Square-root algorithms for maximum correntropy estimation of linear discrete-time systems in presence of non-Gaussian noise (English)
0 references
17 November 2017
0 references
maximum correntropy criterion
0 references
Kalman filter
0 references
square-root filtering
0 references
robust estimation
0 references
0 references
0 references