Nonlinear least-squares spline fitting with variable knots
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 $\ell_p\;(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.
Code (0)
등록된 구현이 없습니다.
Tasks
Time SeriesTime Series AnalysisSimilar Papers 제목 키워드 기반
Persistence B-Spline Grids: Stable Vector Representation of Persistence Diagrams Based on Data Fitting
Many attempts have been made in recent decades to integrate machine learning (ML) and topological data analysis. A prominent problem in applying persistent homology to ML tasks is finding a vector representation of a per…
Topological Data AnalysisAutomatic Knot Adjustment Using Dolphin Echolocation Algorithm for B-Spline Curve Approximation
In this paper, a new approach to solve the cubic B-spline curve fitting problem is presented based on a meta-heuristic algorithm called " dolphin echolocation ". The method minimizes the proximity error value of the sele…
End-to-end Lane Detection through Differentiable Least-Squares Fitting
Lane detection is typically tackled with a two-step pipeline in which a segmentation mask of the lane markings is predicted first, and a lane line model (like a parabola or spline) is fitted to the post-processed mask ne…
Lane DetectionA Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares
We propose a Randomised Subspace Gauss-Newton (R-SGN) algorithm for solving nonlinear least-squares optimization problems, that uses a sketched Jacobian of the residual in the variable domain and solves a reduced linear …
regressionGeneralized Kernel Regularized Least Squares
Kernel Regularized Least Squares (KRLS) is a popular method for flexibly estimating models that may have complex relationships between variables. However, its usefulness to many researchers is limited for two reasons. Fi…