English
Related papers

Related papers: Unknown sparsity in compressed sensing: Denoising …

200 papers

In this paper, we study the number of measurements required to recover a sparse signal in ${\mathbb C}^M$ with $L$ non-zero coefficients from compressed samples in the presence of noise. For a number of different recovery criteria, we prove…

Information Theory · Computer Science 2007-11-05 Mehmet Akçakaya , Vahid Tarokh

Compressed Sensing (CS) is a novel technique for simultaneous signal sampling and compression based on the existence of a sparse representation of signal and a projected dictionary $PD$, where $P\in\mathbb{R}^{m\times d}$ is the projection…

Information Theory · Computer Science 2018-04-25 Canyi Lu , Huan Li , Zhouchen Lin

Compressed sensing (CS) is about recovering a structured signal from its under-determined linear measurements. Starting from sparsity, recovery methods have steadily moved towards more complex structures. Emerging machine learning tools…

Information Theory · Computer Science 2019-12-18 Pei Peng , Shirin Jalali , Xin Yuan

Motivated by applications in unsourced random access, this paper develops a novel scheme for the problem of compressed sensing of binary signals. In this problem, the goal is to design a sensing matrix $A$ and a recovery algorithm, such…

Information Theory · Computer Science 2021-09-21 Elad Romanov , Or Ordentlich

Many applications concern sparse signals, for example, detecting anomalies from the differences between consecutive images taken by surveillance cameras. This paper focuses on the problem of recovering a K-sparse signal x in N dimensions.…

Machine Learning · Statistics 2013-02-06 Ping Li , Cun-Hui Zhang

We propose tensor-network compressed sensing (TNCS) by combining the ideas of compressed sensing, tensor network (TN), and machine learning, which permits novel and efficient quantum communications of realistic data. The strategy is to use…

Machine Learning · Statistics 2020-09-02 Shi-Ju Ran , Zheng-Zhi Sun , Shao-Ming Fei , Gang Su , Maciej Lewenstein

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

Convolutional sparse coding (CSC) can learn representative shift-invariant patterns from multiple kinds of data. However, existing CSC methods can only model noises from Gaussian distribution, which is restrictive and unrealistic. In this…

Machine Learning · Computer Science 2020-04-22 Yaqing Wang , James T. Kwok , Lionel M. Ni

In Compressed Sensing, a real-valued sparse vector has to be estimated from an underdetermined system of linear equations. In many applications, however, the elements of the sparse vector are drawn from a finite set. For the estimation of…

Information Theory · Computer Science 2016-08-24 Susanne Sparrer , Robert F. H. Fischer

We consider the problem of estimating the frequency components of a mixture of s complex sinusoids from a random subset of n regularly spaced samples. Unlike previous work in compressed sensing, the frequencies are not assumed to lie on a…

Information Theory · Computer Science 2013-07-12 Gongguo Tang , Badri Narayan Bhaskar , Parikshit Shah , Benjamin Recht

We demonstrate that a sparse signal can be estimated from the phase of complex random measurements, in a "phase-only compressive sensing" (PO-CS) scenario. With high probability and up to a global unknown amplitude, we can perfectly recover…

Information Theory · Computer Science 2020-11-13 Laurent Jacques , Thomas Feuillen

Compressive sensing (CS) is a new technology which allows the acquisition of signals directly in compressed form, using far fewer measurements than traditional theory dictates. Recently, many so-called signal space methods have been…

Numerical Analysis · Mathematics 2015-11-13 Xiaoyi Gu , Deanna Needell , Shenyinying Tu

Compressed sensing is a technique to sample compressible signals below the Nyquist rate, whilst still allowing near optimal reconstruction of the signal. In this paper we present a theoretical analysis of the iterative hard thresholding…

Information Theory · Computer Science 2008-05-06 Thomas Blumensath , Mike E. Davies

Compressed sensing (CS) is a promising approach to reduce the number of measurements in photoacoustic tomography (PAT) while preserving high spatial resolution. This allows to increase the measurement speed and to reduce system costs.…

Compressive Sensing theory says that it is possible to reconstruct a measured signal if an enough sparse representation of this signal exists in comparison to the number of random measurements. This theory was applied to reconstruct signals…

In this paper, adaptive non-uniform compressive sampling (ANCS) of time-varying signals, which are sparse in a proper basis, is introduced. ANCS employs the measurements of previous time steps to distribute the sensing energy among…

Applications · Statistics 2017-03-10 Alireza Zaeemzadeh , Mohsen Joneidi , Nazanin Rahnavard

Most compressed sensing algorithms do not account for the effect of saturation in noisy compressed measurements, though saturation is an important consequence of the limited dynamic range of existing sensors. The few algorithms that handle…

Machine Learning · Computer Science 2021-02-09 Shuvayan Banerjee , Radhe Srivastava , Ajit Rajwade

In structural health monitoring (SHM) systems, massive amounts of data are often generated that need data compression techniques to reduce the cost of signal transfer and storage. Compressive sensing (CS) is a novel data acquisition method…

Applications · Statistics 2014-12-16 Yong Huang , James L. Beck , Stephen Wu , Hui Li

We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics…

Information Theory · Computer Science 2014-10-22 Yanting Ma , Junan Zhu , Dror Baron

In the problem of adaptive compressed sensing, one wants to estimate an approximately $k$-sparse vector $x\in\mathbb{R}^n$ from $m$ linear measurements $A_1 x, A_2 x,\ldots, A_m x$, where $A_i$ can be chosen based on the outcomes $A_1…

Data Structures and Algorithms · Computer Science 2018-04-26 Vasileios Nakos , Xiaofei Shi , David P. Woodruff , Hongyang Zhang
‹ Prev 1 8 9 10 Next ›