Exact localization and superresolution with noisy data and random illumination

Inverse Problems

Volumn 27, Issue 6, 2011, Pages

  Fannjiang, Albert C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIPLE OBJECTS; NOISY DATA; NUMBER OF DATUM; NUMERICAL EVIDENCE; PERFORMANCE GUARANTEES; RANDOM ILLUMINATION; RANDOM PROBES; RAYLEIGH; RESOLUTION LIMITS; SUPER RESOLUTION; THRESHOLDING;

PROBES;

OPTICAL RESOLVING POWER;

EID: 79957951941     PISSN: 02665611     EISSN: 13616420     Source Type: Journal    
DOI: 10.1088/0266-5611/27/6/065012     Document Type: Article

References (42)

1. Almoro P F, Pedrini G, Gundu P N, Osten W and Hanson S G 2011 Enhanced wavefront reconstruction by random phase modulation with a phase diffuser Opt. Laser Eng. 49 252-7
2. Baggeroer A B, Kuperman W A and Mikhalevsky P N 1993 An overview of matched field methods in ocean acoustics IEEE J. Ocean. Eng. 18 401-24
3. Bajwa W, Calderbank R and Jafarpour S 2010 Why Gabor Frames? Two fundamental measures of coherence and their role in model selection J. Commun. Net. 12 289-307
4. Baraniuk R, Davenport M, DeVore R and Wakin M 2008 A simple proof of the restricted isometry property for random matrices Constructive Approx. 28 253-63
5. Barron A, Birgé L and Massart P 1999 Risk bounds for model selection via penalization Probab. Theory Relat. Fields 113 301-413
6. Birgé L and Massart P 2001 Gaussian model selection J. Eur. Math. Soc. 3 203-68
7. Brady D J, Choi K, Marks D L, Horisaki R and Lim S 2009 Compressive holography Opt. Express 17 13040-9
8. Bräuer R, Wojak U, Wyrowski F and Bryngdahl O 1991 Digital diffusers for optical holography Opt. Lett. 16 1427-9
9. Bruckstein A M, Donoho D L and Elad M 2009 From sparse solutions of systems of equations to sparse modeling of signals SIAM Rev. 51 34-81
10. Bunea F, Tsybakov A B and Wegkamp M H 2007 Sparsity oracle inequalities for the Lasso Electron. J. Stat. 1 169-94
11. Candès E J 2008 The restricted isometry property and its implications for compressed sensing C. R. Acad. Sci., Paris I 346 589-92
12. Candès E J and Plan Y 2009 Near-ideal model selection by l1 minimization Ann. Stat. 37 2145-77
13. Candès E J and Tao T 2005 Decoding by linear programming IEEE Trans. Inf. Theory 51 4203-15 (Pubitemid 41800353)
14. Chambolle A and Lions P-L 1997 Image recovery via total variation minimization and related problems Numer. Math. 76 167-88
15. Chen S S, Donoho D L and Saunders M A 1998 Atomic decomposition by basis pursuit SIAM J. Sci. Comput. 20 33-61 (Pubitemid 128689501)
16. Dai W and Milenkovic O 2009 Subspace pursuit for compressive sensing and reconstruction IEEE Trans. Inf. Theory 55 2230-49
17. Delsarte P, Goethals J M and Seidel J J 1975 Bounds for systems of lines and Jacobi poynomials Phil. Res. Rep. 30 91-105 issue in honour of C J Bouwkamp
18. Donoho D L, Elad M and Temlyakov V N 2006 Stable recovery of sparse overcomplete representations in the presence of noise IEEE Trans. Inf. Theory 52 6-18 (Pubitemid 43263116)
19. Duarte M, Davenport M, Takhar D, Laska J, Sun T, Kelly K and Baraniuk R 2008 Single-pixel imaging via compressive sampling IEEE Signal Process. Mag. 25 83-91
20. Fannjiang A C 2009 Compressive imaging of subwavelength structures SIAM J. Imag. Sci. 2 1277-91
21. Fannjiang A C 2010 Compressive inverse scattering: I. High-frequency SIMO/MISO and MIMO measurements Inverse Problems 26 035008
22. Fannjiang A C 2010 The MUSIC algorithm for sparse objects: a compressed sensing analysis arXiv:1006.1678
23. Fannjiang A and Solna K 2007 Broadband resolution analysis for imaging with measurement noise J. Opt. Soc. Am. A 24 1623-32 (Pubitemid 47049456)
24. Fannjiang A, Strohmer T and Yan P 2010 Compressed remote sensing of sparse objects SIAM J. Imaging Sci. 3 596-618
25. Feller W 1970 An Introduction to Probability Theory and its Applications vol II 2nd edn (New York: Wiley)
26. 1-constraint Ann. Stat. 34 2367-86
27. Hoeffding W 1963 Probability inequalities for sums of bounded random variables J. Am. Stat. Assoc. 58 13-30
28. Meinshausen N and Bühlmann P 2006 High-dimensional graphs and variable selection with the Lasso Ann. Stat. 34 1436-62 (Pubitemid 44231168)
29. Rauhut H 2008 Stability results for random sampling of sparse trigonometric polynomials IEEE Trans. Inf. Theory 54 5661-70
30. Romberg J 2009 Compressive sensing by random convolution SIAM J. Imaging Sci. 2 1098-128
31. Rudin L I, Osher S and Fatemi E 1992 Nonlinear total variation based noise removal algorithms Physica D 60 259-68
32. Senatov V V 1998 Normal Approximation: New Results, Methods, and Problems (Utrecht: Walter de Gruyter)
33. Shahram M and Milanfar P 2004 Imaging below the diffraction limit: a statistical analysis IEEE Trans. Image Process. 13 677-89
34. Shirai T and Wolf E 2004 Coherence and polarization of electromagnetic beams modulated by random phase screens and their changes on propagation in free space J. Opt. Soc. A 21 1907-16
35. Tibshirani R 1996 Regression shrinkage and selection via the lasso J. R. Stat. Soc. B 58 267-88
36. Tolstoy A 1993 Matched Field Processing in Underwater Acoustics (Singapore: World Scientific)
37. Tropp J A 2004 Greed is good: algorithmic results for sparse approximation IEEE Trans. Inf. Theory 50 2231-42
38. Tropp J A 2006 Just relax: convex programming methods for identifying sparse signals in noise IEEE Trans. Inf. Theory 52 1030-51 (Pubitemid 46444890)
39. Tropp J A 2009 IEEE Trans. Inf. Theory 55 917-8 (corrigendum)
40. Tropp J A 2008 On the conditioning of random subdictionaries Appl. Comput. Harmon. Anal. 25 1-24 (Pubitemid 351721018)
41. Welch L 1974 Lower bounds on the maximum cross-correlation of signals IEEE Trans. Inf. Theory 20 397-9
42. Zhao P and Yu B 2006 On model selection consistency of Lasso J. Mach. Learn. Res. 7 2541-63 (Pubitemid 44866738)