English
Related papers

Related papers: Restricted Isometries for Partial Random Circulant…

200 papers

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

Measurement samples are often taken in various monitoring applications. To reduce the sensing cost, it is desirable to achieve better sensing quality while using fewer samples. Compressive Sensing (CS) technique finds its role when the…

Information Theory · Computer Science 2016-11-18 Ying Li , Kun Xie , Xin Wang

Compressive Sensing, as an emerging technique in signal processing is reviewed in this paper together with its common applications. As an alternative to the traditional signal sampling, Compressive Sensing allows a new acquisition strategy…

Information Theory · Computer Science 2017-05-16 Andjela Draganic , Irena Orovic , Srdjan Stankovic

Recent development in compressed sensing (CS) has revealed that the use of a special design of measurement matrix, namely the spatially-coupled matrix, can achieve the information-theoretic limit of CS. In this paper, we consider the…

Information Theory · Computer Science 2014-02-14 Chao-Kai Wen , Kai-Kit Wong

Compressive sensing is a novel approach that linearly samples sparse or compressible signals at a rate much below the Nyquist-Shannon sampling rate and outperforms traditional signal processing techniques in acquiring and reconstructing…

Information Theory · Computer Science 2019-01-03 Ramin Ayanzadeh , Seyedahmad Mousavi , Milton Halem , Tim Finin

In this paper, we study the restricted isometry property of partial random circulant matrices. For a bounded subgaussian generator with independent entries, we prove that the partial random circulant matrices satisfy $s$-order RIP with high…

Information Theory · Computer Science 2018-08-23 Meng Huang , Yuxuan Pang , Zhiqiang Xu

This paper establishes new restricted isometry conditions for compressed sensing and affine rank minimization. It is shown for compressed sensing that $\delta_{k}^A+\theta_{k,k}^A < 1$ guarantees the exact recovery of all $k$ sparse signals…

Information Theory · Computer Science 2016-11-17 T. Tony Cai , Anru Zhang

The Restricted Isometry Property (RIP) introduced by Cand\'es and Tao is a fundamental property in compressed sensing theory. It says that if a sampling matrix satisfies the RIP of certain order proportional to the sparsity of the signal,…

Information Theory · Computer Science 2009-01-06 Leslie Ying , Yi Ming Zou

Compressive sensing (CS) is a new methodology to capture signals at lower rate than the Nyquist sampling rate when the signals are sparse or sparse in some domain. The performance of CS estimators is analyzed in this paper using tools from…

Information Theory · Computer Science 2014-09-09 Solomon A. Tesfamicael , Bruhtesfa E. Godana , Faraz Barzideh

The goal of compressed sensing is to reconstruct a sparse signal under a few linear measurements far less than the dimension of the ambient space of the signal. However, many real-life applications in physics and biomedical sciences carry…

Optimization and Control · Mathematics 2017-08-29 Angang Cui , Jigen Peng , Haiyang Li

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

Compressive sensing is a methodology for the reconstruction of sparse or compressible signals using far fewer samples than required by the Nyquist criterion. However, many of the results in compressive sensing concern random sampling…

Numerical Analysis · Mathematics 2014-04-02 Guangliang Chen , Atul Divekar , Deanna Needell

This paper deals with the design of a sensing matrix along with a sparse recovery algorithm by utilizing the probability-based prior information for compressed sensing system. With the knowledge of the probability for each atom of the…

Machine Learning · Computer Science 2019-10-29 Q. Jiang , S. Li , Z. Zhu , H. Bai , X. He , R. C. de Lamare

In this paper, we consider a compressed sensing problem of reconstructing a sparse signal from an undersampled set of noisy linear measurements. The regularized least squares or least absolute shrinkage and selection operator (LASSO)…

Information Theory · Computer Science 2014-10-30 Chao-Kai Wen , Jun Zhang , Kai-Kit Wong , Jung-Chieh Chen , Chau Yuen

In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…

Information Theory · Computer Science 2021-08-25 Hanshen Xiao , Yaowen Zhang , Guoqiang Xiao

Optimizing the acquisition matrix is useful for compressed sensing of signals that are sparse in overcomplete dictionaries, because the acquisition matrix can be adapted to the particular correlations of the dictionary atoms. In this paper…

Information Theory · Computer Science 2013-09-17 Nicolae Cleju

The linear inverse source and scattering problems are studied from the perspective of compressed sensing, in particular the idea that sufficient incoherence and sparsity guarantee uniqueness of the solution. By introducing the sensor as…

Data Analysis, Statistics and Probability · Physics 2009-05-19 Albert Fannjiang , Pengchong Yan , Thomas Strohmer

A matrix $A \in \mathbb{C}^{q \times N}$ satisfies the restricted isometry property of order $k$ with constant $\varepsilon$ if it preserves the $\ell_2$ norm of all $k$-sparse vectors up to a factor of $1\pm \varepsilon$. We prove that a…

Data Structures and Algorithms · Computer Science 2015-10-14 Ishay Haviv , Oded Regev

This paper considers approximately sparse signal and low-rank matrix's recovery via truncated norm minimization $\min_{x}\|x_T\|_q$ and $\min_{X}\|X_T\|_{S_q}$ from noisy measurements. We first introduce truncated sparse approximation…

Information Theory · Computer Science 2021-05-28 Wengu Chen , Peng Li

A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribution, and achieving accurate reconstruction on average, is…

Computer Vision and Pattern Recognition · Computer Science 2015-05-27 Guoshen Yu , Guillermo Sapiro