KIT | KIT-Bibliothek | Impressum | Datenschutz
Open Access Logo
§
Verlagsausgabe
DOI: 10.5445/IR/1000077430
Veröffentlicht am 11.12.2017
Originalveröffentlichung
DOI: 10.1016/j.jestch.2016.09.015
Scopus
Zitationen: 4

Recursive B-spline approximation using the Kalman filter

Jauch, Jens; Bleimund, Felix; Rhode, Stephan; Gauterin, Frank

Abstract:
This paper proposes a novel recursive B-spline approximation (RBA) algorithm which approximates an unbounded number of data points with a B-spline function and achieves lower computational effort compared with previous algorithms. Conventional recursive algorithms based on the Kalman filter (KF) restrict the approximation to a bounded and predefined interval. Conversely RBA includes a novel shift operation that enables to shift estimated B-spline coefficients in the state vector of a KF. This allows to adapt the interval in which the B-spline function can approximate data points during run-time.


Zugehörige Institution(en) am KIT Institut für Fahrzeugsystemtechnik (FAST)
Publikationstyp Zeitschriftenaufsatz
Jahr 2017
Sprache Englisch
Identifikator ISSN: 2215-0986
URN: urn:nbn:de:swb:90-774307
KITopen ID: 1000077430
Erschienen in Engineering science and technology
Band 20
Heft 1
Seiten 28-34
Vorab online veröffentlicht am 28.11.2016
Schlagworte Recursive, B-spline, Approximation, Kalman filter, Shift, Online
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft KITopen Landing Page