ICR: Iterative Convex Refinement for Sparse Signal Recovery Using Spike and Slab Priors

Abstract

In this letter, we address sparse signal recovery using spike and slab priors. In particular, we focus on a Bayesian framework where sparsity is enforced on reconstruction coefficients via probabilistic priors. The optimization resulting from spike and slab prior maximization is known to be a hard non-convex problem, and existing solutions involve simplifying assumptions and/or relaxations. We propose an approach called Iterative Convex Refinement (ICR) that aims to solve the aforementioned optimization problem directly allowing for greater generality in the sparse structure. Essentially, ICR solves a sequence of convex optimization problems such that sequence of solutions converges to a sub-optimal solution of the original hard optimization problem. We propose two versions of our algorithm: a.) an unconstrained version, and b.) with a non-negativity constraint on sparse coefficients, which may be required in some real-world problems. Experimental validation is performed on both synthetic data and for a real-world image recovery problem, which illustrates merits of ICR over state of the art alternatives.

arXiv commentSubmitted to IEEE Signal Processing Letters, Feb 2015

References in corpus (12)

• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• A fast approach for overcomplete sparse decomposition based on smoothed L0 norm
• Spike and slab variable selection: Frequentist and Bayesian strategies
• On the adaptive elastic-net with a diverging number of parameters
• NESTA: A Fast and Accurate First-order Method for Sparse Recovery
• C-HiLasso: A Collaborative Hierarchical Sparse Modeling Framework
• A Majorize-Minimize subspace approach for l2-l0 image regularization
• Hierarchical Bayesian sparse image reconstruction with application to MRFM
• DFDL: Discriminative Feature-oriented Dictionary Learning for Histopathological Image Classification
• A majorization-minimization approach to variable selection using spike and slab priors
• Asymptotic Analysis of LASSOs Solution Path with Implications for Approximate Message Passing
• Quality-based Multimodal Classification Using Tree-Structured Sparsity

Cited by in corpus (4)

• Fast Low-rank Shared Dictionary Learning for Image Classification
• Sparsity-based Color Image Super Resolution via Exploiting Cross Channel Constraints
• Robust Sonar ATR Through Bayesian Pose Corrected Sparse Classification
• Adaptive Algorithm for Sparse Signal Recovery