Number of the records: 1  

Improvements of Continuous Model for Memory-based Automatic Music Transcription

  1. 1.
    SYSNO ASEP0347257
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleImprovements of Continuous Model for Memory-based Automatic Music Transcription
    Author(s) Albrecht, Š. (CZ)
    Šmídl, Václav (UTIA-B) RID, ORCID
    Source TitleProceedings of the 18th European signal processing conference. - Aalborg : Eurasip, 2010 - ISSN 2076-1465
    Pagess. 487-491
    Number of pages5 s.
    Publication formwww - www
    ActionEuropean signal processing conference
    Event date23.07.2010-27.07.2010
    VEvent locationAalborg
    CountryDK - Denmark
    Event typeWRD
    Languageeng - English
    CountryDK - Denmark
    Keywordsmusic transcription ; extended Kalman filter
    Subject RIVBD - Theory of Information
    R&D ProjectsGP102/08/P250 GA ČR - Czech Science Foundation (CSF)
    CEZAV0Z10750506 - UTIA-B (2005-2011)
    AnnotationAutomatic music transcription is a process recovering the most likely combination of sounds that produced the recorded audio signal. We are concerned with memory-based approach, where the observed signal is modeled as a superposition of sounds from a library. Moreover, we assume that only parts of the sounds can be played. The number of possible combinations is excessive and exact estimation is computationally prohibitive. We propose to transform the original discrete-event model into a less restricted parametrization and impose the constraints in a soft way via prior information. The resulting model is a non-linear state-space model with Gaussian disturbances. The posterior estimates are evaluated by the extended Kalman filter. Performance of the model is studied in simulation and it is shown that it outperforms previously published methods.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2011
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.