English
Related papers

Related papers: Measurement Bounds for Sparse Signal Reconstructio…

200 papers

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

We propose a systematic method for constructing a sparse data reconstruction algorithm in compressed sensing at a relatively low computational cost for general observation matrix. It is known that the cost of l1-norm minimization using a…

Information Theory · Computer Science 2014-04-10 Koujin Takeda , Yoshiyuki Kabashima

In this paper, we consider the problem of multi-resolution compressed sensing (MR-CS) reconstruction, which has received little attention in the literature. Instead of always reconstructing the signal at the original high resolution (HR),…

Information Theory · Computer Science 2016-01-21 Xing Wang , Jie Liang

The problem of recovering a structured signal from its linear measurements in the presence of speckle noise is studied. This problem appears in many imaging systems such as synthetic aperture radar and optical coherence tomography. The…

Information Theory · Computer Science 2021-08-03 Wenda Zhou , Shirin Jalali , Arian Maleki

Recent breakthrough results in compressive sensing (CS) have established that many high dimensional signals can be accurately recovered from a relatively small number of non-adaptive linear observations, provided that the signals possess a…

Information Theory · Computer Science 2013-10-17 Akshay Soni , Jarvis Haupt

In this paper, we investigate power-constrained sensing matrix design in a sparse Gaussian linear dimensionality reduction framework. Our study is carried out in a single--terminal setup as well as in a multi--terminal setup consisting of…

Information Theory · Computer Science 2015-10-28 Amirpasha Shirazinia , Subhrakanti Dey

To recover a sparse signal from an underdetermined system, we often solve a constrained L1-norm minimization problem. In many cases, the signal sparsity and the recovery performance can be further improved by replacing the L1 norm with a…

Computation · Statistics 2012-08-06 M. Salman Asif , Justin Romberg

A new reweighted l1-norm penalized least mean square (LMS) algorithm for sparse channel estimation is proposed and studied in this paper. Since standard LMS algorithm does not take into account the sparsity information about the channel…

Information Theory · Computer Science 2014-05-09 Omid Taheri , Sergiy A. Vorobyov

We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy linear measurements. The sparsity pattern is assumed to…

Information Theory · Computer Science 2010-07-28 Namrata Vaswani

Model-based compressed sensing refers to compressed sensing with extra structure about the underlying sparse signal known a priori. Recent work has demonstrated that both for deterministic and probabilistic models imposed on the signal,…

Information Theory · Computer Science 2015-09-07 Sidhant Misra , Pablo A. Parrilo

The recovery of signals that are sparse not in a basis, but rather sparse with respect to an over-complete dictionary is one of the most flexible settings in the field of compressed sensing with numerous applications. As in the standard…

Information Theory · Computer Science 2021-10-01 Pedro Abdalla , Christian Kümmerle

The recently proposed modified-compressive sensing (modified-CS), which utilizes the partially known support as prior knowledge, significantly improves the performance of recovering sparse signals. However, modified-CS depends heavily on…

Information Theory · Computer Science 2012-07-10 Jun Zhang , Yuanqing Li , Zhu Liang Yu , Zhenghui Gu

The channel estimation is one of important techniques to ensure reliable broadband signal transmission. Broadband channels are often modeled as a sparse channel. Comparing with traditional dense-assumption based linear channel estimation…

Information Theory · Computer Science 2014-07-24 Guan Gui , Li Xu , Fumiyuki Adachi

Reconstructing continuous signals from a small number of discrete samples is a fundamental problem across science and engineering. In practice, we are often interested in signals with 'simple' Fourier structure, such as bandlimited,…

Data Structures and Algorithms · Computer Science 2018-12-24 Haim Avron , Michael Kapralov , Cameron Musco , Christopher Musco , Ameya Velingker , Amir Zandieh

Conventional algorithms for sparse signal recovery and sparse representation rely on $l_1$-norm regularized variational methods. However, when applied to the reconstruction of $\textit{sparse images}$, i.e., images where only a few pixels…

Computer Vision and Pattern Recognition · Computer Science 2016-05-09 Sohil Shah , Tom Goldstein , Christoph Studer

In this paper, we expand the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction of an arbitrary number of non-zero parameters to be recovered. The topic touches on the concept of exact…

Information Theory · Computer Science 2026-05-08 Joonas Lahtinen

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

Compressed sensing is a recent set of mathematical results showing that sparse signals can be exactly reconstructed from a small number of linear measurements. Interestingly, for ideal sparse signals with no measurement noise, random…

Information Theory · Computer Science 2009-01-28 Hyun Sung Chang , Yair Weiss , William T. Freeman

We first propose a novel criterion that guarantees that an $s$-sparse signal is the local minimizer of the $\ell_1/\ell_2$ objective; our criterion is interpretable and useful in practice. We also give the first uniform recovery condition…

Numerical Analysis · Mathematics 2021-01-29 Yiming Xu , Akil Narayan , Hoang Tran , Clayton G. Webster

In this paper, we propose a method for image block loss restoration based on the notion of sparse representation. We use the sparsity pattern as side information to efficiently restore block losses by iteratively imposing the constraints of…

Multimedia · Computer Science 2016-08-30 Hossein Hosseini , Ali Goli , Neda Barzegar Marvasti , Masoume Azghani , Farokh Marvasti
‹ Prev 1 8 9 10 Next ›