×

On optimal estimate of the block orthogonal greedy algorithm for g-frames. (English) Zbl 1481.42040

In this paper, the authors study Lebesgue-type inequalities to obtain an optimal approximation (upper estimates for the errors and convergence) of the block orthogonal greedy algorithm with regard to g-frames in Hilbert spaces. Also, they obtain an accurate estimate involved in the errors of the block orthogonal greedy algorithm for g-frames analogous to the result obtained using dictionaries by E. D. Livshitz [J. Approx. Theory 164, No. 5, 668–681 (2012; Zbl 1248.41048)].

MSC:

42C15 General harmonic expansions, frames
42C30 Completeness of sets of functions in nontrigonometric harmonic analysis
42C05 Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis
46B15 Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces

Citations:

Zbl 1248.41048
Full Text: DOI

References:

[1] Donoho, D. L., Compressed Sensing, IEEE Trans. Inform. Theory, 52, 4, 1289-1306 (2006) · Zbl 1288.94016 · doi:10.1109/TIT.2006.871582
[2] Mourad, N.; Sharkas, M.; Elsherbeny, M. M., Orthogonal matching pursuit with correction, 247-252 (2016)
[3] Eldar, Y. C.; Mishali, M., Robust recovery of signals from a structured union of subspaces, IEEE Trans. Inform. Theory, 55, 11, 5302-5316 (2009) · Zbl 1367.94087 · doi:10.1109/TIT.2009.2030471
[4] Eldar, Y. C.; Mishali, M., Block-sparsity and sampling over a union of subspaces, 1-8 (2009)
[5] Eldar, Y. C.; Bölcskei, H., Block-Sparsity: Coherence and Efficient Recovery (2009)
[6] Eldar, Y. C.; Kuppinger, P.; Bölcskei, H., Block-sparse signals: uncertainty relations and efficient recovery, IEEE Trans. Signal Process, 58, 6, 3042-3054 (2010) · Zbl 1392.94195 · doi:10.1109/TSP.2010.2044837
[7] Lv, X.; Wan, C.; Bi, G., Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations, Signal Process, 90, 12, 3265-3277 (2010) · Zbl 1197.94086 · doi:10.1016/j.sigpro.2010.05.034
[8] Tropp, J. A., Greed is good: algorithmic results for sparse approximation, IEEE Trans. Inform. Theory, 50, 10, 2231-2242 (2004) · Zbl 1288.94019 · doi:10.1109/TIT.2004.834793
[9] Temlyakov, V., Greedy Approximation, 20 (2011), Cambridge: Cambridge University Press · Zbl 1279.41001
[10] Donoho, D. L.; Elad, M.; Temlyakov, V. N., On Lebesgue-type inequalities for greedy approximation, J. Approx. Theory, 147, 2, 185-195 (2007) · Zbl 1120.41007 · doi:10.1016/j.jat.2007.01.004
[11] Gilbert, A. C.; Muthukrishnan, M.; Strauss, J., Approximation of functions over redundant dictionaries using coherence, 243-252 (2003) · Zbl 1094.41500
[12] Livshitz, E. D., On the optimality of the Orthogonal Greedy Algorithm for μ-coherent dictionaries, J. Approx. Theory, 164, 5, 668-681 (2012) · Zbl 1248.41048 · doi:10.1016/j.jat.2012.01.007
[13] Temlyakov, V. N.; Zheltov, P., On performance of greedy algorithms, J. Approximation Theory, 163, 9, 1134-1145 (2011) · Zbl 1230.41005 · doi:10.1016/j.jat.2011.03.009
[14] Conway, J. B., A Course in Functional Analysis, 96 (1990), New York: Springer · Zbl 0706.46003
[15] Sun, W., G-frames and g-Riesz bases, J. Math. Anal. Appl, 322, 1, 437-452 (2006) · Zbl 1129.42017 · doi:10.1016/j.jmaa.2005.09.039
[16] Casazza, P. G., The art of frame theory, Taiwanese J. Math, 4, 2, 129-202 (2000) · Zbl 0966.42022
[17] Christensen, O., An Introduction to Frames and Riesz Bases (2003), Boston, MA: Birkhäuser, Boston, MA · Zbl 1017.42022
[18] Duffin, R. J.; Schaeffer, A. C., A class of non-harmonic Fourier series, Trans. Am. Math. Soc, 72, 2, 341-366 (1952) · Zbl 0049.32401 · doi:10.1090/S0002-9947-1952-0047179-6
[19] Kovačević, J.; Chebira, A., An Introduction to Frames, 2, 1-94 (2007), Foundations and Trends in Signal Processing · Zbl 1155.94001 · doi:10.1561/2000000006
[20] Casazza, P. G.; Kutyniok, G., Frames of subspaces, Contemp. Math, 345, 87-113 (2004) · Zbl 1052.42002 · doi:10.1090/conm/345
[21] Casazza, P. G.; Kutyniok, G.; Li, S., Fusion frames and distributed processing, Appl. Comput. Harmon. Anal, 25, 1, 114-132 (2008) · Zbl 1258.42029 · doi:10.1016/j.acha.2007.10.001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.