IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v356y2019icp42-49.html
   My bibliography  Save this article

Two curve Chebyshev approximation and its application to signal clustering

Author

Listed:
  • Sukhorukova, N.

Abstract

In this paper, we extend a number of important results of the classical Chebyshev approximation theory to the case of simultaneous approximation of two or more functions. The need for this extension is application driven, since such kind of problems appears in the area of curve (signal) clustering. In this paper, we propose a new efficient algorithm for signal clustering and develop a procedure that allows one to reuse the results obtained at the previous iteration without recomputing the cluster centres from scratch. This approach is based on the extension of the classical de la Vallée-Poussin procedure originally developed for polynomial approximation. We also develop necessary and sufficient optimality conditions for two curve Chebyshev approximation, which is our core tool for curve clustering. These results are based on application of nonsmooth convex analysis.

Suggested Citation

  • Sukhorukova, N., 2019. "Two curve Chebyshev approximation and its application to signal clustering," Applied Mathematics and Computation, Elsevier, vol. 356(C), pages 42-49.
    • Handle: RePEc:eee:apmaco:v:356:y:2019:i:c:p:42-49
    DOI: 10.1016/j.amc.2019.03.021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630031930222X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.03.021?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.

    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:eee:apmaco:v:356:y:2019:i:c:p:42-49. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.