Nonlinear least-squares spline fitting with variable knots

From MaRDI portal
Publication:2011125

DOI10.1016/J.AMC.2019.02.051zbMATH Open1429.65130arXiv2003.03847OpenAlexW2921746322WikidataQ128228600 ScholiaQ128228600MaRDI QIDQ2011125FDOQ2011125

Andrea M. Fekete, Péter Kovács

Publication date: 28 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Abstract: In this paper, we present a nonlinear least-squares fitting algorithm using B-splines with free knots. Since its performance strongly depends on the initial estimation of the free parameters (i.e. the knots), we also propose a fast and efficient knot-prediction algorithm that utilizes numerical properties of first-order B-splines. Using ellp;(p=1,2,infty) norm solutions, we also provide three different strategies for properly selecting the free knots. Our initial predictions are then iteratively refined by means of a gradient-based variable projection optimization. Our method is general in nature and can be used to estimate the optimal number of knots in cases in which no a-priori information is available. To evaluate the performance of our method, we approximated a one-dimensional discrete time series and conducted an extensive comparative study using both synthetic and real-world data. We chose the problem of electrocardiogram (ECG) signal compression as a real-world case study. Our experiments on the well-known PhysioNet MIT-BIH Arrhythmia database show that the proposed method outperforms other knot-prediction techniques in terms of accuracy while requiring much lower computational complexity.


Full work available at URL: https://arxiv.org/abs/2003.03847





Cites Work


Cited In (7)

Uses Software






This page was built for publication: Nonlinear least-squares spline fitting with variable knots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011125)