English
Related papers

Related papers: Analysis of Hard-Thresholding for Distributed Comp…

200 papers

We consider the problem of recovering a single or multiple frequency-sparse signals, which share the same frequency components, from a subset of regularly spaced samples. The problem is referred to as continuous compressed sensing (CCS) in…

Information Theory · Computer Science 2014-10-24 Zai Yang , Lihua Xie

The $\ell^0$ minimization of compressed sensing is often relaxed to $\ell^1$, which yields easy computation using the shrinkage mapping known as soft thresholding, and can be shown to recover the original solution under certain hypotheses.…

Information Theory · Computer Science 2016-06-22 Joseph Woodworth , Rick Chartrand

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

We propose a new method, {\it robust binary fused compressive sensing} (RoBFCS), to recover sparse piece-wise smooth signals from 1-bit compressive measurements. The proposed method is a modification of our previous {\it binary fused…

Computer Vision and Pattern Recognition · Computer Science 2014-03-21 Xiangrong Zeng , Mário A. T. Figueiredo

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an…

Information Theory · Computer Science 2010-01-26 Galen Reeves , Michael Gastpar

Distributed compressed sensing is concerned with representing an ensemble of jointly sparse signals using as few linear measurements as possible. Two novel joint reconstruction algorithms for distributed compressed sensing are presented in…

Information Theory · Computer Science 2014-05-22 Diego Valsesia , Giulio Coluccia , Enrico Magli

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

To strike a balance between energy efficiency and data quality control, this paper proposes a sensor censoring scheme for distributed sparse signal recovery via compressive-sensing based wireless sensor networks. In the proposed approach,…

Information Theory · Computer Science 2018-01-16 Jwo-Yuh Wu , Ming-Hsun Yang , Tsang-Yi Wang

We propose a compressive sensing algorithm that exploits geometric properties of images to recover images of high quality from few measurements. The image reconstruction is done by iterating the two following steps: 1) estimation of normal…

Computer Vision and Pattern Recognition · Computer Science 2015-06-11 Virginia Estellers , Jean-Philippe Thiran , Xavier Bresson

The goal of standard 1-bit compressive sensing is to accurately recover an unknown sparse vector from binary-valued measurements, each indicating the sign of a linear function of the vector. Motivated by recent advances in compressive…

Machine Learning · Statistics 2020-06-23 Zhaoqiang Liu , Selwyn Gomes , Avtansh Tiwari , Jonathan Scarlett

This letter is focused on quantized Compressed Sensing, assuming that Lasso is used for signal estimation. Leveraging recent work, we provide a framework to optimize the quantization function and show that the recovered signal converges to…

Information Theory · Computer Science 2016-06-10 Xiaoyi Gu , Shenyinying Tu , Hao-Jun Michael Shi , Mindy Case , Deanna Needell , Yaniv Plan

We provide more sample-efficient versions of some basic routines in quantum data analysis, along with simpler proofs. Particularly, we give a quantum "Threshold Search" algorithm that requires only $O((\log^2 m)/\epsilon^2)$ samples of a…

Quantum Physics · Physics 2024-08-07 Costin Bădescu , Ryan O'Donnell

We introduce q-ary compressive sensing, an extension of 1-bit compressive sensing. We propose a novel sensing mechanism and a corresponding recovery procedure. The recovery properties of the proposed approach are analyzed both theoretically…

Information Theory · Computer Science 2013-02-22 Youssef Mroueh , Lorenzo Rosasco

Finding a suitable measurement matrix is an important topic in compressed sensing. Though the known random matrix, whose entries are drawn independently from a certain probability distribution, can be used as a measurement matrix and…

Information Theory · Computer Science 2013-07-09 Yi-Zheng Fan , Tao Huang , Ming Zhu

Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be…

Optimization and Control · Mathematics 2023-12-27 Rachel Grotheer , Shuang Li , Anna Ma , Deanna Needell , Jing Qin

Compressed sensing aims to undersample certain high-dimensional signals, yet accurately reconstruct them by exploiting signal characteristics. Accurate reconstruction is possible when the object to be recovered is sufficiently sparse in a…

Information Theory · Computer Science 2015-05-13 David L. Donoho , Arian Maleki , Andrea Montanari

The idea of compressed sensing is to exploit representations in suitable (overcomplete) dictionaries that allow to recover signals far beyond the Nyquist rate provided that they admit a sparse representation in the respective dictionary.…

Computer Vision and Pattern Recognition · Computer Science 2018-06-22 Michael Moeller , Otmar Loffeld , Juergen Gall , Felix Krahmer

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

We consider the problem of sparse signal recovery from 1-bit measurements. Due to the noise present in the acquisition and transmission process, some quantized bits may be flipped to their opposite states. These sign flips may result in…

Information Theory · Computer Science 2016-11-03 Biao Sun , Hui Feng , Xinxin Xu

In passive monitoring using sensor networks, low energy supplies drastically constrain sensors in terms of calculation and communication abilities. Designing processing algorithms at the sensor level that take into account these constraints…

Applications · Statistics 2015-11-23 Augusto Zebadua , Pierre-Olivier Amblard , Eric Moisan , Olivier . J. J. Michel