TV-Normed Pursuit is a new sparse recovery paradigm where efficient total-variation (TV) constrained algorithms from combinatorial and convex optimization interface for interpretable signal reconstruction. The algorithm is presented in “Hard thresholding with norm constraints”, Technical Report, by Anastasios Kyrillidis, Gilles Puy and, Volkan Cevher.
In this wiki page, we provide information about TV-Normed Pursuit algorithm and present experiments on real image data. We illustrate that TV-Normed Pursuit can significantly enhance the performance of both combinatorial methods and convex solvers in total-variation (TV) constrained sparse recovery.
The MATLAB code and paper can be found at: