SAGI: Sparsification Algorithm using Greedy Iteration
2005 (English)In: Signal Processing with Adaptive Sparse Structured Representations, Rennes, 2005, 16-8 p.Conference paper (Refereed)
We introduce a method, called SAGI (Sparsification Algo- rithm using Greedy Iteration), for making a representation of a signal more sparse in an over-complete dictionary in a greedy manner. The sparsification is achieved by iteratively increasing the magnitude of the largest signal coefficient and simultaneously reducing the other signal coefficients so as to maximize the sparsity of the representation while main- taining invariant the reconstruction of the signal from the coefficients. Any measure of sparsity can be used with the method. Two versions are presented. The first, the one-pass version, considers each coefficient once in order from largest to smallest. The second, the exhaustive version, only consid- ers the (n + 1)st largest coefficient if iteratively considering the n largest coefficients results in no increase in sparsity.
Place, publisher, year, edition, pages
Rennes, 2005. 16-8 p.
Sparse Signal Processing; Optimization; Blind Source Separation
Research subject Applied and Computational Mathematics
IdentifiersURN: urn:nbn:se:kth:diva-174171OAI: oai:DiVA.org:kth-174171DiVA: diva2:860981
Workshop on Signal Processing with Adaptive Sparse Structured Representations (SPARS'05)
QC 201510152015-10-142015-10-012015-10-15Bibliographically approved