Remote sensing via _1-minimization

DOI10.1007/S10208-013-9157-9MaRDI QIDQ404256zbMATH OpenOpenAlexFDO

Authors Max Hügel, Holger Rauhut, Thomas Strohmer

Publication date 4 September 2014

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1205.1366

zbMATH Keywords

regularizationnumerical resultssparsitycondition numberinverse scatteringrandom matricescompressive sensingsignals\(\ell_1\)-minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (algebraic aspects) (15B52) Stochastic programming (90C15) Numerical computation of matrix norms, conditioning, scaling (65F35) Inverse problems (including inverse scattering) in optics and electromagnetic theory (78A46)

Abstract: We consider the problem of detecting the locations of targets in the far field by sending probing signals from an antenna array and recording the reflected echoes. Drawing on key concepts from the area of compressive sensing, we use an $el{l}_1$-based regularization approach to solve this, in general ill-posed, inverse scattering problem. As common in compressed sensing, we exploit randomness, which in this context comes from choosing the antenna locations at random. With $n$ antennas we obtain $n^2$ measurements of a vector $xin{C}^N$ representing the target locations and reflectivities on a discretized grid. It is common to assume that the scene $x$ is sparse due to a limited number of targets. Under a natural condition on the mesh size of the grid, we show that an $s$-sparse scene can be recovered via $el{l}_1$-minimization with high probability if $n^{2}geqCslo{g}^2(N)$. The reconstruction is stable under noise and under passing from sparse to approximately sparse vectors. Our theoretical findings are confirmed by numerical simulations.

Recommendations

• Compressed remote sensing of sparse objects
• Compressive inverse scattering. I: High-frequency SIMO/MISO and MIMO measurements
• Robust imaging of localized scatterers using the singular value decomposition and \(\ell_1\) minimization
• Resolution analysis of imaging with \(\ell_1\) optimization
• Stable Recovery of Sparse Signals Via Regularized Minimization

Cites work

• scientific article; zbMATH DE number 429531 (Why is no real title available?)
• scientific article; zbMATH DE number 700090 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A Probabilistic and RIPless Theory of Compressed Sensing
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Atomic Decomposition by Basis Pursuit
• Compressed remote sensing of sparse objects
• Compressed sensing
• Compressive sensing
• Compressive sensing and structured random matrices
• Invertibility of random submatrices via tail-decoupling and a matrix Chernoff inequality
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• On Sparse Representations in Arbitrary Redundant Bases
• On sparse reconstruction from Fourier and Gaussian measurements
• On the size of incoherent systems
• Principles of Optics
• Random sampling of sparse trigonometric polynomials
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse Approximate Solutions to Linear Systems
• Sparsity in time-frequency representations
• Stable signal recovery from incomplete and inaccurate measurements
• The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Theory and applications of time reversal and interferometric imaging
• User-friendly tail bounds for sums of random matrices

Cited in

(15)

• Compressive Sensing
• Block matching video compression based on sparse representation and dictionary learning
• Compressive inverse scattering. I: High-frequency SIMO/MISO and MIMO measurements
• Adventures in compressive sensing based MIMO radar
• scientific article; zbMATH DE number 4166792 (Why is no real title available?)
• Compressed remote sensing of sparse objects
• Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery
• Improved bounds for sparse recovery from subsampled random convolutions
• Data structures for robust multifrequency imaging
• Sparse channel separation using random probes
• Resolution analysis of imaging with \(\ell_1\) optimization
• Robust imaging of localized scatterers using the singular value decomposition and \(\ell_1\) minimization
• Refined analysis of sparse MIMO radar
• Far field splitting by iteratively reweighted \(\ell^1\) minimization
• One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations

Describes a project that uses

Uses Software

• PDCO

This page was built for publication: Remote sensing via \(\ell_1\)-minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404256)