Cooperative greedy pursuit strategies for sparse signal representation by partitioning


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

Publication DOI:
Divisions: College of Engineering & Physical Sciences > Systems analytics research institute (SARI)
Additional Information: © 2016, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Uncontrolled Keywords: cooperation greedy pursuit strategies,sparse representation of music signals by partitioning,trigonometric dictionaries,Electrical and Electronic Engineering,Control and Systems Engineering,Software,Signal Processing,Computer Vision and Pattern Recognition
Publication ISSN: 1872-7557
Last Modified: 01 May 2024 07:11
Date Deposited: 18 Feb 2016 12:50
Full Text Link:
Related URLs: http://www.scop ... tnerID=8YFLogxK (Scopus URL)
https://www.sci ... 058X?via%3Dihub (Publisher URL)
PURE Output Type: Article
Published Date: 2016-08
Published Online Date: 2016-02-16
Accepted Date: 2016-02-05
Submitted Date: 2015-05-03
Authors: Rebollo-Neira, Laura (ORCID Profile 0000-0002-7420-8977)

Export / Share Citation


Additional statistics for this record