Quasi-linear compressed sensing

Multiscale Modeling and Simulation

Volumn 12, Issue 2, 2014, Pages 725-754

  Ehler, Martin ^a   Fornasier, Massimo ^b   Sigl, Juliane ^b  

^a UNIVERSITY OF VIENNA   (Austria)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Compressed sensing; Greedy algorithm; Iterative thresholding; Quasi linear; Restricted isometry property

Indexed keywords

ALGORITHMS; COMPRESSED SENSING; MATRIX ALGEBRA; PHASE SHIFTERS; RECOVERY; SIGNAL RECONSTRUCTION;

ALTERNATIVE ALGORITHMS; GENERALIZED ORTHOGONAL; GREEDY ALGORITHMS; ITERATIVE THRESHOLDING; QUASI-LINEAR; REAL-LIFE APPLICATIONS; RESTRICTED ISOMETRY PROPERTIES; RESTRICTED ISOMETRY PROPERTIES (RIP);

ITERATIVE METHODS;

EID: 84903987479     PISSN: 15403459     EISSN: 15403467     Source Type: Journal    
DOI: 10.1137/130929928     Document Type: Article

References (51)

1. C. Aerts, J. Christensen-Dalsgaard, and D. W. Kurtz, Asteroseismology, Springer, Berlin, 2010.
2. C. Bachoc and M. Ehler, Signal Reconstruction from the Magnitude of Subspace Components, preprint, arXiv:1209.5986, 2013.
3. B. Bah and J. Tanner, Improved bounds on restricted isometry constants for Gaussian matrices, SIAM J. Matrix Anal. Appl., 31 (2010), pp. 2882-2898.
4. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, A simple proof of the restricted isometry property for random matrices, Constr. Approx., 28 (2008), pp. 253-263.
5. F. Barning, The numerical analysis of the light-curve of 12 lacertae, Bull. Astron. Inst. Netherlands, 17 (1963), pp. 22-28.
6. H. H. Bauschke, P. L. Combettes, and D. R. Luke, Phase retrieval, error reduction algorithm, and Fienup variants: A view from convex optimization, J. Opt. Soc. Amer. A, 19 (2002), pp. 1334-1345.
7. A. Beck and Y. C. Eldar, Sparsity constrained nonlinear optimization: Optimality conditions and algorithms, SIAM J. Optim., 23 (2013), pp. 1480-1509.
8. J. D. Blanchard, C. Cartis, J. Tanner, and A. Thompson, Phase transitions for greedy sparse approximation algorithms, Appl. Comput. Harmon. Anal., 30 (2011), pp. 188-203.
9. T. Blumensath, Compressed Sensing with Nonlinear Observations and Related Nonlinear Optimisation Problems, preprint, arXiv:1205.1650v1, 2012.
10. T. Blumensath and M. E. Davies, Gradient pursuit for non-linear sparse signal modelling, in Proceedings of the European Signal Processing Conference (EUSIPCO), Lausanne, Switzerland, 2008.
11. T. Blumensath and M. E. Davies, Iterative hard thresholding for compressed sensing, Appl. Comput. Harmon. Anal., 27 (2009), pp. 265-274.
12. E. J. Candes, J. Romberg, and T. Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, 52 (2006), pp. 489-509. (Pubitemid 43174093)
13. E. J. Candès, J. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math., 59 (2006), pp. 1207-1223.
14. E. J. Candès, T. Strohmer, and V. Voroninski, PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming, Comm. Pure Appl. Math., 66 (2013), pp. 1241-1274.
15. E. J. Candès and T. Tao, Decoding by linear programming, IEEE Trans. Inform. Theory, 51 (2005), pp. 4203-4215.
16. E. J. Candès and T. Tao, Near-optimal signal recovery from random projections: Universal encoding strategies, IEEE Trans. Inform. Theory, 52 (2006), pp. 5406-5425.
17. A. Cohen, R. A. DeVore, G. Petrova, and P. Wojtaszczyk, Finding the minimum of a function, Methods Appl. Anal., 20 (2013), pp. 365-382.
18. S. Dasgupta and A. Gupta, An elementary proof of a theorem of Johnson and Lindenstrauss, Random Structures Algorithms, 22 (2003), pp. 60-65.
19. I. Daubechies, M. Defrise, and C. DeMol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Comm. Pure Appl. Math., 57 (2004), pp. 1413- 1541.
20. M. A. Davenport and M. B. Wakin, Analysis of orthogonal matching pursuit using the restricted isometry property, IEEE Trans. Inform. Theory, 56 (2010), pp. 4395-4401.
21. R. A. DeVore, Nonlinear approximation, in Acta Numerica, Acta Numer. 7, Cambridge University Press, Cambridge, UK, 1998, pp. 51-150.
22. D. L. Donoho, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306.
23. J. Drenth, Principles of Protein X-Ray Crystallography, Springer, New York, 2010.
24. Y. C. Eldar and S. Mendelson, Phase Retrieval: Stability and Recovery Guarantees, preprint, arXiv:1211.0872, 2012.
25. J. R. Fienup, Phase retrieval algorithms: A comparison, Applied Optics, 21 (1982), pp. 2758- 2769.
26. M. Fornasier, ed., Theoretical Foundations and Numerical Methods for Sparse Recovery, Radon Ser. Comput. Appl. Math. 9, De Gruyter, Berlin, 2010.
27. M. Fornasier and H. Rauhut, Iterative thresholding algorithms, Appl. Comput. Harmon. Anal., 25 (2008), pp. 187-208.
28. M. Fornasier and H. Rauhut, Recovery algorithms for vector-valued data with joint sparsity constraints, SIAM J. Numer. Anal., 46 (2008), pp. 577-613.
29. S. Foucart and H. Rauhut, A Mathematical Introduction to Compressive Sensing, Birkhäuser/Springer, New York, 2013.
30. R. W. Gerchberg and W. O. Saxton, A practical algorithm for the determination of the phase from image and diffraction plane pictures, Optik, 35 (1972), pp. 237-246.
31. D. Goldfarb and S. Ma, Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization, preprint, arXiv:0906.3499v4, 2010.
32. X. Li and V. Voroninski, Sparse signal recovery from quadratic measurements via convex programming, SIAM J. Math. Anal., 45 (2013), pp. 3019-3033.
33. S. Mallat and Z. Zhang, Matching pursuits with time-frequency dictionaries, IEEE Trans. Signal Process., 41 (1993), pp. 3397-3415.
34. D. Needell and J. Tropp, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Appl. Comput. Harmon. Anal., 28 (2009), pp. 301-321.
35. J. Nocedal and S.Wright, Numerical Optimization, 2nd ed., Springer Ser. Oper. Res. Financ. Eng., Springer, New York, 2006.
36. H. Ohlsson, A. Y. Yang, R. Dong, and S. S. Sastry, Compressive Phase Retrieval from Squared Output Measurements via Semidefinite Programming, preprint, arXiv:1111. 6323v3, 2012.
37. H. Ohlsson and Y. Eldar, On Conditions for Uniqueness in Sparse Phase Retrieval, preprint, arXiv:1308.5447, 2013.
38. M. R. Osborne, Finite Algorithms in Optimization and Data Analysis, Wiley Series Probab. Stat., Wiley, Hoboken, NJ, 1985.
39. G. Pfander, H. Rauhut, and J. Tropp, The restricted isometry property for time-frequency structured random matrices, Probab. Theory Related Fields, 156 (2013), pp. 707-737.
40. R. Ramlau and G. Teschke, A projection iteration for nonlinear operator equations with sparsity constraints, Numer. Math., 104 (2006), pp. 177-203. (Pubitemid 44421163)
41. R. Ramlau and G. Teschke, An iterative algorithm for nonlinear inverse problems with joint sparsity constraints in vector valued regimes and an application to color image inpainting, Inverse Problems, 23 (2007), pp. 1851-1870. (Pubitemid 47315660)
42. H. Rauhut, J. Romberg, and J. Tropp, Restricted isometries for partial random circulant matrices, Appl. Comput. Harmon. Anal., 32 (2012), pp. 242-254.
43. H. Rauhut, K. Schnass, and P. Vandergheynst, Compressed sensing and redundant dictionaries, IEEE Trans. Inform. Theory, 54 (2008), pp. 2210-2219. (Pubitemid 351689557)
44. B. Recht, M. Fazel, and P. Parillo, Guaranteed minimum rank solutions of linear matrix equations via nuclear norm minimization, SIAM Rev., 52 (2010), pp. 471-501.
45. B. Seifert, H. Stolz, M. Donatelli, D. Langemann, and M. Tasche, Multilevel Gauss- Newton methods for phase retrieval problems, J. Phys. A, 39 (2006), pp. 4191-4206. (Pubitemid 43529015)
46. Y. Shechtman, A. Beck, and Y. C. Eldar, GESPAR: Efficient Phase Retrieval of Sparse Signals, preprint, arXiv:1301.1018, 2013.
47. J. Sigl, Quasilinear Compressed Sensing, Master's thesis, Technische Universität München, Munich, Germany, 2013.
48. C. Soussen, R. Gribonval, J. Idier, and C. Herzet, Sparse Recovery Conditions for Orthogonal Least Squares, Tech. report, arXiv:1111.0522v1, 2011.
49. V. N. Temlyakov and P. Zheltov, On performance of greedy algorithms, J. Approx. Theory, 163 (2011), pp. 1134-1145.
50. J. A. Tropp, Greed is good: Algorithmic results for sparse approximation, IEEE Trans. Inform. Theory, 50 (2004), pp. 2331-2242.
51. R. Vershynin, Introduction to the non-asymptotic analysis of random matrices, in Compressed Sensing, Theory and Applications, Y. Eldar and G. Kutyniok, eds., Cambridge University Press, Cambridge, UK, 2012, pp. 210-268.