English
Related papers

Related papers: The gap between the null space property and the re…

200 papers

In this study, we introduce a novel model, termed the Weighted Basis Pursuit Dequantization ($\omega$-BPDQ$_p$), which incorporates prior support information by assigning weights on the $\ell_1$ norm in the $\ell_1$ minimization process and…

Signal Processing · Electrical Eng. & Systems 2024-10-25 Xiaotong Liu , Yiyu Liang

We investigate recovery of nonnegative vectors from non-adaptive compressive measurements in the presence of noise of unknown power. In the absence of noise, existing results in the literature identify properties of the measurement that…

Information Theory · Computer Science 2017-03-13 Richard Kueng , Peter Jung

In this paper, we propose a compressed sensing (CS) framework that consists of three parts: a unit-norm tight frame (UTF), a random diagonal matrix and a column-wise orthonormal matrix. We prove that this structure satisfies the restricted…

Information Theory · Computer Science 2015-06-23 Peng Zhang , Lu Gan , Sumei Sun , Cong Ling

Imaging inverse problems aim to recover high-dimensional signals from undersampled, noisy measurements, a fundamentally ill-posed task with infinite solutions in the null-space of the sensing operator. To resolve this ambiguity, prior…

Computer Vision and Pattern Recognition · Computer Science 2026-04-16 Roman Jacome , Romario Gualdrón-Hurtado , Leon Suarez , Henry Arguello

We present a detailed analysis of the unconstrained $\ell_1$-weighted LASSO method for recovery of sparse data from its observation by randomly generated matrices, satisfying the Restricted Isometry Property (RIP) with constant $\delta<1$,…

Information Theory · Computer Science 2022-03-16 Simon Foucart , Eitan Tadmor , Ming Zhong

In this paper we consider the compressed sensing-based encryption and proposed the conditions in which the perfect secrecy is obtained. We prove when the Restricted Isometery Property (RIP) is hold and the number of measurements is more…

Information Theory · Computer Science 2016-02-02 Mahmoud Ramezani Mayiami , Babak Seyfe , Hamid G. Bafghi

This paper demonstrates theoretically that if the restricted isometry constant $\delta_K$ of the compressed sensing matrix satisfies $$ \delta_{K+1} < \frac{1}{\sqrt{K}+1}, $$ then a greedy algorithm called Orthogonal Matching Pursuit (OMP)…

Information Theory · Computer Science 2012-01-17 Qun Mo , Yi Shen

Quantized compressive sensing (QCS) deals with the problem of coding compressive measurements of low-complexity signals with quantized, finite precision representations, i.e., a mandatory process involved in any practical sensing model.…

Information Theory · Computer Science 2019-02-13 Chunlei Xu , Laurent Jacques

The goal of phaseless compressed sensing is to recover an unknown sparse or approximately sparse signal from the magnitude of its measurements. However, it does not take advantage of any support information of the original signal.…

Information Theory · Computer Science 2022-05-18 Haiye Huo

Recently, many practical algorithms have been proposed to recover the sparse signal from fewer measurements. Orthogonal matching pursuit (OMP) is one of the most effective algorithm. In this paper, we use the restricted isometry property to…

Functional Analysis · Mathematics 2011-06-01 Yi Shen , Song Li

Support recovery of sparse signals from noisy measurements with orthogonal matching pursuit (OMP) has been extensively studied. In this paper, we show that for any $K$-sparse signal $\x$, if a sensing matrix $\A$ satisfies the restricted…

Information Theory · Computer Science 2017-12-27 Jinming Wen , Zhengchun Zhou , Jian Wang , Xiaohu Tang , Qun Mo

Matrix recovery is the problem of recovering a low-rank matrix from a few linear measurements. Recently, this problem has gained a lot of attention as it is employed in many applications such as Netflix prize problem, seismic data…

Information Theory · Computer Science 2019-07-30 Hamideh. S Fazael Ardakani , Sajad Daei , Farzan Haddadi

The null space condition for $\ell_1$ minimization in compressed sensing is a necessary and sufficient condition on the sensing matrices under which a sparse signal can be uniquely recovered from the observation data via $\ell_1$…

Information Theory · Computer Science 2018-02-06 Myung Cho , Kumar Vijay Mishra , Weiyu Xu

A recent trend in compressed sensing is to consider non-convex optimization techniques for sparse recovery. The important case of $F$-minimization has become of particular interest, for which the exact reconstruction condition (ERC) in the…

Information Theory · Computer Science 2017-02-22 Jingbo Liu , Jian Jin , Yuantao Gu

Compressive sensing (CS) has recently emerged as a powerful framework for acquiring sparse signals. The bulk of the CS literature has focused on the case where the acquired signal has a sparse or compressible representation in an…

Information Theory · Computer Science 2013-06-24 Mark A. Davenport , Deanna Needell , Michael B. Wakin

The sparse optimization problems arise in many areas of science and engineering, such as compressed sensing, image processing, statistical and machine learning. The $\ell_{0}$-minimization problem is one of such optimization problems, which…

Optimization and Control · Mathematics 2019-04-23 Jialiang Xu , Yun-Bin Zhao

This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a…

Probability · Mathematics 2010-11-10 Holger Rauhut , Karin Schnass , Pierre Vandergheynst

In this article we present a statistical version of the Candes-Tao restricted isometry property (SRIP for short) which holds in general for any incoherent dictionary which is a disjoint union of orthonormal bases. In addition, under…

Information Theory · Computer Science 2009-03-13 Shamgar Gurevich , Ronny Hadani

Compressed sensing has a wide range of applications that include error correction, imaging, radar and many more. Given a sparse signal in a high dimensional space, one wishes to reconstruct that signal accurately and efficiently from a…

Numerical Analysis · Mathematics 2009-05-28 Deanna Needell

Restricted Isometry Constants (RICs) provide a measure of how far from an isometry a matrix can be when acting on sparse vectors. This, and related quantities, provide a mechanism by which standard eigen-analysis can be applied to topics…

Numerical Analysis · Mathematics 2013-07-16 Bubacarr Bah , Jared Tanner