Compressed Sensing for Block-Sparse Smooth Signals

09/10/2013
by   Shahzad Gishkori, et al.
0

We present reconstruction algorithms for smooth signals with block sparsity from their compressed measurements. We tackle the issue of varying group size via group-sparse least absolute shrinkage selection operator (LASSO) as well as via latent group LASSO regularizations. We achieve smoothness in the signal via fusion. We develop low-complexity solvers for our proposed formulations through the alternating direction method of multipliers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2015

Compressed Sensing of Multi-Channel EEG Signals: The Simultaneous Cosparsity and Low Rank Optimization

Goal: This paper deals with the problems that some EEG signals have no g...
research
07/17/2022

The Variable Projected Augmented Lagrangian Method

Inference by means of mathematical modeling from a collection of observa...
research
07/22/2020

Autonomous Tracking and State Estimation with Generalised Group Lasso

We address the problem of autonomous tracking and state estimation for m...
research
02/07/2022

Detecting Structural Breaks in Foreign Exchange Markets by using the group LASSO technique

This article proposes an estimation method to detect breakpoints for lin...
research
12/05/2015

Hierarchical Sparse Modeling: A Choice of Two Group Lasso Formulations

Demanding sparsity in estimated models has become a routine practice in ...
research
03/18/2022

Convolutional Simultaneous Sparse Approximation with Applications to RGB-NIR Image Fusion

Simultaneous sparse approximation (SSA) seeks to represent a set of depe...
research
02/07/2020

Jointly Sparse Signal Recovery via Deep Auto-Encoder and Parallel Coordinate Descent Unrolling

In this paper, utilizing techniques in compressed sensing, parallel opti...

Please sign up or login with your details

Forgot password? Click here to reset