\(L_1C^1\) polynomial spline approximation algorithms for large data sets (Q478198)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6376434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(L_1C^1\) polynomial spline approximation algorithms for large data sets |
scientific article; zbMATH DE number 6376434 |
Statements
\(L_1C^1\) polynomial spline approximation algorithms for large data sets (English)
0 references
3 December 2014
0 references
The authors propose a new strategy of \( L_1 \) approximation. The main idea is to minimize a shape functional based on the second derivative in an a priori fixed neighborhood of the data set. This functional enables to control locally the deviation between the data set and the resulting curve contrary to \( L_1 \) smoothing splines or \( L_1 \) spline fits. They introduce a new approximating strategy to create an iterative local \( L_1C^1 \) spline approximation extending to the bicubic spline approximation over \( 3D \) data grids and using this result for the image cases. Rich literature and some conclusion and supporting examples are provided at the end of the paper.
0 references
\(L_1\) spline
0 references
smooth spline
0 references
noisy data
0 references
bicubic spline approximation
0 references
0 references
0 references
0 references
0 references
0 references
0.8662328720092773
0 references
0.80519700050354
0 references
0.8033079504966736
0 references
0.8026441335678101
0 references
