Nadine Kroher

Nadine Kroher

Auto-generated profile, based on publicly available information

Nadine Kroher

Department of Applied Mathematics II, University of Seville, Seville, Spain

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 November 2017 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
NKNadine Kroher
Nadine Kroher
APAggelos Pikrakis
Aggelos Pikrakis
JDJosé Miguel Díaz-Báñez
José Miguel Díaz-Báñez
In music, repetition is a fundamental concept to establish structure and create temporal relationships. Previous approaches on detecting repetition in music recordings have mainly focused on discovering repeated patterns of variable length and instrumentation at arbitrary locations. In this paper, we present 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. At a first stage, a segmentation algorithm partitions automatically generated note-level transcriptions of the singing melody into sections which correspond to the structural unit of a phrase. A clustering algorithm is then used to form clusters of phrases, where each cluster contains instances of the same melodic content. The clustering algorithm operates on the basis of a distance measure between melodic sequences and, to this end, various melodic distance measures are investigated. A detailed evaluation procedure is used to assess the performance of the algorithm on three different European music traditions and the influence of transcription and segmentation errors is investigated. The proposed system is shown to outperform the state-of-the-art in audio-based approaches to repeated phrase discovery for this task.

1 December 2017 in Computer Music Journal
Verified
Journal Article
Closed access
PDF file
NKNadine Kroher
Nadine Kroher
JDJosé Miguel Díaz-Báñez
José Miguel Díaz-Báñez
Melody categorization refers to the task of grouping a set of melodies into categories of similar items that originate from the same melodic contour. From a computational perspective, automatic melody categorization is of crucial importance for the automatic organization of databases, as well as for large-scale musicological studies—in particular, in the context of folk music and non-Western music traditions. We investigate methods starting from the raw audio file. For each recording contained in a collection, we extract a pitch sequence representing the main melodic line. We then estimate pairwise similarities and evaluate the discriminative power of the resulting similarity matrix with respect to ground-truth annotations. We propose novel evaluation methodologies, compare melody representations, and explore the potential of our approach in the context of two applications: interstyle and intrastyle categorization of flamenco music and tune-family recognition of folk-song recordings.

4 May 2019 in Journal of Mathematics and Music
Verified
Journal Article
Closed access
NKNadine Kroher
Nadine Kroher
JDJosé-Miguel Díaz-Báñez
José-Miguel Díaz-Báñez
A key concept in flamenco singing is the constant re-interpretation of orally transmitted melodic templates, which undergo variation and ornamentation during spontaneous performances. We propose a novel framework which allows us to model a set of interpretations of the same melody and analyse differences among them. We apply a multiple progressive sequence alignment technique to obtain a graphical model holding the frequency of occurrence of characteristic notes and note transitions, from which the underlying melodic template can be approximated. In a case study, we showcase how visualisations of the derived model yield insights into local and global melodic stability and inter-style contour similarities. We furthermore show how the extracted templates can used to identify instances of a particular melody in a large corpus of automatic transcriptions.

26 October 2018 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
SBSergey Bereg
Sergey Bereg
JDJosé Miguel Díaz-Báñez
José Miguel Díaz-Báñez
NKNadine Kroher
Nadine Kroher
IVInmaculada Ventura
Inmaculada Ventura

25 January 2018 in arXiv
Verified
Preprint
Open access
PDF file
LCLuis-Evaristo Caraballo
Luis-Evaristo Caraballo
JDJosé Miguel Díaz-Báñez
José Miguel Díaz-Báñez
NKNadine Kroher
Nadine Kroher
The objective of clustering is to discover natural groups in datasets and to identify geometrical structures which might reside there, without assuming any prior knowledge on the characteristics of the data. The problem can be seen as detecting the inherent separations between groups of a given point set in a metric space governed by a similarity function. The pairwise similarities between all data objects form a weighted graph adjacency matrix which contains all necessary information for the clustering process, which can consequently be formulated as a graph partitioning problem. In this context, we propose a new cluster quality measure which uses the maximum spanning tree and allows us to compute the optimal clustering under the min-max principle in polynomial time. Our algorithm can be applied when a load-balanced clustering is required.