English
Related papers

Related papers: Binary Compressive Sensing via Smoothed $\ell_0$ G…

200 papers

In this paper we study the reconstruction of binary sparse signals from partial random circulant measurements. We show that the reconstruction via the least-squares algorithm is as good as the reconstruction via the usually used program…

Information Theory · Computer Science 2020-06-29 Sandra Keiper

We propose a method to reconstruct sparse signals degraded by a nonlinear distortion and acquired at a limited sampling rate. Our method formulates the reconstruction problem as a nonconvex minimization of the sum of a data fitting term and…

Optimization and Control · Mathematics 2023-01-19 Arthur Marmin , Marc Castella , Jean-Christophe Pesquet , Laurent Duval

For wideband spectrum sensing, compressive sensing has been proposed as a solution to speed up the high dimensional signals sensing and reduce the computational complexity. Compressive sensing consists of acquiring the essential information…

Signal Processing · Electrical Eng. & Systems 2018-02-13 Fatima Salahdine , Naima Kaabouch , Hassan El Ghazi

Based on $\alpha$-stable random projections with small $\alpha$, we develop a simple algorithm for compressed sensing (sparse signal recovery) by utilizing only the signs (i.e., 1-bit) of the measurements. Using only 1-bit information of…

Methodology · Statistics 2015-11-12 Ping Li

The realisation of sensing modalities based on the principles of compressed sensing is often hindered by discrepancies between the mathematical model of its sensing operator, which is necessary during signal recovery, and its actual…

Information Theory · Computer Science 2018-02-21 Valerio Cambareri , Amirafshar Moshtaghpour , Laurent Jacques

In many data acquisition systems it is common to observe signals whose amplitudes have been clipped. We present two new algorithms for recovering a clipped signal by leveraging the model assumption that the underlying signal is sparse in…

Information Theory · Computer Science 2011-10-25 Alejandro J. Weinstein , Michael B. Wakin

We address the problem of recovering a sparse signal from clipped or quantized measurements. We show how these two problems can be formulated as minimizing the distance to a convex feasibility set, which provides a convex and differentiable…

Signal Processing · Electrical Eng. & Systems 2018-12-05 Lucas Rencker , Francis Bach , Wenwu Wang , Mark D. Plumbley

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

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

Spectrum sensing is an important process in cognitive radio. A number of sensing techniques that have been proposed suffer from high processing time, hardware cost and computational complexity. To address these problems, compressive sensing…

Signal Processing · Electrical Eng. & Systems 2018-01-31 Youness Arjoune , Naima Kaabouch , Hassan El Ghazi , Ahmed Tamtaoui

We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art…

Optimization and Control · Mathematics 2018-12-27 Jan Kuske , Paul Swoboda , Stefania Petra

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

In this paper, we study the problem of compressed sensing using binary measurement matrices and $\ell_1$-norm minimization (basis pursuit) as the recovery algorithm. We derive new upper and lower bounds on the number of measurements to…

Machine Learning · Statistics 2020-04-28 Mahsa Lotfi , Mathukumalli Vidyasagar

In this work we address the problem of blindly reconstructing compressively sensed signals by exploiting the co-sparse analysis model. In the analysis model it is assumed that a signal multiplied by an analysis operator results in a sparse…

Information Theory · Computer Science 2013-03-27 Julian Wörmann , Simon Hawe , Martin Kleinsteuber

Compressed sensing with sparse frame representations is seen to have much greater range of practical applications than that with orthonormal bases. In such settings, one approach to recover the signal is known as $\ell_1$-analysis. We…

Information Theory · Computer Science 2015-03-19 Yulong Liu , Tiebin Mi , Shidong Li

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

Compressed sensing is a signal processing method that acquires data directly in a compressed form. This allows one to make less measurements than what was considered necessary to record a signal, enabling faster or more precise measurement…

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

Compressed sensing typically deals with the estimation of a system input from its noise-corrupted linear measurements, where the number of measurements is smaller than the number of input components. The performance of the estimation…

Information Theory · Computer Science 2016-11-17 Jin Tan , Danielle Carmon , Dror Baron

This work theoretically studies the problem of estimating a structured high-dimensional signal $x_0 \in \mathbb{R}^n$ from noisy $1$-bit Gaussian measurements. Our recovery approach is based on a simple convex program which uses the hinge…

Statistics Theory · Mathematics 2020-06-02 Martin Genzel , Alexander Stollenwerk

This paper proposes a robust adaptive algorithm for smooth graph signal recovery which is based on generalized correntropy. A proper cost function is defined for this purpose. The proposed algorithm is derived and a kernel width…

Signal Processing · Electrical Eng. & Systems 2022-09-20 Razieh Torkamani , Hadi Zayyani , Farokh Marvasti