Short and Squeezed: Accelerating the Computation of Antisparse Representations with Safe Squeezing

Antisparse coding aims at spreading the information uniformly over representation coefficients and can be expressed as the solution of an ℓ
_∞
-norm regularized problem. In this paper, we propose a new methodology, coined "safe squeezing", accelerating the computation of antisparse representations. The idea consists in identifying saturated entries of the solution via simple tests and compacting their contribution to achieve some form of dimensionality reduction. Numerical experiments show that the proposed approach leads to significant computational gain.