Adaptive Sensing with Structured Sparsity

نویسندگان

  • Nikhil Rao
  • Gongguo Tang
  • Robert Nowak
چکیده

Adaptive sensing strategies have been proven to outperform traditional (non adaptive) compressed sensing, in terms of the signal to noise ratios that can be handled, and/or the number of measurements needed to accurately recover a signal of interest. Most existing adaptive sensing schemes for sparse signals, while work well in practice, do not take into account potential structure present in the sparsity pattern of the signal. In this paper, we focus on the Markov tree structure inherent in the wavelet coefficients of signals, and propose an adaptive sampling technique to recover the same. We adopt a simple “follow the scent” strategy, and show that it outperforms traditional non adaptive techniques in practice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structured Sparsity: Discrete and Convex approaches

Compressive sensing (CS) exploits sparsity to recover sparse or compressible signals from dimensionality reducing, non-adaptive sensing mechanisms. Sparsity is also used to enhance interpretability in machine learning and statistics applications: While the ambient dimension is vast in modern data analysis problems, the relevant information therein typically resides in a much lower dimensional s...

متن کامل

Block-Based Compressive Sensing Using Soft Thresholding of Adaptive Transform Coefficients

Compressive sampling (CS) is a new technique for simultaneous sampling and compression of signals in which the sampling rate can be very small under certain conditions. Due to the limited number of samples, image reconstruction based on CS samples is a challenging task. Most of the existing CS image reconstruction methods have a high computational complexity as they are applied on the entire im...

متن کامل

Motion-Adaptive Spatio-Temporal Regularization (MASTeR) for Accelerated Dynamic MRI

Accelerated MRI techniques reduce signal acquisition time by undersampling k-space. A fundamental problem in accelerated MRI is the recovery of quality images from undersampled k-space data. Current state-of-the-art recovery algorithms exploit the spatial and temporal structures in underlying images to improve the reconstruction quality. In recent years, compressed sensing theory has helped for...

متن کامل

Fast Algorithms for Structured Sparsity

Sparsity has become an important tool in many mathematical sciences such as statistics, machine learning, and signal processing. While sparsity is a good model for data in many applications, data often has additional structure that goes beyond the notion of “standard” sparsity. In many cases, we can represent this additional information in a structured sparsity model. Recent research has shown ...

متن کامل

Compressed sensing with structured sparsity and structured acquisition

Compressed Sensing (CS) is an appealing framework for applications such as Magnetic Resonance Imaging (MRI). However, up-to-date, the sensing schemes suggested by CS theories are made of random isolated measurements, which are usually incompatible with the physics of acquisition. To reflect the physical constraints of the imaging device, we introduce the notion of blocks of measurements: the se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013