1. Imaging with highly incomplete and corrupted data
- Author
-
Chrysoula Tsogka, George Papanicolaou, Miguel Moscoso, Alexei Novikov, and Ministerio de Economía y Competitividad (España)
- Subjects
FOS: Computer and information sciences ,Computer Science - Machine Learning ,math.NA ,Highly corrupted data ,Dimension (graph theory) ,cs.LG ,FOS: Physical sciences ,010103 numerical & computational mathematics ,Approx ,01 natural sciences ,Noise (electronics) ,Sparse vector ,l(1)-norm minimization ,Theoretical Computer Science ,Machine Learning (cs.LG) ,Combinatorics ,Matrix (mathematics) ,FOS: Electrical engineering, electronic engineering, information engineering ,FOS: Mathematics ,Mathematics - Numerical Analysis ,0101 mathematics ,cs.NA ,Mathematical Physics ,Mathematics ,Materiales ,Applied Mathematics ,Linear system ,Image and Video Processing (eess.IV) ,Sigma ,Numerical Analysis (math.NA) ,Química ,Electrical Engineering and Systems Science - Image and Video Processing ,Computational Physics (physics.comp-ph) ,Pure Mathematics ,Computer Science Applications ,010101 applied mathematics ,physics.comp-ph ,L1-norm minimization ,Signal Processing ,Array imaging ,eess.IV ,Novikov self-consistency principle ,Physics - Computational Physics - Abstract
We consider the problem of imaging sparse scenes from a few noisy data using an L1-minimization approach. This problem can be cast as a linear system of the form Ap = b, where A is an N x K measurement matrix. We assume that the dimension of the unknown sparse vector p E Ck is much larger than the dimension of the data vector b E Cn, i.e. K >>N. We provide a theoretical framework that allows us to examine under what conditions the L1-minimization problem admits a solution that is close to the exact one in the presence of noise. Our analysis shows that L1-minimization is not robust for imaging with noisy data when high resolution is required. To improve the performance of L1-minimization we propose to solve instead the augmented linear system [A|C]p = b, where the N = Σ 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 Σ of the noise collector should be eN 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 Σ~10K. Part of this material is based upon work supported by the National Science Foundation under Grant No. DMS-1439786 while the authors were in residence at the Institute for Computational and Experimental Research in Mathematics (ICERM) in Providence, RI, during the Fall 2017 semester. The work of M Moscoso was partially supported by Spanish MICINN grant FIS2016-77892-R. The work of A Novikov was partially supported by NSF grants DMS-1515187, DMS-1813943. The work of C Tsogka was partially supported by AFOSR FA9550-17-1-0238.
- Published
- 2020
- Full Text
- View/download PDF