English
Related papers

Related papers: Sub-Nyquist Sampling of Sparse and Correlated Sign…

200 papers

Conventional sub-Nyquist sampling methods for analog signals exploit prior information about the spectral support. In this paper, we consider the challenging problem of blind sub-Nyquist sampling of multiband signals, whose unknown…

Information Theory · Computer Science 2015-05-13 Moshe Mishali , Yonina C. Eldar

We propose and analyze an online algorithm for reconstructing a sequence of signals from a limited number of linear measurements. The signals are assumed sparse, with unknown support, and evolve over time according to a generic nonlinear…

Optimization and Control · Mathematics 2015-03-12 Joao F. C. Mota , Nikos Deligiannis , Aswin C. Sankaranarayanan , Volkan Cevher , Miguel R. D. Rodrigues

Signals sparse in a transformation domain can be recovered from a reduced set of randomly positioned samples by using compressive sensing algorithms. Simple re- construction algorithms are presented in the first part of the paper. The…

Information Theory · Computer Science 2015-12-08 Ljubisa Stankovic , Isidora Stankovic

Compressed sensing is a theory which guarantees the exact recovery of sparse signals from a small number of linear projections. The sampling schemes suggested by current compressed sensing theories are often of little practical relevance…

Information Theory · Computer Science 2014-07-22 Jérémie Bigot , Claire Boyer , Pierre Weiss

As an alternative to the traditional sampling theory, compressed sensing allows acquiring much smaller amount of data, still estimating the spectra of frequency-sparse signals accurately. However, compressed sensing usually requires random…

Information Theory · Computer Science 2016-07-22 Shan Huang , Hong Sun , Haijian Zhang , Lei Yu

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

In many signal processing applications, one wishes to acquire images that are sparse in transform domains such as spatial finite differences or wavelets using frequency domain samples. For such applications, overwhelming empirical evidence…

Computer Vision and Pattern Recognition · Computer Science 2013-10-22 Felix Krahmer , Rachel Ward

We propose a novel random triggering based modulated wideband compressive sampling (RT-MWCS) method to facilitate efficient realization of sub-Nyquist rate compressive sampling systems for sparse wideband signals. Under the assumption that…

Information Theory · Computer Science 2017-03-07 Yijiu Zhao , Yu Hen Hu , Jingjing Liu

Parallel acquisition systems arise in various applications in order to moderate problems caused by insufficient measurements in single-sensor systems. These systems allow simultaneous data acquisition in multiple sensors, thus alleviating…

Information Theory · Computer Science 2023-08-31 Il Yong Chun , Ben Adcock

This paper proposes a compressed sensing (CS) framework for the acquisition and reconstruction of frequency-sparse signals with chaotic dynamical systems. The sparse signal is acting as an excitation term of a discrete-time chaotic system…

Information Theory · Computer Science 2016-12-21 Zhong Liu , Shengyao Chen , Feng Xi

The Random Demodulator (RD) and the Modulated Wideband Converter (MWC) are two recently proposed compressed sensing (CS) techniques for the acquisition of continuous-time spectrally-sparse signals. They extend the standard CS paradigm from…

Information Theory · Computer Science 2011-10-11 Michael A. Lexa , Mike E. Davies , John S. Thompson

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

Compressive Sensing (CS) exploits the surprising fact that the information contained in a sparse signal can be preserved in a small number of compressive, often random linear measurements of that signal. Strong theoretical guarantees have…

Information Theory · Computer Science 2014-05-02 Armin Eftekhari , Michael B. Wakin

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

Because optical systems have huge bandwidth and are capable of generating low noise short pulses they are ideal for undersampling multi-band signals that are located within a very broad frequency range. In this paper we propose a new scheme…

Optics · Physics 2009-11-13 Amir Rosenthal , Alex Linden , Moshe Horowitz

Compressed sensing is triggering a major evolution in signal acquisition. It consists in sampling a sparse signal at low rate and later using computational power for its exact reconstruction, so that only the necessary information is…

Statistical Mechanics · Physics 2012-06-07 Florent Krzakala , Marc Mézard , François Sausset , Yifan Sun , Lenka Zdeborová

Cognitive radio (CR) requires spectrum sensing over a broad frequency band. One of the crucial tasks in CR is to sample wideband signal at high sampling rate. In this paper, we propose an acquisition receiver with co-prime sampling…

Signal Processing · Electrical Eng. & Systems 2018-06-04 Yijiu Zhao , Shuangman Xiao

The recovery of sparsest overcomplete representation has recently attracted intensive research activities owe to its important potential in the many applied fields such as signal processing, medical imaging, communication, and so on. This…

Information Theory · Computer Science 2011-09-29 Lianlin Li

We present improved sampling complexity bounds for stable and robust sparse recovery in compressed sensing. Our unified analysis based on l1 minimization encompasses the case where (i) the measurements are block-structured samples in order…

Information Theory · Computer Science 2020-05-22 Ben Adcock , Claire Boyer , Simone Brugiapaglia

In signal processing and data recovery, reconstructing a signal from quadratic measurements poses a significant challenge, particularly in high-dimensional settings where measurements $m$ is far less than the signal dimension $n$ (i.e., $m…

Information Theory · Computer Science 2025-07-11 Jinming Wen , Yi Hu , Meng Huang