recursive b-spline approximation using the kalman filter

Clicks: 249
ID: 233064
2017
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #270 of 430 articles by views in International journal of molecular sciences

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 430 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
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.
Reference Key
jauch2017engineeringrecursive Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Jens Jauch;Felix Bleimund;Stephan Rhode;Frank Gauterin
Journal International journal of molecular sciences
Year 2017
DOI
10.1016/j.jestch.2016.09.015
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.