English
Related papers

Related papers: Remote sensing via $\ell_1$ minimization

200 papers

Sparsity promoting regularization is an important technique for signal reconstruction and several other ill-posed problems. Theoretical investigation typically bases on the assumption that the unknown solution has a sparse representation…

Numerical Analysis · Mathematics 2013-11-11 Jens Flemming , Markus Hegland

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

A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N by N grid. Assuming the number of targets K is small (i.e., K much less than N^2), then we can transmit a sufficiently "incoherent"…

Numerical Analysis · Mathematics 2015-05-13 Matthew A. Herman , Thomas Strohmer

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

We consider the inverse elastic scattering problems using the far field data due to one incident plane wave. A simple method is proposed to reconstruct the location and size of the obstacle using different components of the far field…

Analysis of PDEs · Mathematics 2019-04-09 J Liu , X. Liu , J. Sun

In this paper, based on a successively accuracy-increasing approximation of the $\ell_0$ norm, we propose a new algorithm for recovery of sparse vectors from underdetermined measurements. The approximations are realized with a certain class…

Information Theory · Computer Science 2016-11-03 Mohammadreza Malek-Mohammadi , Ali Koochakzadeh , Massoud Babaie-Zadeh , Magnus Jansson , Cristian R. Rojas

In this manuscript, we analyze the sparse signal recovery (compressive sensing) problem from the perspective of convex optimization by stochastic proximal gradient descent. This view allows us to significantly simplify the recovery analysis…

Data Structures and Algorithms · Computer Science 2013-04-19 Rong Jin , Tianbao Yang , Shenghuo Zhu

In this paper, we consider the problem of sparse signal detection based on partial support set estimation with compressive measurements in a distributed network. Multiple nodes in the network are assumed to observe sparse signals which…

Applications · Statistics 2016-08-10 Thakshila Wimalajeewa , Pramod K. Varshney

This work is about recovering an analysis-sparse vector, i.e. sparse vector in some transform domain, from under-sampled measurements. In real-world applications, there often exist random analysis-sparse vectors whose distribution in the…

Information Theory · Computer Science 2022-12-29 Raziyeh Takbiri , Sajad Daei

The goal of this paper is to find a low-rank approximation for a given tensor. Specifically, we give a computable strategy on calculating the rank of a given tensor, based on approximating the solution to an NP-hard problem. In this paper,…

Numerical Analysis · Mathematics 2016-10-20 Xiaofei Wang , Carmeliza Navasca

We consider scattered data approximation in samplet coordinates with $\ell_1$-regularization. The application of an $\ell_1$-regularization term enforces sparsity of the coefficients with respect to the samplet basis. Samplets are…

Machine Learning · Statistics 2024-04-03 Davide Baroli , Helmut Harbrecht , Michael Multerer

It is well known that $\ell_1$ minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity, as a function of the ratio between the system dimensions,…

Information Theory · Computer Science 2010-04-06 M. Amin Khajehnejad , Weiyu Xu , Salman Avestimehr , Babak Hassibi

In this paper we look at a well known linear inverse problem that is one of the mathematical cornerstones of the compressed sensing field. In seminal works \cite{CRT,DOnoho06CS} $\ell_1$ optimization and its success when used for recovering…

Information Theory · Computer Science 2015-07-17 Mihailo Stojnic

Compressed sensing deals with the recovery of sparse signals from linear measurements. Without any additional information, it is possible to recover an $s$-sparse signal using $m \gtrsim s \log(d/s)$ measurements in a robust and stable way.…

Functional Analysis · Mathematics 2016-05-25 Axel Flinth

Compressed sensing shows that a sparse signal can stably be recovered from incomplete linear measurements. But, in practical applications, some signals have additional structure, where the nonzero elements arise in some blocks. We call such…

Information Theory · Computer Science 2023-11-29 Jianwen Huang , Hailin Wang , Feng Zhang , Jianjun Wang , Jinping Jia

In this paper, we investigate the theoretical guarantees of penalized $\lun$ minimization (also called Basis Pursuit Denoising or Lasso) in terms of sparsity pattern recovery (support and sign consistency) from noisy measurements with…

Information Theory · Computer Science 2011-09-13 Charles Dossal , Marie-Line Chabanol , Gabriel Peyré , Jalal Fadili

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

In remote control, efficient compression or representation of control signals is essential to send them through rate-limited channels. For this purpose, we propose an approach of sparse control signal representation using the compressive…

Systems and Control · Computer Science 2015-06-16 Masaaki Nagahara , Takahiro Matsuda , Kazunori Hayashi

This paper studies the problem of recovering a non-negative sparse signal $\x \in \Re^n$ from highly corrupted linear measurements $\y = A\x + \e \in \Re^m$, where $\e$ is an unknown error vector whose nonzero entries may be unbounded.…

Information Theory · Computer Science 2008-09-02 John Wright , Yi Ma

This paper is dedicated to design a direct sampling method of inverse electromagnetic scattering problems, which uses multi-frequency sparse backscattering far field data for reconstructing the boundary of perfectly conducting obstacles. We…

Analysis of PDEs · Mathematics 2020-10-28 Tilo Arens , Xia Ji , Xiaodong Liu