Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6893999 | Engineering Science and Technology, an International Journal | 2017 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jens Jauch, Felix Bleimund, Stephan Rhode, Frank Gauterin,