IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v344-345y2019ip219-229.html
   My bibliography  Save this article

Computing melodic templates in oral music traditions

Author

Listed:
  • Bereg, Sergey
  • Díaz-Báñez, José-Miguel
  • Kroher, Nadine
  • Ventura, Inmaculada

Abstract

The term melodic template or skeleton refers to a basic melody which is subject to variation during a music performance. In many oral music traditions, these templates are implicitly passed throughout generations without ever being formalized in a score. In this work, we introduce a new geometric optimization problem, the spanning tube problem, to approximate a melodic template for a set of labeled performance transcriptions corresponding to a specific style in oral music traditions. Given a set of n piecewise linear functions, we solve the problem of finding a continuous function, f*, and a minimum value, ε*, such that, the vertical segment of length 2ε* centered at (x, f*(x)) intersects at least p functions (p ≤ n). The method explored here also provide a novel tool for quantitatively assess the amount of melodic variation which occurs across performances.

Suggested Citation

  • Bereg, Sergey & Díaz-Báñez, José-Miguel & Kroher, Nadine & Ventura, Inmaculada, 2019. "Computing melodic templates in oral music traditions," Applied Mathematics and Computation, Elsevier, vol. 344, pages 219-229.
    • Handle: RePEc:eee:apmaco:v:344-345:y:2019:i::p:219-229
    DOI: 10.1016/j.amc.2018.09.071
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Valian, Ehsan & Tavakoli, Saeed & Mohanna, Shahram, 2014. "An intelligent global harmony search approach to continuous optimization problems," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 670-684.
    2. Diaz-Banez, J. M. & Mesa, J. A., 2001. "Fitting rectilinear polygonal curves to a set of points in the plane," European Journal of Operational Research, Elsevier, vol. 130(1), pages 214-222, April.
    3. Barba, L. & Caraballo, L.E. & Díaz-Báñez, J.M. & Fabila-Monroy, R. & Pérez-Castillo, E., 2016. "Asymmetric polygons with maximum area," European Journal of Operational Research, Elsevier, vol. 248(3), pages 1123-1131.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Caraballo, L.E. & Díaz-Báñez, J.M. & Rodríguez, F. & Sánchez-Canales, V. & Ventura, I., 2022. "Scaling and compressing melodies using geometric similarity measures," Applied Mathematics and Computation, Elsevier, vol. 426(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ronald Becker & Isabella Lari & Andrea Scozzari & Giovanni Storchi, 2007. "The location of median paths on grid graphs," Annals of Operations Research, Springer, vol. 150(1), pages 65-78, March.
    2. Amaya, Ivan & Cruz, Jorge & Correa, Rodrigo, 2015. "Harmony Search algorithm: a variant with Self-regulated Fretwidth," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 1127-1152.
    3. J. M. Díaz-Báñez, 2017. "Mathematics and Flamenco: An Unexpected Partnership," The Mathematical Intelligencer, Springer, vol. 39(3), pages 27-39, September.
    4. Po-Chou Shih & Chui-Yu Chiu & Chi-Hsun Chou, 2019. "Using Dynamic Adjusting NGHS-ANN for Predicting the Recidivism Rate of Commuted Prisoners," Mathematics, MDPI, vol. 7(12), pages 1-25, December.
    5. Diaz-Banez, J. M. & Mesa, J. A. & Schobel, A., 2004. "Continuous location of dimensional structures," European Journal of Operational Research, Elsevier, vol. 152(1), pages 22-44, January.
    6. Caraballo, L.E. & Díaz-Báñez, J.M. & Rodríguez, F. & Sánchez-Canales, V. & Ventura, I., 2022. "Scaling and compressing melodies using geometric similarity measures," Applied Mathematics and Computation, Elsevier, vol. 426(C).
    7. Ploussard, Quentin, 2024. "Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation," European Journal of Operational Research, Elsevier, vol. 315(1), pages 50-62.
    8. Hu, Gang & Du, Bo & Li, Huinan & Wang, Xupeng, 2022. "Quadratic interpolation boosted black widow spider-inspired optimization algorithm with wavelet mutation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 200(C), pages 428-467.
    9. Khoroshiltseva, Marina & Slanzi, Debora & Poli, Irene, 2016. "A Pareto-based multi-objective optimization algorithm to design energy-efficient shading devices," Applied Energy, Elsevier, vol. 184(C), pages 1400-1410.

    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:344-345:y:2019:i::p:219-229. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.