1999
DOI: 10.1109/34.761266
|View full text |Cite
|
Sign up to set email alerts
|

Automatic segmentation of acoustic musical signals using hidden Markov models

Abstract: In this paper we address an important step towards our goal of automatic musical accompaniment | the segmentation problem. Given a score to a piece of monophonic music and a sampled recording of a performance of that score, we attempt to segment the data into a sequence of contiguous regions corresponding to the notes and rests in the score. Within the framework of a hidden Markov model, we model our prior knowledge, perform unsupervised learning of the the data model parameters, and compute the segmentation t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
79
0
1

Year Published

2005
2005
2015
2015

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 137 publications
(80 citation statements)
references
References 6 publications
0
79
0
1
Order By: Relevance
“…Most previous studies rely on a prior training of this model, which can be instrumentspecific [10][11][12][13][14] or generic [16,17]. However, these methods requires relevant training data, which are not always available.…”
Section: Relation To Prior Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Most previous studies rely on a prior training of this model, which can be instrumentspecific [10][11][12][13][14] or generic [16,17]. However, these methods requires relevant training data, which are not always available.…”
Section: Relation To Prior Workmentioning
confidence: 99%
“…Some works use a prior learning of the observation model, with statistical [10][11][12] or template-based approaches [13,14]. In the latter approach, a template is built for each symbolic element, as the superposition of single-note templates.…”
Section: Introductionmentioning
confidence: 99%
“…Probabilistic methods were first attempted by Dannenberg (1997, 1998). This work paved the way for the use of Hidden Markov Models (HMM), a stochastic modelling technique, which has emerged as a promising way of implementing score following (Cano et al, 1999;Orio & Dechelle, 2001;Raphael, 1999Raphael, , 2001Orio et al, 2003;Schwarz et al, 2004;Pardo & Birmingham, 2005, Cont & Schwarz 2006b, Macrae & Dixon 2008. Other methods have also been attempted in recent years, such as using belief networks (Raphael, 2000) or graphical models (Raphael, 2004), but Hidden Markov Models are most widely adopted to date.…”
Section: Previous Score Following Researchmentioning
confidence: 99%
“…al. 1998), musical score following (Raphael 1999), and many others. In the HMM, recognition is often accomplished using dynamic programming (DP) to find the mostly likely sequence of hidden states given the observed data.…”
Section: Linear Dynamic Programming For Training In Sequence Estimationmentioning
confidence: 99%