Structured sparsity using backwards elimination for Automatic Music Transcription

Musical signals can be thought of as being sparse and structured, with few elements active at a given instant and temporal continuity of active elements observed. Greedy algorithms such as Orthogonal Matching Pursuit (OMP), and structured variants, have previously been proposed for Automatic Music T...

Full description

Saved in:
Bibliographic Details
Main Authors: Keriven, Nicolas, O'Hanlon, Ken, Plumbley, Mark D.
Format: Conference Proceeding
Language:English
Subjects:
backwards elimination
Cost function
Dictionaries
group sparsity
Matching pursuit algorithms
music transcription
Sparse matrices
Spectrogram
structured sparsity
Transforms
Vectors
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Musical signals can be thought of as being sparse and structured, with few elements active at a given instant and temporal continuity of active elements observed. Greedy algorithms such as Orthogonal Matching Pursuit (OMP), and structured variants, have previously been proposed for Automatic Music Transcription (AMT), however some problems have been noted. Hence, we propose the use of a backwards elimination strategy in order to perform sparse decompositions for AMT, in particular with a proposed alternative sparse cost function. However, the main advantage of this approach is the ease with which structure can be incorporated. The use of group sparsity is shown to give increased AMT performance, while a molecular method incorporating onset information is seen to provide further improvements with little computational effort.
ISSN:1551-2541
2378-928X
DOI:10.1109/MLSP.2013.6661917