On the use of a priori information for sparse signal approximations

IEEE Transactions on Signal Processing

Volumn 54, Issue 9, 2006, Pages 3468-3482

  Escoda, Òscar Divorra ^a,b   Granai, Lorenzo ^a,b   Vandergheynst, Pierre ^a,b  

^a IEEE   (Switzerland)

^b EPFL   (Switzerland)

Author keywords

A priori knowledge; Greedy algorithms; Redundant dictionaries; Relaxation algorithms; Sparse approximations; Weighted basis pursuit denoising; Weighted matching pursuit

Indexed keywords

A PRIORI KNOWLEDGE; GREEDY ALGORITHMS; REDUNDANT DICTIONARIES; RELAXATION ALGORITHMS; SPARSE APPROXIMATIONS; WEIGHTED BASIS PURSUIT DENOISING; WEIGHTED MATCHING PURSUITS;

APPROXIMATION ALGORITHMS; INFORMATION ANALYSIS;

SIGNAL PROCESSING;

EID: 33947134817     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2006.879306     Document Type: Article

References (24)

1. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, pp. 2231-2242, Oct. 2004.
2. _, "Just relax: Convex programming methods for subset selection and sparse approximation," ICES, Univ. of Texas at Austin, Austin, TX, 2004, Tech. Rep.
3. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atom decomposition," IEEE Trans. Inf. Theory, vol. 47, pp. 2845-2862, Nov. 2001.
4. 1 minimization," Proc. Nat. Acad. Sci., vol. 100, no. 5, pp. 2197-2202, Mar. 2003.
5. R. Gribonval and P. Vandergheynst, "On the exponential convergence of matching pursuits in quasi-incoherent dictionaries," IEEE Trans. Inf. Theory, to be published.
6. J. J. Fuchs, "Sparsity and uniqueness for some specific under-determined linear systems," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), Mar. 2005, vol. 5, pp. 729-732.
7. I. F. Gorodnitsky and B. D. Rao, "Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm," IEEE Trans. Signal Process., vol. 45, no. 3, pp. 600-616, Mar. 1997.
8. C. Canton, "Texture and edge adaptive weak matching pursuit" Master's thesis, Signal Processing Institute, Ecole Polytechnique Fédérale de Lausanne, Aug. 2003 [Online]. Available: http://lts2www.epfl.ch/~figueras/publications.html
9. V. N. Temlyakov, "Weak greedy algorithms," Dept. of Mathematics, Univ. of South Carolina, Columbia, 1999 [Online]. Available: http://www.math.sc.edu/~imip/99papers/9903.ps, Tech. Rep.
10. S. G. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
11. Y. Pati, R. Reziifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Conf. Rec. 27th Asilomar Conf. Signals, Syst. Comput., 1993, vol. 1, pp. 40-44.
12. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comp., vol. 20, no. 1, pp. 33-61, 1999.
13. D. L. Donobo and I. M. Johnstone, "Minimax estimation via wavelet shrinkage," Ann. Statist., no. 26, pp. 879-921, 1998.
14. S. Sardy, A. Bruce, and P. Tseng, "Block coordinate relaxation methods for nonparametric wavelet denoising," J. Comp. Graph. Statist., vol. 9, no. 2, pp. 361-379, 2000.
15. O. Divorra Escoda, L. Granai, and P. Vandergheynst, "On the use of a priori information for sparse signal approximations," ITS/LTS-2 EPFL, Tech. Rep. 2004/23, Nov. 2004 [Online]. Available: http://lts2www.epfl.ch/ publications.html
16. S. Mallat, A Wavelet Tour of Signal Processing. New York: Academic, 1998.
17. P. Dragotti and M. Vetterli, "Wavelet footprints: Theory, algorithms and applications," IEEE Trans. Signal Process., vol. 51, no. 5, pp. 1306-1323, May 2003.
18. D. L. Donoho, M. Elad, and V. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, to be published.
19. 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.
20. M. Lewicki and T. Sejnowski, "Learning overcomplete representations," Neural Comp., vol. 12, pp. 337-365, 2000.
21. L. Granai and P. Vandergheynst, "Sparse decomposition over multi-component redundant dictionaries," in Proc. IEEE Multimedia Signal Process. Workshop (MMSP), Sep. 2004, pp. 494-497.
22. J. J. Fuchs, "On sparse representations in arbitrary redundant bases," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1341-1344, 2004.
23. J. D. Pintér, Global Optimization in Action, ser. Nonconvex Optimization and Its Applications. Dordrecht, The Netherlands: Kluwer Academic, 1996, vol. 6.
24. O. Divorra Escoda, L. Granai, M. Lemay, J. Molinero Hernandez, P. Vandergheynst, and J.-M. Vesin, "Ventricular and atrial activity estimation through sparse ECG signal decompositions," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), May 2006, vol. 2, pp. II-1060-II-1063.