English
Related papers

Related papers: An algebraic perspective on integer sparse recover…

200 papers

Compressive Sensing (CS) stipulates that a sparse signal can be recovered from a small number of linear measurements, and that this recovery can be performed efficiently in polynomial time. The framework of model-based compressive sensing…

Information Theory · Computer Science 2015-04-22 Chinmay Hegde , Piotr Indyk , Ludwig Schmidt

Our aim of this article is to reconstruct a signal from undersampled data in the situation that the signal is sparse in terms of a tight frame. We present a condition, which is independent of the coherence of the tight frame, to guarantee…

Numerical Analysis · Mathematics 2011-05-24 Song Li , Junhong Lin

Compressive Sensing (CS) theory asserts that sparse signal reconstruction is possible from a small number of linear measurements. Although CS enables low-cost linear sampling, it requires non-linear and costly reconstruction. Recent…

Machine Learning · Computer Science 2018-10-16 Aysen Degerli , Sinem Aslan , Mehmet Yamac , Bulent Sankur , Moncef Gabbouj

Limitations on bandwidth and power consumption impose strict bounds on data rates of diagnostic imaging systems. Consequently, the design of suitable (i.e. task- and data-aware) compression and reconstruction techniques has attracted…

Image and Video Processing · Electrical Eng. & Systems 2021-01-26 Iris A. M. Huijben , Bastiaan S. Veeling , Kees Janse , Massimo Mischi , Ruud J. G. van Sloun

We have developed an approximate signal recovery algorithm with low computational cost for compressed sensing on the basis of randomly constructed sparse measurement matrices. The law of large numbers and the central limit theorem suggest…

Information Theory · Computer Science 2011-02-21 Yoshiyuki Kabashima , Tadashi Wadayama

We propose to reduce the original well-posed problem of compressive sensing to weighted-MAX-SAT. Compressive sensing is a novel randomized data acquisition approach that linearly samples sparse or compressible signals at a rate much below…

Information Theory · Computer Science 2019-05-28 Ramin Ayanzadeh , Milton Halem , Tim Finin

This paper develops new theory and algorithms to recover signals that are approximately sparse in some general dictionary (i.e., a basis, frame, or over-/incomplete matrix) but corrupted by a combination of interference having a sparse…

Information Theory · Computer Science 2013-09-06 Christoph Studer , Richard G. Baraniuk

Most of compressed sensing (CS) theory to date is focused on incoherent sensing, that is, columns from the sensing matrix are highly uncorrelated. However, sensing systems with naturally occurring correlations arise in many applications,…

Information Theory · Computer Science 2017-08-29 Tobias Birnbaum , Yonina C. Eldar , Deanna Needell

We consider the problem of reconstructing time sequences of spatially sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear "incoherent" measurements, in real-time. The signals are sparse in some…

Information Theory · Computer Science 2016-11-17 Namrata Vaswani

Reconstructing continuous signals from a small number of discrete samples is a fundamental problem across science and engineering. In practice, we are often interested in signals with 'simple' Fourier structure, such as bandlimited,…

Data Structures and Algorithms · Computer Science 2018-12-24 Haim Avron , Michael Kapralov , Cameron Musco , Christopher Musco , Ameya Velingker , Amir Zandieh

In this paper, we consider the problem of sparse signal detection based on partial support set estimation with compressive measurements in a distributed network. Multiple nodes in the network are assumed to observe sparse signals which…

Applications · Statistics 2016-08-10 Thakshila Wimalajeewa , Pramod K. Varshney

We consider compressed sampling over finite fields and investigate the number of compressed measurements needed for successful L0 recovery. Our results are obtained while the sparseness of the sensing matrices as well as the size of the…

Information Theory · Computer Science 2012-11-26 Jin-Taek Seong , Heung-No Lee

We consider a multi-hop wireless sensor network that measures sparse events and propose a simple forwarding protocol based on Compressed Sensing (CS) which does not need any sophisticated Media Access Control (MAC) scheduling, neither a…

Other Computer Science · Computer Science 2012-08-08 Megumi Kaneko , Khaldoun Al Agha

This paper introduces a novel framework and corresponding methods for sampling and reconstruction of sparse signals in shift-invariant (SI) spaces. We reinterpret the random demodulator, a system that acquires sparse bandlimited signals, as…

Signal Processing · Electrical Eng. & Systems 2022-01-24 Tin Vlašić , Damir Seršić

In compressed sensing, it is often desirable to consider signals possessing additional structure beyond sparsity. One such structured signal model - which forms the focus of this paper - is the local sparsity in levels class. This class has…

Information Theory · Computer Science 2017-06-05 Chen Li , Ben Adcock

The goal of compressed sensing is to estimate a vector from an underdetermined system of noisy linear measurements, by making use of prior knowledge on the structure of vectors in the relevant domain. For almost all results in this…

Machine Learning · Statistics 2017-03-10 Ashish Bora , Ajil Jalal , Eric Price , Alexandros G. Dimakis

Compressive Sensing (CS) is a new technique for the efficient acquisition of signals, images, and other data that have a sparse representation in some basis, frame, or dictionary. By sparse we mean that the N-dimensional basis…

Information Theory · Computer Science 2015-05-18 Chinmay Hegde , Richard G. Baraniuk

Conventional compressed sensing theory assumes signals have sparse representations in a known, finite dictionary. Nevertheless, in many practical applications such as direction-of-arrival (DOA) estimation and line spectral estimation, the…

Information Theory · Computer Science 2014-12-19 Jun Fang , Huiping Duan , Jing Li , Hongbin Li , Rick S. Blum

Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for the acquisition of sparse or compressible signals that can be well approximated by just K << N elements from an N-dimensional basis. Instead of taking periodic…

Information Theory · Computer Science 2016-11-17 Richard G. Baraniuk , Volkan Cevher , Marco F. Duarte , Chinmay Hegde

Compressed sensing is an image reconstruction technique to achieve high-quality results from limited amount of data. In order to achieve this, it utilizes prior knowledge about the samples that shall be reconstructed. Focusing on image…