2017
DOI: 10.1016/j.jestch.2016.09.015
|View full text |Cite
|
Sign up to set email alerts
|

Recursive B-spline approximation using the Kalman filter

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(15 citation statements)
references
References 16 publications
0
15
0
Order By: Relevance
“…This combination was determined from trajectory optimization experiments. In data approximation experiments for RBA and NRBA performed in [5,19], the equivalent to R −1 a is ten and two times, respectively, larger and the equivalent to R −1 j is 1000 and 200 times, respectively, larger. This is because in these experiments the goal is to smooth jumps of an amplitude of ten in the data set.…”
Section: Trajectory Optimizationmentioning
confidence: 93%
See 4 more Smart Citations
“…This combination was determined from trajectory optimization experiments. In data approximation experiments for RBA and NRBA performed in [5,19], the equivalent to R −1 a is ten and two times, respectively, larger and the equivalent to R −1 j is 1000 and 200 times, respectively, larger. This is because in these experiments the goal is to smooth jumps of an amplitude of ten in the data set.…”
Section: Trajectory Optimizationmentioning
confidence: 93%
“…In [19] we presented a method denoted recursive B-spline approximation (RBA) that iteratively adapts the coefficients of a B-spline function such that the function approximates data in the weighted least squares (WLS) sense. In [5] we proposed an analogous algorithm called nonlinear recursive B-spline approximation (NRBA) for nonlinear weighted least squares (NWLS) approximation problems.…”
Section: Contributionmentioning
confidence: 99%
See 3 more Smart Citations