On the Fundamental Limits of Recovering Tree Sparse Vectors from Noisy Linear Measurements

06/18/2013
by   Akshay Soni, et al.
0

Recent breakthrough results in compressive sensing (CS) have established that many high dimensional signals can be accurately recovered from a relatively small number of non-adaptive linear observations, provided that the signals possess a sparse representation in some basis. Subsequent efforts have shown that the performance of CS can be improved by exploiting additional structure in the locations of the nonzero signal coefficients during inference, or by utilizing some form of data-dependent adaptive measurement focusing during the sensing process. To our knowledge, our own previous work was the first to establish the potential benefits that can be achieved when fusing the notions of adaptive sensing and structured sparsity -- that work examined the task of support recovery from noisy linear measurements, and established that an adaptive sensing strategy specifically tailored to signals that are tree-sparse can significantly outperform adaptive and non-adaptive sensing strategies that are agnostic to the underlying structure. In this work we establish fundamental performance limits for the task of support recovery of tree-sparse signals from noisy measurements, in settings where measurements may be obtained either non-adaptively (using a randomized Gaussian measurement strategy motivated by initial CS investigations) or by any adaptive sensing strategy. Our main results here imply that the adaptive tree sensing procedure analyzed in our previous work is nearly optimal, in the sense that no other sensing and estimation strategy can perform fundamentally better for identifying the support of tree-sparse signals.

READ FULL TEXT
research
11/29/2011

Efficient Adaptive Compressive Sensing Using Sparse Hierarchical Learned Dictionaries

Recent breakthrough results in compressed sensing (CS) have established ...
research
12/10/2019

An Adaptive Bayesian Framework for Recovery of Sources with Structured Sparsity

In oversampled adaptive sensing (OAS), noisy measurements are collected ...
research
01/29/2010

Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation

Adaptive sampling results in dramatic improvements in the recovery of sp...
research
11/01/2010

From Sparse Signals to Sparse Residuals for Robust Sensing

One of the key challenges in sensor networks is the extraction of inform...
research
02/05/2010

Manifold-Based Signal Recovery and Parameter Estimation from Compressive Measurements

A field known as Compressive Sensing (CS) has recently emerged to help a...
research
04/01/2019

Tree Search Network for Sparse Regression

We consider the classical sparse regression problem of recovering a spar...
research
03/03/2011

Sparse Volterra and Polynomial Regression Models: Recoverability and Estimation

Volterra and polynomial regression models play a major role in nonlinear...

Please sign up or login with your details

Forgot password? Click here to reset