English
Related papers

Related papers: Structure dependent sampling in compressed sensing…

200 papers

In oversampled adaptive sensing (OAS), noisy measurements are collected in multiple subframes. The sensing basis in each subframe is adapted according to some posterior information exploited from previous measurements. The framework is…

Information Theory · Computer Science 2019-12-11 Ali Bereyhi , Ralf R. Müller

The problem of compressing a real-valued sparse source using compressive sensing techniques is studied. The rate distortion optimality of a coding scheme in which compressively sensed signals are quantized and then reconstructed is…

Information Theory · Computer Science 2010-11-09 Rajiv Soundararajan , Sriram Vishwanath

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 a resource-constrained scenario where a compressed sensing- (CS) based sensor has a low number of measurements which are quantized at a low rate followed by transmission or storage. Applying this scenario, we develop a new…

Information Theory · Computer Science 2014-05-01 Amirpasha Shirazinia , Saikat Chatterjee , Mikael Skoglund

Compressed sensing is an imaging paradigm that allows one to invert an underdetermined linear system by imposing the a priori knowledge that the sought after solution is sparse (i.e., mostly zeros). Previous works have shown that if one…

Image and Video Processing · Electrical Eng. & Systems 2023-12-05 Nicholas Dwork , Erin K. Englund

Consider the problem of recovering an unknown signal from undersampled measurements, given the knowledge that the signal has a sparse representation in a specified dictionary $D$. This problem is now understood to be well-posed and…

Information Theory · Computer Science 2015-06-09 Felix Krahmer , Deanna Needell , Rachel Ward

Learning governing equations allows for deeper understanding of the structure and dynamics of data. We present a random sampling method for learning structured dynamical systems from under-sampled and possibly noisy state-space…

Information Theory · Computer Science 2018-05-14 Hayden Schaeffer , Giang Tran , Rachel Ward , Linan Zhang

This letter proposes a novel distributed compressed estimation scheme for sparse signals and systems based on compressive sensing techniques. The proposed scheme consists of compression and decompression modules inspired by compressive…

Information Theory · Computer Science 2015-02-05 S. Xu , R. C. de Lamare , H. V. Poor

Wireless tomography is a technique for inferring a physical environment within a monitored region by analyzing RF signals traversed across the region. In this paper, we consider wireless tomography in a two and higher dimensionally…

Information Theory · Computer Science 2014-07-10 Kazushi Takemoto , Takahiro Matsuda , Shinsuke Hara , Kenichi Takizawa , Fumie Ono , Ryu Miura

In this paper, we exploit the theory of compressive sensing to perform detection of a random source in a dense sensor network. When the sensors are densely deployed, observations at adjacent sensors are highly correlated while those…

Information Theory · Computer Science 2017-07-27 Thakshila Wimalajeewa , Pramod K. Varshney

Kronecker compressed sensing refers to using Kronecker product matrices as sparsifying bases and measurement matrices in compressed sensing. This work focuses on the Kronecker compressed sensing problem, encompassing three sparsity…

Signal Processing · Electrical Eng. & Systems 2025-04-11 Yanbin He , Geethu Joseph

Sparse representations have emerged as a powerful tool in signal and information processing, culminated by the success of new acquisition and processing techniques such as Compressed Sensing (CS). Fusion frames are very rich new signal…

Information Theory · Computer Science 2011-06-20 Petros T. Boufounos , Gitta Kutyniok , Holger Rauhut

The weak-$\ell^p$ norm can be used to define a measure $s$ of sparsity. When we compute $s$ for the discrete cosine transform coefficients of a signal, the value of $s$ is related to the information content of said signal. We use this value…

Information Theory · Computer Science 2020-02-25 Alfredo Nava-Tudela

A different compressive sensing framework, convolution with white noise waveform followed by subsampling at fixed (not randomly selected) locations, is studied in this paper. We show that its recoverability for sparse signals depends on the…

Optimization and Control · Mathematics 2009-09-30 Yin Xiang , Lianlin Li , Fang Li

This paper investigates the problem of recovering the support of structured signals via adaptive compressive sensing. We examine several classes of structured support sets, and characterize the fundamental limits of accurately recovering…

Statistics Theory · Mathematics 2016-09-05 Rui M. Castro , Ervin Tánczos

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

A new line of research uses compression methods to measure the similarity between signals. Two signals are considered similar if one can be compressed significantly when the information of the other is known. The existing compression-based…

Computer Vision and Pattern Recognition · Computer Science 2019-09-30 Tanaya Guha , Rabab K. Ward

In many practical settings one can sequentially and adaptively guide the collection of future data, based on information extracted from data collected previously. These sequential data collection procedures are known by different names,…

Statistics Theory · Mathematics 2013-11-28 Ervin Tánczos , Rui M. Castro

There are two main approaches in compressed sensing: the geometric approach and the combinatorial approach. In this paper we introduce an information theoretic approach and use results from the theory of Huffman codes to construct a…

Information Theory · Computer Science 2009-06-26 Akram Aldroubi , Haichao Wang , Kourosh Zarringhalam

The investigation of the effects of sparsity or sparsity constraints in signal processing problems has received considerable attention recently. Sparsity constraints refer to the a priori information that the object or signal of interest…

Statistics Theory · Mathematics 2013-11-25 Alexander Jung