POINT PROCESS MCMC FOR SEQUENTIAL MUSIC TRANSCRIPTION
Particle Filtering for High Dimensional Problems
Presented by: Pete Bunch, Author(s): Pete Bunch, Simon J. Godsill, University of Cambridge, United Kingdom
In this paper, models and algorithms are presented for transcription of pitch and timings in polyphonic music extracts, focusing on the algorithm details of the sequential Markov chain Monte Carlo (MCMC) inference techniques used. The data are decomposed frame-wise into the frequency domain, where a Poisson point process model is used to write a polyphonic pitch likelihood function. A dynamical model is then used to link notes between frames. Inference in the model is carried out via Bayesian filtering using a sequential MCMC algorithm. The filtering procedure is sub-optimal, using some novel assumptions to render the task computationally tractable for large numbers of notes. Initial results with guitar music, both laboratory test data and commercial extracts, show promising performance.
Slides
- POINT PROCESS MCMC FOR SEQUENTIAL MUSIC TRANSCRIPTION [PDF], 0.43 MB
Lecture Information
| Recorded: | 2011-05-26 17:35 - 17:55, Club D |
|---|---|
| Added: | 22. 6. 2011 04:45 |
| Number of views: | 19 |
| Video resolution: | 1024x576 px, 512x288 px |
| Video length: | 0:17:58 |
| Audio track: | MP3 [6.06 MB], 0:17:58 |
Related Lectures
0:21:50
PARTICLE FLOW FOR NONLINEAR FILTERS
Particle Filtering for High Dimensional Problems
Added: 18. 6. 2011 23:52
0:21:57
PARTICLE ALGORITHMS FOR FILTERING IN HIGH DIMENSIONAL STATE SPACES: A CASE STUDY IN GROUP OBJECT TRACKING
Particle Filtering for High Dimensional Problems
Added: 19. 6. 2011 00:33
Comments