IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v45y2013i12p1263-1277.html
   My bibliography  Save this article

Adaptive B-spline knot selection using multi-resolution basis set

Author

Listed:
  • Yuan Yuan
  • Nan Chen
  • Shiyu Zhou

Abstract

B-splines are commonly used to fit complicated functions in Computer Aided Design and signal processing because they are simple yet flexible. However, how to place the knots appropriately in B-spline curve fitting remains a difficult problems. This article discusses a two-stage knot placement method to place knots adapting to the curvature structures of unknown function. In the first stage, a subset of basis functions is selected from the pre-specified multi-resolution basis set using a statistical variable selection method: Lasso. In the second stage, a vector space that is spanned by the selected basis functions is constructed and a concise knot vector is identified that is sufficient to characterize the vector space to fit the unknown function. The effectiveness of the proposed method is demonstrated using numerical studies on multiple representative functions.

Suggested Citation

  • Yuan Yuan & Nan Chen & Shiyu Zhou, 2013. "Adaptive B-spline knot selection using multi-resolution basis set," IISE Transactions, Taylor & Francis Journals, vol. 45(12), pages 1263-1277.
  • Handle: RePEc:taf:uiiexx:v:45:y:2013:i:12:p:1263-1277
    DOI: 10.1080/0740817X.2012.726758
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2012.726758
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2012.726758?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kovács, Péter & Fekete, Andrea M., 2019. "Nonlinear least-squares spline fitting with variable knots," Applied Mathematics and Computation, Elsevier, vol. 354(C), pages 490-501.
    2. Gálvez, Akemi & Iglesias, Andrés, 2016. "Particle-based meta-model for continuous breakpoint optimization in smooth local-support curve fitting," Applied Mathematics and Computation, Elsevier, vol. 275(C), pages 195-212.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:uiiexx:v:45:y:2013:i:12:p:1263-1277. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.