Cooperative greedy pursuit strategies for sparse signal representation by partitioning

Research output: Contribution to journalArticle

View graph of relations Save citation

Open

Authors

Research units

Abstract

Cooperative Greedy Pursuit Strategies are considered for approximating a signal partition subjected to a global constraint on sparsity. The approach aims at producing a high quality sparse approximation of the whole signal, using highly coherent redundant dictionaries. The cooperation takes place by ranking the partition units for their sequential stepwise approximation, and is realized by means of i)forward steps for the upgrading of an approximation and/or ii) backward steps for the corresponding downgrading. The advantage of the strategy is illustrated by approximation of music signals using redundant trigonometric dictionaries. In addition to rendering stunning improvements in sparsity with respect to the concomitant trigonometric basis, these dictionaries enable a fast implementation of the approach via the Fast Fourier Transform

Documents

  • Cooperative greedy pursuit strategies

    Rights statement: © 2016, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/

    Accepted author manuscript, 777 KB, PDF-document

    License: CC BY-NC-ND Show license

Details

Original languageEnglish
Pages (from-to)365-375
Number of pages11
JournalSignal processing
Volume125
Early online date16 Feb 2016
DOIs
StatePublished - Aug 2016

Keywords

  • cooperation greedy pursuit strategies, sparse representation of music signals by partitioning, trigonometric dictionaries

DOI

Employable Graduates; Exploitable Research

Copy the text from this field...