
handle: 11693/12922
In most compressive sensing problems, @?"1 norm is used during the signal reconstruction process. In this article, a modified version of the entropy functional is proposed to approximate the @?"1 norm. The proposed modified version of the entropy functional is continuous, differentiable and convex. Therefore, it is possible to construct globally convergent iterative algorithms using Bregman@?s row-action method for compressive sensing applications. Simulation examples with both 1D signals and images are presented.
Compressive Sensing, Modified Entropy Functional, Iterative row-action methods, Proximal splitting, Bregman-projection Proximal Splitting, Projection Onto Convex Sets, Iterative Row-action Methods, Bregman-projection, Projection onto convex sets, Modified entropy functional
Compressive Sensing, Modified Entropy Functional, Iterative row-action methods, Proximal splitting, Bregman-projection Proximal Splitting, Projection Onto Convex Sets, Iterative Row-action Methods, Bregman-projection, Projection onto convex sets, Modified entropy functional
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 13 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
