Signal recovery from incomplete measurements in the presence of outliers

Inverse Problems and Imaging

Volumn 1, Issue 4, 2007, Pages 661-672

  Popilka, Björn ^a   Setzer, Simon ^a   Steidl, Gabriele ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

Compressed sensing; Outlier noise; Signal recovery; Sparsity; Total variation denoising; 1 minimization

Indexed keywords

EID: 77949735208     PISSN: 19308337     EISSN: 19308345     Source Type: Journal    
DOI: 10.3934/ipi.2007.1.661     Document Type: Article

References (31)

1. J. F. Aujol, G. Aubert, L. Blanc-Féraud and A. Chambolle, Image decomposition into a bounded variation component and an oscillating component, Journal of Mathematical Imaging and Vision, 22 (2005), 71–88.
2. J. F. Aujol and A. Chambolle, Dual norms and image decomposition models, Technical Report 5130, INRIA Report, Sophia Antipolis Cedex, France, 2004.
3. J.-F. Aujol, G. Gilboa, T. Chan and S. Osher, Structure–texture image decomposition – modelling, algorithms and parameter selection, International Journal of Computer Vision, 67 (2006), 111–136.
4. 1-unified variational framework for image restauration, in “Proc. European Conference on Computer Vision” (eds. T. Pajdla and J. Matas), 3024 of Lecture Notes in Computer Science, Prague, Springer, (2004), 1–13.
5. K. Bredies, D. A. Lorenz and P. Maass, Equivalence of a generalized conditional gradient method and the method of surrogate functionals, Technical report, Preprint, University of Bremen, 2005.
6. E. J. Candes and P. A. Randall, Highly robust error correction against gross and small errors, Technical report, Preprint, Caltech, 2006.
7. E. J. Candes, J. Romberg and T. Tao, Robust uncertainty principles: exact signal recovery from highly incomplete frequency information, IEEE Transactions on Information Theory, 52 (2006), 489–509.
8. E. J. Candes, J. Romberg and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math., 59 (2006), 1207–1223.
9. E. J. Candes and T. Tao, Decoding by linear programming, IEEE Transactions on Information Theory, 51 (2005), 4203–4215.
10. E. J. Candes and T. Tao, Near optimal signal recovery from random projections: universal encoding strategies?, IEEE Transactions on Information Theory, 52 (2006), 5406–5425.
11. E. J. Candes and T. Tao, The dantzig selector: statistical estimation when p is much larger than n, Annals of Statistics, to appear.
12. E. J. Candes and T. Tao, Error correction via linear programming, in “Proc. 46th Annual IEEE Symposium on Foundations of Computer Science”, IEEE, (2005), 295–308.
13. A. Chambolle, An algorithm for total variation minimization and applications, Journal of Mathematical Imaging and Vision, 20 (2004), 89–97.
14. 1 function approximation, SIAM Journal on Applied Mathematics, 65 (2005), 1817–1837.
15. I. Daubechies, M. Defrise and C. De Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Comm. Pure Appl. Math., 57 (2004), 1413–1457.
16. 1 minimization, Proceedings of the National Academy of Sciences, 100 (2003), 2197–2202.
17. D. L. Donoho, M. Elad and V. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Transactions on Information Theory, 52 (2006), 6–18.
18. 1 norms for image restoration, SIAM Journal on Scientific Computing, 27 (2006), 1881–1902.
19. J. J. Fuchs, On sparse representations in arbitrary redundant bases, IEEE Transactions on Information Theory, 50 (2004), 1341–1344.
20. J. J. Fuchs, Recovery of exact sparse representations in the presence of bounded noise, IEEE Transactions on Information Theory, 51 2005, 3601–3608.
21. D. Goldfarb and W. Yin, Second-order cone programming methods for total variation-based image restoration, SIAM Journal on Scientific Computing, 27 (2005), 622–645.
22. S. Karlin, “Total Positivity,” Stanford University Press, Stanford, 1968.
23. J. Kunis and H. Rauhut, Random sampling of sparse trigonometric polynomials II – orthogonal matching pursuit versus basis pursuit, Technical Report, University of Chemnitz, Chemnitz, 2006.
24. M. Nikolova, Weakly constrained minimization. Application to the estimation of images and signals involving constant regions, Technical Report 2001-23, Centre de Mathématiques et de Leurs Applications, ENS de Cachan, France, 2001.
25. M. Nikolova, Minimizers of cost-functions involving nonsmooth data-fidelity terms. Application to the processing of outliers, SIAM Journal on Numerical Analysis, 40 (2002), 965–994.
26. M. Nikolova, A variational approach to remove outliers and impulse noise, Journal of Mathematical Imaging and Vision, 20 (2004), 99–120.
27. G. Steidl, A note on the dual treatment of higher–order regularization functionals, Computing, 76 (2006), 135–148.
28. T. Tao, An uncertainty principle for cyclic groups of prime order, Math. Res. Letters, 12 (2005), 121–127.
29. J. A. Tropp, Greed is good: algorithmic results for sparse approximation, IEEE Transactions on Information Theory, 50 (2004), 2231–2242.
30. J. A. Tropp, Just relax: convex programming methods for identifying sparse signals in noise, IEEE Transactions on Information Theory, 52 (2006), 1030–1051.
31. 1 functional, Technical Report 05-47, UCLA-Reports, 2005.