Justin sent me the followinga while ago and I am just getting back to civilization:
I thought that you and the readers of your blog may be interested in a new software implementation that we've recently put online (designed for sparse recovery in the presence of nonnegativity and simultaneous sparsity constraints).
The software can be downloaded from:
The algorithms we've implemented are described in our recent paper:
D. Kim, J. P. Haldar. Greedy Algorithms for Nonnegativity-Constrained Simultaneous Sparse Recovery. Signal Processing 2016. In Press.
Signal and Image Processing Institute
Electrical Engineering and Biomedical Engineering
This work proposes a family of greedy algorithms to jointly reconstruct a set of vectors that are (i) nonnegative and (ii) simultaneously sparse with a shared support set. The proposed algorithms generalize previous approaches that were designed to impose these constraints individually. Similar to previous greedy algorithms for sparse recovery, the proposed algorithms iteratively identify promising support indices. In contrast to previous approaches, the support index selection procedure has been adapted to prioritize indices that are consistent with both the nonnegativity and shared support constraints. Empirical results demonstrate for the first time that the combined use of simultaneous sparsity and nonnegativity constraints can substantially improve recovery performance relative to existing greedy algorithms that impose less signal structure.
Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in Compressive Sensing or the Matrix Factorization Jungle and join the conversations on compressive sensing, advanced matrix factorization and calibration issues on Linkedin.