Sparse Bayesian regularization using Bernoulli-Laplacian priors

Lotfi Chaari, Jean-Yves Tourneret, Hadj Batatia

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

Sparse regularization has been receiving an increasing interest in the literature. Two main difficulties are encountered when performing sparse regularization. The first one is how to fix the parameters involved in the regularization algorithm. The second one is to optimize the inherent cost function that is generally non differentiable, and may also be non-convex if one uses for instance an ℓ0 penalization. In this paper, we handle these two problems jointly and propose a novel algorithm for sparse Bayesian regularization. An interesting property of this algorithm is the possibility of estimating the regularization parameters from the data. Simulation performed with 1D and 2D restoration problems show the very promising potential of the proposed approach. An application to the reconstruction of electroencephalographic signals is finally investigated.

Original languageEnglish
Title of host publication21st European Signal Processing Conference (EUSIPCO 2013)
PublisherIEEE
ISBN (Electronic)9780992862602
Publication statusPublished - 8 May 2014
Event21st European Signal Processing Conference 2013 - Morocco, Marrakech, Morocco
Duration: 9 Sep 201313 Sep 2013

Publication series

NameEuropean Signal Processing Conference
ISSN (Print)2219-5491
ISSN (Electronic)2076-1465

Conference

Conference21st European Signal Processing Conference 2013
Abbreviated titleEUSIPCO 2013
CountryMorocco
CityMarrakech
Period9/09/1313/09/13

Keywords

  • MCMC methods
  • parameter estimation
  • Sparse Bayesian restoration

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Sparse Bayesian regularization using Bernoulli-Laplacian priors'. Together they form a unique fingerprint.

Cite this