While on Reddit, one of the reader ( Convex Optimization in Julia ) mentioned that he had done some implementations of some compressive sensing reconstruction solvers in Julia. He made those available on his GitHub:
From the page:
CompressedSensing
This package contains several useful algorithms for compressed sensing, multiple measurement vectors, and sparse blind source separation.
Available Algorithms
SMV - Single Measurement Vectors
- IRLS - Equality constrained Iteratively Rewieghted Least Squares Lp Minimization 1
- UIRLS - Unconstrained Iteratively Reweighted Lease Squares Lp Minimization 1
MMV - Multiple Measurement Vectors
- ZAP - Zeropoint Attractor 2
BSS - Sparse Blind Source Separation
- nGMCA - Sparse non-negative Blind Source Separation 3
Quantifying Sparsity
Documentation can be found at readthedocs here
- GI - Absolute Gini Index 4
- Coherence - Measuring the coherence of a measurement matrix by the definitions commonly used 5
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.
No comments:
Post a Comment