Recovery of binary sparse signals from compressed linear measurements via polynomial optimization

05/30/2019
by   Sophie M. Fosson, et al.
0

The recovery of signals with finite-valued components from few linear measurements is a problem with widespread applications and interesting mathematical characteristics. In the compressed sensing framework, tailored methods have been recently proposed to deal with the case of finite-valued sparse signals. In this work, we focus on binary sparse signals and we propose a novel formulation, based on polynomial optimization. This approach is analyzed and compared to the state-of-the-art binary compressed sensing methods.

READ FULL TEXT

page 8

page 9

page 10

page 11

research
05/11/2021

On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel

Motivated by applications in unsourced random access, this paper develop...
research
06/26/2021

Stochastic Parameterization using Compressed Sensing: Application to the Lorenz-96 Atmospheric Model

Growing set of optimization and regression techniques, based upon sparse...
research
09/14/2013

Optimized projections for compressed sensing via rank-constrained nearest correlation matrix

Optimizing the acquisition matrix is useful for compressed sensing of si...
research
12/16/2013

Optimization for Compressed Sensing: the Simplex Method and Kronecker Sparsification

In this paper we present two new approaches to efficiently solve large-s...
research
02/24/2016

A Compressed Sensing Based Decomposition of Electrodermal Activity Signals

The measurement and analysis of Electrodermal Activity (EDA) offers appl...
research
04/06/2021

Hierarchical compressed sensing

Compressed sensing is a paradigm within signal processing that provides ...
research
10/08/2021

A Framework for Private Communication with Secret Block Structure

Harnessing a block-sparse prior to recover signals through underdetermin...

Please sign up or login with your details

Forgot password? Click here to reset