Skip to main content

Fast Polynomial Spline Approximation for Large Scattered Data Sets via L 1 Minimization

  • Conference paper
Geometric Science of Information (GSI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 8085))

Included in the following conference series:

Abstract

In this article, we adress the problem of approximating scattered data points by C 1-smooth polynomial spline curves using L 1-norm optimization. The use of this norm helps us to preserve the shape of the data even near to abrupt changes. We introduced a five-point sliding window process for L 1 spline approximation but this method can be still time consuming despite its linear complexity. Consequently, based on new algebraic results obtained for L 1 approximation on any three points, we define in this article a more efficient method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lavery, J.E.: Univariate cubic L p splines and shape-preserving, multiscale interpolation by univariate cubic L 1 splines. Comput. Aided Geom. Design 17, 319–336 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Lavery, J.E.: Shape-preserving, multiscale fitting of univariate data by cubic L 1 smoothing splines. Comput. Aided Geom. Design 17, 715–727 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Lavery, J.E., Cheng, H., Fang, S.-C.: Shape-preserving properties of univariate cubic L 1 splines. J. of Comp. and Applied Mathematics 174, 361–382 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Lavery, J.E.: Shape-preserving univariate cubic and higher-degree L 1 splines with function-value-based and multistep minimization principles. Comput. Aided Geom. Design 26, 1–16 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chiu, N.-C., Fang, S.-C., Lavery, J.E., Lin, J.-Y., Wang, Y.: Approximating term structure of interest rates using cubic L 1 splines. European Journal of Operational Research 184, 990–1004 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Nyiri, É., Gibaru, O.: Auquiert Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties. Comput. Aided Geom. Design 28(1), 65–74 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gajny, L., Nyiri, É., Gibaru, O.: L 1 C 1 polynomial spline approximation algorithms for large scattered data sets (submitted in January 2013)

    Google Scholar 

  8. Auquiert, P.: Interpolation de points par des splines L 1 régulières. Phd Thesis (2007), Université de Valenciennes et du Hainaut-Cambrésis, LAMAV

    Google Scholar 

  9. Vanderbei, R.J.: Affine-scaling for linear programs with free variables. Math. Program. 43, 31–44 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gajny, L., Nyiri, É., Gibaru, O. (2013). Fast Polynomial Spline Approximation for Large Scattered Data Sets via L 1 Minimization. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2013. Lecture Notes in Computer Science, vol 8085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40020-9_91

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40020-9_91

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40019-3

  • Online ISBN: 978-3-642-40020-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics