English
Related papers

Related papers: Dynamic Updating for L1 Minimization

200 papers

It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we…

Methodology · Statistics 2007-11-13 Emmanuel J. Candes , Michael B. Wakin , Stephen P. Boyd

Most of the existing methods for sparse signal recovery assume a static system: the unknown signal is a finite-length vector for which a fixed set of linear measurements and a sparse representation basis are available and an L1-norm…

Information Theory · Computer Science 2013-06-17 M. Salman Asif , Justin Romberg

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

This paper studies the convergence rate of a continuous-time dynamical system for L1-minimization, known as the Locally Competitive Algorithm (LCA). Solving L1-minimization} problems efficiently and rapidly is of great interest to the…

Dynamical Systems · Mathematics 2017-04-26 Aurèle Balavoine , Christopher J. Rozell , Justin Romberg

Compressed sensing has shown that it is possible to reconstruct sparse high dimensional signals from few linear measurements. In many cases, the solution can be obtained by solving an L1-minimization problem, and this method is accurate…

Numerical Analysis · Mathematics 2009-04-27 Deanna Needell

Compressed sensing aims at reconstructing sparse signals from significantly reduced number of samples, and a popular reconstruction approach is $\ell_1$-norm minimization. In this correspondence, a method called orthonormal expansion is…

Information Theory · Computer Science 2015-05-30 Zai Yang , Cishen Zhang , Jun Deng , Wenmiao Lu

Recent research has shown that performance in signal processing tasks can often be significantly improved by using signal models based on sparse representations, where a signal is approximated using a small number of elements from a fixed…

Optimization and Control · Mathematics 2011-11-18 Adam S. Charles , Pierre Garrigues , Christopher J. Rozell

Compressive sensing(CS) has drawn much attention in recent years due to its low sampling rate as well as high recovery accuracy. As an important procedure, reconstructing a sparse signal from few measurement data has been intensively…

Information Theory · Computer Science 2018-06-25 Yicong He , Fei Wang , Shiyuan Wang , Badong Chen

Phase retrieval refers to a classical nonconvex problem of recovering a signal from its Fourier magnitude measurements. Inspired by the compressed sensing technique, signal sparsity is exploited in recent studies of phase retrieval to…

Computational Physics · Physics 2013-02-04 Zai Yang , Cishen Zhang , Lihua Xie

Despite the importance of sparsity signal models and the increasing prevalence of high-dimensional streaming data, there are relatively few algorithms for dynamic filtering of time-varying sparse signals. Of the existing algorithms, fewer…

Statistics Theory · Mathematics 2016-11-03 Adam Charles , Aurele Balavoine , Christopher Rozell

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

Based on the methodological similarity between sparse signal reconstruction and system identification, a new approach for sparse signal reconstruction in compressive sensing (CS) is proposed in this paper. This approach employs a stochastic…

Information Theory · Computer Science 2015-06-15 Jian Jin , Yuantao Gu , Shunliang Mei

Compressed sensing (CS) demonstrates that a sparse, or compressible signal can be acquired using a low rate acquisition process below the Nyquist rate, which projects the signal onto a small set of vectors incoherent with the sparsity…

Information Theory · Computer Science 2014-02-25 Yuli Sun , Jinxu Tao

Compressed sensing (CS) shows that a signal having a sparse or compressible representation can be recovered from a small set of linear measurements. In classical CS theory, the sampling matrix and representation matrix are assumed to be…

Information Theory · Computer Science 2015-07-03 Yipeng Liu

In this paper we consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is…

Information Theory · Computer Science 2012-11-22 Mohammad Golbabaee , Pierre Vandergheynst

We propose and analyze an online algorithm for reconstructing a sequence of signals from a limited number of linear measurements. The signals are assumed sparse, with unknown support, and evolve over time according to a generic nonlinear…

Optimization and Control · Mathematics 2015-03-12 Joao F. C. Mota , Nikos Deligiannis , Aswin C. Sankaranarayanan , Volkan Cevher , Miguel R. D. Rodrigues

This paper introduces a novel approach for recovering sparse signals using sorted L1/L2 minimization. The proposed method assigns higher weights to indices with smaller absolute values and lower weights to larger values, effectively…

Numerical Analysis · Mathematics 2023-08-09 Chao Wang , Ming Yan , Junjie Yu

Sparse signals can be recovered from a reduced set of samples by using compressive sensing algorithms. In common methods the signal is recovered in the sparse domain. A method for the reconstruction of sparse signal which reconstructs the…

Information Theory · Computer Science 2015-04-28 Ljubisa Stankovic , Milos Dakovic

Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm…

Information Theory · Computer Science 2012-06-05 Yipeng Liu , Ivan Gligorijevic , Vladimir Matic , Maarten De Vos , Sabine Van Huffel

Compressed Sensing (CS) is an effective approach to reduce the required number of samples for reconstructing a sparse signal in an a priori basis, but may suffer severely from the issue of basis mismatch. In this paper we study the problem…

Information Theory · Computer Science 2014-02-04 Yuejie Chi
‹ Prev 1 2 3 10 Next ›