IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v57y2019i10p2966-2983.html
   My bibliography  Save this article

Robust profile alignment based on penalised-spline smoothing

Author

Listed:
  • Yangyang Zang
  • Kaibo Wang

Abstract

In quality engineering practice, profiles that are used for quality monitoring or evaluation are sometimes unaligned due to engineering constraints. In such cases, profiles have to be registered (aligned) through shifting, time warping or coordinate alignment such that samples are comparable and easy to handle. Among the different registration algorithms, time warping, or alignment of profiles with unequal lengths, is a challenging task. In quality engineering, a typical phenomenon observed in profile alignment is that neighbours of an aligned pair have a high possibility of being similar, which means that a large jump in a warping path is less likely. In this article, a penalised-spline smoothing method is proposed for profile alignment to handle this problem. The newly proposed nonparametric alignment strategy attempts to capture the smoothness and spatially correlated features of warping shifts, and is proven more robust than existing algorithms. A dynamic programming algorithm is developed to obtain the optimal path. Both simulation studies and a real example demonstrate the effectiveness of the proposed method.

Suggested Citation

  • Yangyang Zang & Kaibo Wang, 2019. "Robust profile alignment based on penalised-spline smoothing," International Journal of Production Research, Taylor & Francis Journals, vol. 57(10), pages 2966-2983, May.
  • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:10:p:2966-2983
    DOI: 10.1080/00207543.2018.1519263
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2018.1519263?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.

    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:tprsxx:v:57:y:2019:i:10:p:2966-2983. 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/TPRS20 .

    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.