Imaging with highly incomplete and corrupted data

DOI10.1088/1361-6420/AB5A21MaRDI QIDQ5220309zbMATH OpenOpenAlexFDO

Authors M. Moscoso, Alexei Novikov, Chrysoula Tsogka, George Papanicolaou

Publication date 16 March 2020

Published in Inverse Problems (Search for Journal in Brave)

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

zbMATH Keywords

\(\ell_1\)-norm minimizationarray imaginghighly corrupted data

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Abstract: We consider the problem of imaging sparse scenes from a few noisy data using an $l_1$-minimization approach. This problem can be cast as a linear system of the form $A,ho=b$, where $A$ is an $NimesK$ measurement matrix. We assume that the dimension of the unknown sparse vector $hoin{mathbbC}^K$ is much larger than the dimension of the data vector $bin{mathbbC}^N$, i.e, $KggN$. We provide a theoretical framework that allows us to examine under what conditions the $el{l}_1$-minimization problem admits a solution that is close to the exact one in the presence of noise. Our analysis shows that $l_1$-minimization is not robust for imaging with noisy data when high resolution is required. To improve the performance of $l_1$-minimization we propose to solve instead the augmented linear system $[A,|,C]ho=b$, where the $NimesSigma$ matrix $C$ is a noise collector. It is constructed so as its column vectors provide a frame on which the noise of the data, a vector of dimension $N$, can be well approximated. Theoretically, the dimension $Sigma$ of the noise collector should be $e^N$ which would make its use not practical. However, our numerical results illustrate that robust results in the presence of noise can be obtained with a large enough number of columns $Sigmaapprox10K$.

Recommendations

• Data structures for robust multifrequency imaging
• _1 minimization with noisy data
• Robust imaging of localized scatterers using the singular value decomposition and _1 minimization
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution
• Signal recovery from incomplete measurements in the presence of outliers

Cites work

• A differential equations approach to \(l_{1}\)-minimization with applications to array imaging
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A multiple measurement vector approach to synthetic aperture radar imaging
• A new approach to variable selection in least squares problems
• Coherence pattern-guided compressive sensing with unresolved grids
• Compressed remote sensing of sparse objects
• Entropic regularization of the \(\ell _{0}\) function
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Gradient methods for minimizing composite functions
• High-Resolution Radar via Compressed Sensing
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• scientific article; zbMATH DE number 2079074 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Imaging strong localized scatterers with sparsity promoting optimization
• Incremental subgradient methods for nondifferentiable optimization
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Just relax: convex programming methods for identifying sparse signals in noise
• Least angle regression. (With discussion)
• Mathematics of multidimensional seismic imaging, migration, and inversion
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Resolution analysis of imaging with _1 optimization
• Robust imaging of localized scatterers using the singular value decomposition and _1 minimization
• Sparse representations in unions of bases
• Stable recovery of sparse overcomplete representations in the presence of noise
• Stable signal recovery from incomplete and inaccurate measurements
• Superresolution via Sparsity Constraints
• The interior-point revolution in optimization: History, recent developments, and lasting consequences
• Towards a Mathematical Theory of Super‐resolution

Cited in

(3)

• Computational inverse problems for partial differential equations. Abstracts from the workshop held December 6--12, 2020 (hybrid meeting)
• Data structures for robust multifrequency imaging
• The Noise Collector for sparse recovery in high dimensions

Describes a project that uses

Uses Software

• BLOOMP

This page was built for publication: Imaging with highly incomplete and corrupted data

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