Group Sparsity with Overlapping Partition Functions - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Group Sparsity with Overlapping Partition Functions


This paper introduces a novel and versatile group sparsity prior for denoising and to regularize inverse problems. The sparsity is enforced through arbitrary block-localization operators, such as for instance smooth localized partition functions. The resulting blocks can have an arbitrary overlap, which is important to reduce visual artifacts thanks to the increased translation invariance of the prior. They are moreover not necessarily binary, and allow for non-integer block sizes. We develop two schemes, one primal and another primal-dual, originating from the non-smooth convex optimization realm, to efficiently solve a wide class of inverse problems regularized using this overlapping group sparsity prior. This scheme is flexible enough to handle both penalized and constrained versions of the optimization problems at hand. Numerical results on denoising and compressed sensing are reported and show the improvement brought by the overlap and the smooth partition functions with respect to classical group sparsity.
Fichier principal
Vignette du fichier
PeyreFadili-Eusipco11-Overlap.pdf (116.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00597771 , version 1 (01-06-2011)


  • HAL Id : hal-00597771 , version 1


Gabriel Peyré, Jalal M. Fadili. Group Sparsity with Overlapping Partition Functions. EUSIPCO 2011, Aug 2011, Barcelona, Spain. pp.303-307. ⟨hal-00597771⟩
338 View
775 Download


Gmail Facebook X LinkedIn More