Skip to Main content Skip to Navigation
Conference papers

Democratic prior for anti-sparse coding

Abstract : Anti-sparse coding aims at spreading the information uniformly over representation coefficients and can be naturally expressed through an ℓ∞-norm regularization. This paper derives a probabilistic formulation of such a problem. A new probability distribution is introduced. This so-called democratic distribution is then used as a prior to promote anti-sparsity in a linear Gaussian inverse problem. A Gibbs sampler is designed to generate samples asymptotically distributed according to the joint posterior distribution of interest. To scale to higher dimension, a proximal Markov chain Monte Carlo algorithm is proposed as an alternative to Gibbs sampling. Simulations on synthetic data illustrate the performance of the proposed method for anti-sparse coding on a complete dictionary. Results are compared with the recent deterministic variational FITRA algorithm.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) Connect in order to contact the contributor
Submitted on : Monday, April 3, 2017 - 1:14:00 PM
Last modification on : Wednesday, November 3, 2021 - 6:51:32 AM
Long-term archiving on: : Tuesday, July 4, 2017 - 12:44:57 PM


Files produced by the author(s)


  • HAL Id : hal-01433632, version 2
  • OATAO : 17064


Clément Elvira, Pierre Chainais, Nicolas Dobigeon. Democratic prior for anti-sparse coding. IEEE Workshop on statistical signal processing (SSP 2016), Jun 2016, Palma de Mallorca, Spain. pp. 1-5. ⟨hal-01433632v2⟩



Record views


Files downloads