English
Related papers

Related papers: Beyond Nyquist: Efficient Sampling of Sparse Bandl…

200 papers

This paper is concerned with the problem of reconstructing an infinite-dimensional signal from a limited number of linear measurements. In particular, we show that for binary measurements (modelled with Walsh functions and Hadamard…

Numerical Analysis · Mathematics 2019-08-02 Anders Christian Hansen , Laura Thesing

This paper proposes a verification-based decoding approach for reconstruction of a sparse signal with incremental sparse measurements. In its first step, the verification-based decoding algorithm is employed to reconstruct the signal with a…

Information Theory · Computer Science 2013-02-12 Xiaofu Wu , Zhen Yang , Lu Gan

We present a general architecture for the acquisition of ensembles of correlated signals. The signals are multiplexed onto a single line by mixing each one against a different code and then adding them together, and the resulting signal is…

Information Theory · Computer Science 2018-06-13 Ali Ahmed , Justin Romberg

We consider the problem of reconstructing a compactly supported function from samples of its Fourier transform taken along a spiral. We determine the Nyquist sampling rate in terms of the density of the spiral and show that below this rate…

Classical Analysis and ODEs · Mathematics 2022-05-04 Philippe Jaming , Felipe Negreira , José Luis Romero

We study signal recovery on graphs based on two sampling strategies: random sampling and experimentally designed sampling. We propose a new class of smooth graph signals, called approximately bandlimited, which generalizes the bandlimited…

Information Theory · Computer Science 2015-06-01 Siheng Chen , Rohan Varma , Aarti Singh , Jelena Kovačević

Recent results in compressed sensing showed that the optimal subsampling strategy should take into account the sparsity pattern of the signal at hand. This oracle-like knowledge, even though desirable, nevertheless remains elusive in most…

Information Theory · Computer Science 2023-06-28 Simon Ruetz

Non-convex constraints have recently proven a valuable tool in many optimisation problems. In particular sparsity constraints have had a significant impact on sampling theory, where they are used in Compressed Sensing and allow structured…

Information Theory · Computer Science 2012-05-09 Thomas Blumensath

A modulated wideband converter (MWC) has been introduced as a sub-Nyquist sampler that exploits a set of fast alternating pseudo random (PR) signals. Through parallel sampling branches, an MWC compresses a multiband spectrum by mixing it…

Signal Processing · Electrical Eng. & Systems 2018-10-08 Jehyuk Jang , Sanghun Im , Heung-No Lee

Signals comprised of a stream of short pulses appear in many applications including bio-imaging and radar. The recent finite rate of innovation framework, has paved the way to low rate sampling of such pulses by noticing that only a small…

Information Theory · Computer Science 2015-05-18 Ronen Tur , Yonina C. Eldar , Zvi Friedman

This paper concerns the problem of recovering an unknown but structured signal $x \in R^n$ from $m$ quadratic measurements of the form $y_r=|<a_r,x>|^2$ for $r=1,2,...,m$. We focus on the under-determined setting where the number of…

Machine Learning · Computer Science 2017-02-22 Mahdi Soltanolkotabi

We consider the problem of recovering signals from their power spectral density. This is a classical problem referred to in literature as the phase retrieval problem, and is of paramount importance in many fields of applied sciences. In…

Information Theory · Computer Science 2013-11-12 Kishore Jaganathan , Samet Oymak , Babak Hassibi

Suppose the signal x is realized by driving a k-sparse signal u through an arbitrary unknown stable discrete-linear time invariant system H. These types of processes arise naturally in Reflection Seismology. In this paper we are interested…

Information Theory · Computer Science 2016-09-08 V. Saligrama , M. Zhao

In this paper we study the compressive sensing effects on 2D signals exhibiting sparsity in 2D DFT domain. A simple algorithm for reconstruction of randomly under-sampled data is proposed. It is based on the analytically determined…

Information Theory · Computer Science 2015-11-17 Srdjan Stankovic , Irena Orovic

Natural signals and images are well-known to be approximately sparse in transform domains such as Wavelets and DCT. This property has been heavily exploited in various applications in image processing and medical imaging. Compressed sensing…

Machine Learning · Computer Science 2015-10-26 Saiprasad Ravishankar , Yoram Bresler

Compressive sensing has shown significant promise in biomedical fields. It reconstructs a signal from sub-Nyquist random linear measurements. Classical methods only exploit the sparsity in one domain. A lot of biomedical signals have…

Information Theory · Computer Science 2016-11-26 Yipeng Liu , Maarten De Vos , Ivan Gligorijevic , Vladimir Matic , Yuqian Li , Sabine Van Huffel

Shannon's sampling theorem is one of the cornerstone topics that is well understood and explored, both mathematically and algorithmically. That said, practical realization of this theorem still suffers from a severe bottleneck due to the…

Information Theory · Computer Science 2020-12-02 Ayush Bhandari , Felix Krahmer , Ramesh Raskar

The success of the compressed sensing paradigm has shown that a substantial reduction in sampling and storage complexity can be achieved in certain linear and non-adaptive estimation problems. It is therefore an advisable strategy for…

Information Theory · Computer Science 2014-08-27 Peter Jung , Philipp Walk

Analog signals processed in digital hardware are quantized into a discrete bit-constrained representation. Quantization is typically carried out using analog-to-digital converters (ADCs), operating in a serial scalar manner. In some…

Information Theory · Computer Science 2019-10-22 Alejandro Cohen , Nir Shlezinger , Salman Salamatian , Yonina C. Eldar , Muriel Médard

Compressed sensing (sparse signal recovery) often encounters nonnegative data (e.g., images). Recently we developed the methodology of using (dense) Compressed Counting for recovering nonnegative K-sparse signals. In this paper, we adopt…

Methodology · Statistics 2014-01-03 Ping Li , Cun-Hui Zhang , Tong Zhang

Recovery of arbitrarily positioned samples that are missing in sparse signals recently attracted significant research interest. Sparse signals with heavily corrupted arbitrary positioned samples could be analyzed in the same way as…

Information Theory · Computer Science 2013-09-24 Ljubisa Stankovic , Milos Dakovic , Stefan Vujovic