Computing melodic templates in oral music traditions
@article{Bereg2019ComputingMT, title={Computing melodic templates in oral music traditions}, author={Sergey Bereg and Jos{\'e} Miguel D{\'i}az-B{\'a}{\~n}ez and Nadine Kroher and Inmaculada Ventura}, journal={ArXiv}, year={2019}, volume={abs/2209.13598} }
Figures and Tables from this paper
3 Citations
Modelling melodic variation and extracting melodic templates from flamenco singing performances
- Computer ScienceJournal of Mathematics and Music
- 2019
A novel framework which allows us to model a set of interpretations of the same melody and analyse differences among them is proposed, and visualisations of the derived model yield insights into local and global melodic stability and inter-style contour similarities.
Scaling and compressing melodies using geometric similarity measures
- Computer ScienceAppl. Math. Comput.
- 2022
Maths, Computation and Flamenco: Overview and Challenges
- Computer ScienceMCM
- 2019
An overview of the challenges which arise in the context of computational analysis of flamenco music is provided and an overview of existing approaches is outlined.
References
SHOWING 1-10 OF 31 REFERENCES
Discovery of Repeated Melodic Phrases in Folk Singing Recordings
- Computer ScienceIEEE Transactions on Multimedia
- 2018
A novel method for the discovery of repeated sung phrases in folk music recordings and, in particular, in oral music traditions, where written scores are usually unavailable is presented.
Classification of Melodic Motifs in Raga Music with Time-series Matching
- Computer Science
- 2014
In this work, machine learning methods are used on labelled databases of Hindustani and Carnatic vocal audio concerts to obtain phrase classification on manually segmented audio using Dynamic time warping and HMM based classification on time series of detected pitch values used for the melodic representation of a phrase.
Melodic Contour and Mid-Level Global Features Applied to the Analysis of Flamenco Cantes
- Computer ScienceArXiv
- 2015
This work uses a state-of-the-art automatic transcription method to account for general melodic similarity from music recordings and defines a specific set of representative mid-level melodic features, which are manually labelled by flamenco experts to create a global similarity measure.
Algorithmic Composition: Paradigms of Automated Music Generation
- Computer Science
- 2008
This is the first book to provide a detailed overview of prominent procedures of algorithmic composition in a pragmatic way rather than by treating formalizable aspects in single works.
Automatic Transcription of Flamenco Singing From Polyphonic Music Recordings
- Computer ScienceIEEE/ACM Transactions on Audio, Speech, and Language Processing
- 2016
This study first extracts the predominant melody and applies a novel contour filtering process to eliminate segments of the pitch contour which originate from the guitar accompaniment, and formulates a set of onset detection functions based on volume and pitch characteristics to segment the resulting vocal pitch contours into discrete note events.
A Computational Approach to Content-Based Retrieval of Folk Song Melodies
- Biology
- 2010
Computational methods have a rich potential for the study of music; not as a replacement of ‘traditional’ methods, but as an extension of the research methods that are available to the musicologist.
The Melodic Structure of Jiangnan Sizhu
- Education
- 1985
T he structure of Chinese melody is one of the most imperfectly understood aspects of world music theory. Traditional Chinese music theorists, whose writings were actually more a rationalization of…
Using transportation distances for measuring melodic similarity
- Computer ScienceISMIR
- 2003
By using weighted point sets and the EMD/PTD instead of Howard’s method (1998) using the DARMS encoding for determining melodic similarity, it is possible to group together about twice as many known occurrences of a melody within the RISM A/II collection.
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem
- Computer ScienceISMIR
- 2004
It is shown that the music pattern matching problem is at least as hard as a basic problem called 3-SUM that is conjectured to have no subquadratic algorithm, and an algorithm is given with running time O(nm log m), where n is the size of the score and m is thesize of the pattern.