Remote sensing via _1-minimization

DOI10.1007/S10208-013-9157-9zbMATH Open1298.65100arXiv1205.1366OpenAlexW1976675278MaRDI QIDQ404256FDOQ404256

Max Hügel, Thomas Strohmer, Holger Rauhut

Publication date: 4 September 2014

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

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.

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

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

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)

Cites Work

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

Cited In (8)

• Compressive Sensing
• One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
• Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery
• Adventures in Compressive Sensing Based MIMO Radar
• Title not available (Why is that?)
• Refined analysis of sparse MIMO radar
• Improved bounds for sparse recovery from subsampled random convolutions
• Block matching video compression based on sparse representation and dictionary learning

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)