English
Related papers

Related papers: On sparse sensing and sparse sampling of coded sig…

200 papers

A popular approach within the signal processing and machine learning communities consists in modelling signals as sparse linear combinations of atoms selected from a learned dictionary. While this paradigm has led to numerous empirical…

Machine Learning · Statistics 2012-10-03 Rodolphe Jenatton , Rémi Gribonval , Francis Bach

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

Signal detection in environments with unknown signal bandwidth and time intervals is a fundamental problem in adversarial and spectrum-sharing scenarios. This paper addresses the problem of detecting signals occupying unknown degrees of…

Signal Processing · Electrical Eng. & Systems 2026-01-21 Ali Rasteh , Sundeep Rangan

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

This paper considers efficient sampling of simultaneously sparse and correlated (S$\&$C) signals. Such signals arise in various applications in array processing. We propose an implementable sampling architecture for the acquisition of…

Information Theory · Computer Science 2023-01-19 Ali Ahmed , Fahad Shamshad , Humera Hameed

We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As demonstrated heuristically and…

Information Theory · Computer Science 2015-03-19 David L. Donoho , Adel Javanmard , Andrea Montanari

Subsampled blind deconvolution is the recovery of two unknown signals from samples of their convolution. To overcome the ill-posedness of this problem, solutions based on priors tailored to specific application have been developed in…

Information Theory · Computer Science 2015-11-23 Kiryung Lee , Yanjun Li , Marius Junge , Yoram Bresler

We investigate design and performance of communications over the bandlimited Gaussian channel with one-bit output quantization. A transceiver structure is proposed, which generates the channel input using a finite set of time-limited and…

Information Theory · Computer Science 2020-11-05 Rui Deng , Jing Zhou , Wenyi Zhang

The support recovery problem consists of determining a sparse subset of a set of variables that is relevant in generating a set of observations, and arises in a diverse range of settings such as compressive sensing, and subset selection in…

Information Theory · Computer Science 2016-08-31 Jonathan Scarlett , Volkan Cevher

In remote control, efficient compression or representation of control signals is essential to send them through rate-limited channels. For this purpose, we propose an approach of sparse control signal representation using the compressive…

Systems and Control · Computer Science 2015-06-16 Masaaki Nagahara , Takahiro Matsuda , Kazunori Hayashi

We consider the scenario in which multiple sensors send spatially correlated data to a fusion center (FC) via independent Rayleigh-fading channels with additive noise. Assuming that the sensor data is sparse in some basis, we show that the…

Information Theory · Computer Science 2015-06-12 Gang Yang , Vincent Y. F. Tan , Chin Keong Ho , See Ho Ting , Yong Liang Guan

We discuss a method for sparse signal approximation, which is based on the correlation of the target signal with a pseudo-random signal, and uses a modification of the greedy matching pursuit algorithm. We show that this approach provides…

Data Analysis, Statistics and Probability · Physics 2011-05-26 M. Andrecut

Sampling of physical fields with mobile sensor is an emerging area. In this context, this work introduces and proposes solutions to a fundamental question: can a spatial field be estimated from samples taken at unknown sampling locations?…

Information Theory · Computer Science 2017-07-12 Animesh Kumar

In this paper, we demonstrate some applications of compressive sensing over networks. We make a connection between compressive sensing and traditional information theoretic techniques in source coding and channel coding. Our results provide…

Information Theory · Computer Science 2010-12-07 Soheil Feizi , Muriel Medard , Michelle Effros

This work investigates the problem of signal recovery from undersampled noisy sub-Gaussian measurements under the assumption of a synthesis-based sparsity model. Solving the $\ell^1$-synthesis basis pursuit allows for a simultaneous…

Information Theory · Computer Science 2020-04-16 Maximilian März , Claire Boyer , Jonas Kahn , Pierre Weiss

This paper investigates total variation minimization in one spatial dimension for the recovery of gradient-sparse signals from undersampled Gaussian measurements. Recently established bounds for the required sampling rate state that uniform…

Information Theory · Computer Science 2022-04-12 Martin Genzel , Maximilian März , Robert Seidel

We fully characterize the nonasymptotic minimax separation rate for sparse signal detection in the Gaussian sequence model with $p$ equicorrelated observations, generalizing a result of Collier, Comminges, and Tsybakov. As a consequence of…

Statistics Theory · Mathematics 2021-10-26 Subhodh Kotekal , Chao Gao

Recovering the support of sparse vectors in underdetermined linear regression models, \textit{aka}, compressive sensing is important in many signal processing applications. High SNR consistency (HSC), i.e., the ability of a support recovery…

Signal Processing · Electrical Eng. & Systems 2018-11-20 Sreejith Kallummil , Sheetal Kalyani

The article starts with new aliasing-truncation error upper bounds in the sampling theorem for non-bandlimited stochastic signals. Then, it investigates $L_p([0,T])$ approximations of sub-Gaussian random signals. Explicit truncation error…

Information Theory · Computer Science 2016-08-15 Yuriy Kozachenko , Andriy Olenko

This paper focuses on a networked state estimation problem for a spatially large linear system with a distributed array of sensors, each of which offers partial state measurements, and the transmission is lossy. We propose a measurement…

Systems and Control · Computer Science 2019-05-29 Tianju Sui , Damian Marelli , Ximing Sun , Minyue Fu