2013 IEEE International Conference on Acoustics, Speech and Signal Processing 2013
DOI: 10.1109/icassp.2013.6637644
|View full text |Cite
|
Sign up to set email alerts
|

Convex non-negative matrix factorization for automatic music structure identification

Abstract: We propose a novel and fast approach to discover structure in western popular music by using a specific type of matrix factorization that adds a convex constrain to obtain a decomposition that can be interpreted as a set of weighted cluster centroids. We show that these centroids capture the different sections of a musical piece (e.g. verse, chorus) in a more consistent and efficient way than classic non-negative matrix factorization. This technique is capable of identifying the boundaries of the sections and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(19 citation statements)
references
References 10 publications
0
19
0
Order By: Relevance
“…There are principally two trends for the detection of homogeneous segments. The first one consists in locating zones of specific texture within similarity matrices using image filtering or matrix decomposition methods [35], [22], [36]. The second approach aims at detecting homogeneous portions of the sequence of feature vectors using multi-level classification processes, relying on variations of clustering, or on Hidden Markov Models (HMM) [3], [37], [38].…”
Section: B Segment Detection Criteriamentioning
confidence: 99%
“…There are principally two trends for the detection of homogeneous segments. The first one consists in locating zones of specific texture within similarity matrices using image filtering or matrix decomposition methods [35], [22], [36]. The second approach aims at detecting homogeneous portions of the sequence of feature vectors using multi-level classification processes, relying on variations of clustering, or on Hidden Markov Models (HMM) [3], [37], [38].…”
Section: B Segment Detection Criteriamentioning
confidence: 99%
“…To analyze the performance of algorithms on our folk music dataset, we gathered several publicly available implementation scenarios of segmentation algorithms: Segmentino [27], MSAF-Foote [4], MSAF-SCluster [16], MSAF-SF [13], MSAF-CNMF3 [11], and MSAF-SI-PLCA [28]. All except Segmentino are available within the Music Structure Analysis Framework (MSAF) and they were tested with three different feature types: MFCCs, HPCP chromagrams, and tonal centroid features, Tonnetz.…”
Section: Evaluating the State Of The Artmentioning
confidence: 99%
“…In [9], the authors use NMF to search for acoustically similar frames in selfsimilarity matrices, while in [10] the authors use NMF for searching repeating patterns in beat-synchronous chromagrams. A novel adapted matrix factorization technique was presented by the authors in [11], who use convex constraints in the factorization process to decompose the similarity matrix in a way that individual centroids can be interpreted as different sections of musical piece. A graph based musical structure analysis method is presented in [12], where a graph is constructed from a sparse representation of feature vectors.…”
Section: Introductionmentioning
confidence: 99%
“…Segments of consistent metrical structure are expected to correspond to homogeneous regions in the metergram so that segmentation may be retrieved by detection of homogeneity [10]. NMF has previously been used for homogeneity-based segmentation [11,12,13,14]. Here we present a variant of sparse-NMF which we compare to existing NMF methods as well as a popular novelty-based approach [15] to perform segmentation.…”
Section: Introductionmentioning
confidence: 99%