A plurality of sparse representations is better than the sparsest one alone

IEEE Transactions on Information Theory

Volumn 55, Issue 10, 2009, Pages 4701-4714

  Elad, Michael ^a   Yavneh, Irad ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Bayesian; Maximum a posteriori probability (MAP); Minimum mean squared error (MMSE); Sparse representations

Indexed keywords

ACCURATE ESTIMATION; APPROXIMATION METHODS; APRIORI; BAYESIAN; DE-NOISING; DE-NOISING TECHNIQUES; MAXIMUM A POSTERIORI PROBABILITIES; MAXIMUM A POSTERIORI PROBABILITY (MAP); MEAN-SQUARED ERRORS; MINIMUM MEAN SQUARED ERROR; MINIMUM-MEAN-SQUARED ERROR (MMSE); NOISE PROPERTIES; ORIGINAL SIGNAL; ORTHOGONAL MATCHING PURSUIT; SIGNAL CHARACTERISTIC; SPARSE REPRESENTATION; SPARSE REPRESENTATIONS;

APPROXIMATION THEORY; BAYESIAN NETWORKS; CLEANING; ESTIMATION; MEAN SQUARE ERROR; PROBABILITY; SIGNAL PROCESSING; THREE TERM CONTROL SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 70349620393     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2027565     Document Type: Article

References (29)

1. S. Baker and T. Kanade, "Limits on super-resolution and how to break them," IEEE Trans. Pattern Anal. Machine Intell., vol. 24, no. 9, pp. 1167-1183, Sep. 2002.
2. A. M. Bruckstein, D. L. Donoho, and M. Elad, "From sparse solutions of systems of equations to sparse modeling of signals and images," SIAM Rev., vol. 51, no. 1, pp. 34-81, Feb. 2009.
3. A. Buades, B. Coll, and J. M. Morel, "A review of image denoising algorithms, with a new one," Multiscale Modeling and Simulation, vol. 4, no. 2, pp. 490-530, 2005.
4. S. Chen, S. A. Billings, and W. Luo, "Orthogonal least squares methods and their application to non-linear system identification," Int. J. Contr., vol. 50, no. 5, pp. 1873-96, 1989.
5. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Scient. Comput., vol. 20, no. 1, pp. 33-61, 1998.
6. G. Davis, S. Mallat, and M. Avellaneda, "Adaptive greedy approximations," J. Constructive Approx., vol. 13, pp. 57-98, 1997.
7. G. Davis, S. Mallat, and Z. Zhang, "Adaptive time-frequency decompositions," Opt. Eng., vol. 33, no. 7, pp. 2183-91, 1994.
8. D. Datsenko and M. Elad, "Example-based single image super-resolution: A global MAP approach with outlier rejection," J. Multidim. Syst. Signal Process., vol. 18, no. 2, pp. 103-121, Sep. 2007.
9. D. L. Donoho, "For most large underdetermined systems of linear equations, the minimal l -norm near-solution approximates the sparsest near-solution," Commun. Pure Appl. Math., vol. 59, no. 7, pp. 907-934, Jul. 2006.
10. D. L. Donoho and M. Elad, "On the stability of the basis pursuit in the presence of noise," Signal Process., vol. 86, no. 3, pp. 511-532, Mar. 2006.
11. D. L. Donoho, M. Elad, and V. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 6-18, Jan. 2006.
12. M. Elad and M. Aharon, "Image denoising via sparse and redundant representations over learned dictionaries," IEEE Trans. Image Process., vol. 15, no. 12, pp. 3736-3745, Dec. 2006.
13. A. K. Fletcher, S. Rangan, V. K. Goyal, and K. Ramchandran, "Analysis of denoising by sparse approximation with random frame asymptotics," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1706-1710.
14. A. K. Fletcher, S. Rangan, V. K. Goyal, and K. Ramchandran, "Denoising by sparse approximation: Error bounds based on rate-distortion theory," EURASIP J. Appl. Signal Process., 2006, paper no. 26318.
15. W. T. Freeman, T. R. Jones, and E. C. Pasztor, "Example-based superresolution," IEEE Comput. Graphics and Applic., vol. 22, no. 2, pp. 56-65, 2002.
16. W. T. Freeman, E. C. Pasztor, and O. T. Carmichael, "Learning lowlevel vision," Int. J. Comput. Vision, vol. 40, no. 1, pp. 25-47, 2000.
17. J. J. Fuchs, "Recovery of exact sparse representations in the presence of bounded noise," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3601-3608, Oct. 2005.
18. R. Gribonval, R. Figueras, and P. Vandergheynst, "A simple test to check the optimality of a sparse signal approximation," Signal Process., vol. 86, no. 3, pp. 496-510, Mar. 2006.
19. E. G. Larsson and Y. Selen, "Linear gregression with a sparse parameter vector," IEEE Trans. Signal Process., vol. 55, no. 2, pp. 451-460, Feb. 2007.
20. S. Mallat, A Wavelet Tour of Signal Processing, 3rd ed. San Diego, CA: Academic, 2009.
21. S. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
22. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, pp. 227-234, 1995.
23. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th Asilomar Conf. Signals, Systems and Computers, Thousand Oaks, CA, 1993, vol. 1, pp. 40-44.
24. L. C. Pickup, S. J. Roberts, and A. Zisserman, "A sampled texture prior for image super-resolution," Adv. Neural Inf. Process. Syst., vol. 16, pp. 1587-1594, 2003.
25. P. Schnitter, L. C. Potter, and J. Ziniel, "Fast Bayesian matching pursuit," in Proc. Workshop on Information Theory and Applications (ITA), La Jolla, CA, Jan. 2008.
26. P. Schniter, L. C. Potter, and J. Ziniel, "Fast Bayesian matching pursuit: Model uncertainty and parameter estimation for sparse linear models," IEEE Trans. Signal Process., submitted for publication.
27. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
28. J. A. Tropp, "Just relax: Convex programming methods for subset selection and sparse approximation," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1030-1051, Mar. 2006.
29. B. Wohlberg, "Noise sensitivity of sparse signal representations: Reconstruction error bounds for the inverse problem," IEEE Trans. Signal Process., vol. 51, no. 12, pp. 3053-3060, Dec. 2003.