Average performance analysis for thresholding

IEEE Signal Processing Letters

Volumn 14, Issue 11, 2007, Pages 828-831

  Schnass, Karin ^a   Vandergheynst, Pierre ^a  

^a EPFL   (Switzerland)

Author keywords

Average performance; Preconditioning; Sensing dictionary; Sparse approximation; Thresholding

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; SIGNAL ANALYSIS;

SENSING DICTIONARY; SPARSE APPROXIMATION; THRESHOLDING;

DATABASE SYSTEMS;

EID: 36249017221     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/LSP.2007.903248     Document Type: Article

References (8)

1. G. Davis, S. Mallat, and M. Avellaneda, "Adaptive greedy approximations," in Constructive Approximation. New York: Springer-Verlag, 1997, vol. 13, pp. 57-98.
2. 1 minimization," Proc. Nat. Arad. Sci., vol. 100, no. 5, pp. 2197-2202, Mar. 2003.
3. J. J. Fuchs, "Extension of the pisarenko method to sparse linear arrays," IEEE Trans. Signal Process., vol. 45, no. 10, pp. 2413-2421, Oct. 1997.
4. J. J. Fuchs, "Detection and estimation of superimposed signals," in Proc. IEEE ICASSP98, 1998, vol. 3, pp. 1649-1652.
5. M. Ledoux and M. Talagrand, Probability in Banach Spaces. Isoperimetry and Processes. New York: Springer-Verlag, 1991.
6. K. Schnass and P. Vandergheynst, "Dictionary preconditioning for greedy algorithms," IEEE Trans. Signal Process., submitted for publication.
7. J. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
8. J. Tropp, "Random subdictionaries of general dictionaries," 2006, preprint.