메뉴 건너뛰기




Volumn 59, Issue 12, 2011, Pages 5859-5875

Concentration of measure for block diagonal matrices with applications to compressive signal processing

Author keywords

[No Author keywords available]

Indexed keywords

ACQUISITION SYSTEMS; ARCHITECTURAL CONSTRAINTS; BLOCK DIAGONAL; BLOCK DIAGONAL MATRICES; COMPRESSED DOMAIN; CONCENTRATION OF MEASURE; EMBEDDINGS; EMPIRICAL INVESTIGATION; PERFORMANCE GUARANTEES; RANDOM MATRIX; SIGNAL CLASS; THEORETICAL RESULT;

EID: 81455136681     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2011.2166546     Document Type: Article
Times cited : (42)

References (39)
  • 3
    • 33645712892 scopus 로고    scopus 로고
    • Compressed sensing
    • Apr
    • D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.4 , pp. 1289-1306
    • Donoho, D.L.1
  • 4
    • 84878104490 scopus 로고    scopus 로고
    • Compressive sampling
    • Madrid, Spain, Aug
    • E. J. Candès "Compressive sampling," in Proc. Int. Congr. Math., Madrid, Spain, Aug. 2006, vol. 3, pp. 1433-1452.
    • (2006) Proc. Int. Congr. Math. , vol.3 , pp. 1433-1452
    • Candès, E.J.1
  • 5
    • 0012942540 scopus 로고    scopus 로고
    • The concentration of measure phenomenon
    • New York: AMS
    • M. Ledoux, "The concentration of measure phenomenon," in Mathematical Surveys and Monographs. New York: AMS, 2001.
    • (2001) Mathematical Surveys and Monographs
    • Ledoux, M.1
  • 8
    • 0037236821 scopus 로고    scopus 로고
    • An elementary proof of the Johnson-Lindenstrauss lemma
    • S. Dasgupta and A. Gupta, "An elementary proof of the Johnson-Lindenstrauss lemma," Random Struct. Algor., vol. 22, no. 1, pp. 60-65, 2002.
    • (2002) Random Struct. Algor. , vol.22 , Issue.1 , pp. 60-65
    • Dasgupta, S.1    Gupta, A.2
  • 9
    • 29144439194 scopus 로고    scopus 로고
    • Decoding by linear programming
    • DOI 10.1109/TIT.2005.858979
    • E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 12, no. 51, pp. 4203-4215, Dec. 2005. (Pubitemid 41800353)
    • (2005) IEEE Transactions on Information Theory , vol.51 , Issue.12 , pp. 4203-4215
    • Candes, E.J.1    Tao, T.2
  • 10
    • 55649115527 scopus 로고    scopus 로고
    • A simple proof of the restricted isometry property for random matrices
    • Dec
    • R. G. Baraniuk, M. A. Davenport, R. A. DeVore, and M. B.Wakin, "A simple proof of the restricted isometry property for random matrices," Const. Approx., vol. 28, no. 3, pp. 253-263, Dec. 2008.
    • (2008) Const. Approx. , vol.28 , Issue.3 , pp. 253-263
    • Baraniuk, R.G.1    Davenport, M.A.2    Devore, R.A.3    Wakin, B.M.4
  • 11
    • 55649100730 scopus 로고    scopus 로고
    • Uniform uncertainty principle for Bernoulli and sub-Gaussian ensembles
    • S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, "Uniform uncertainty principle for Bernoulli and sub-Gaussian ensembles," Const. Approx., vol. 28, no. 3, pp. 277-289, 2008.
    • (2008) Const. Approx. , vol.28 , Issue.3 , pp. 277-289
    • Mendelson, S.1    Pajor, A.2    Tomczak-Jaegermann, N.3
  • 13
    • 77953716124 scopus 로고    scopus 로고
    • Compressive sampling for streaming signals with sparse frequency content
    • P. Boufounos and M. S. Asif, "Compressive sampling for streaming signals with sparse frequency content," in Proc. Conf. Inf. Sci. Syst. (CISS), 2010.
    • (2010) Proc. Conf. Inf. Sci. Syst. (CISS)
    • Boufounos, P.1    Asif, M.S.2
  • 14
    • 0007298971 scopus 로고
    • Sub-Gaussian random variables
    • Nov
    • V. V. Buldygin and Y. V. Kozachenko, "Sub-Gaussian random variables," Ukrainian Math. J., vol. 32, pp. 483-489, Nov. 1980.
    • (1980) Ukrainian Math. J. , vol.32 , pp. 483-489
    • Buldygin, V.V.1    Kozachenko, Y.V.2
  • 15
    • 79952433487 scopus 로고    scopus 로고
    • Introduction to the non-asymptotic analysis of random matrices
    • Cambridge, U.K.: Cambridge Univ. Press
    • R. Vershynin, "Introduction to the non-asymptotic analysis of random matrices," in Compressed Sensing: Theory and Applications. Cambridge, U.K.: Cambridge Univ. Press.
    • Compressed Sensing: Theory and Applications
    • Vershynin, R.1
  • 16
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • P. Indyk and R. Motwani "Approximate nearest neighbors: Towards removing the curse of dimensionality," in Proc. ACM Symp. Theory of Computing, 1998, pp. 604-613.
    • (1998) Proc. ACM Symp. Theory of Computing , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 17
    • 69949141924 scopus 로고    scopus 로고
    • Instance-optimality in probability with an l1-minimization decoder
    • R. DeVore, G. Petrova, and P. Wojtaszczyk, "Instance-optimality in probability with an l1-minimization decoder," Appl. Computat. Harmon. Anal., vol. 27, no. 3, pp. 275-288, 2009.
    • (2009) Appl. Computat. Harmon. Anal. , vol.27 , Issue.3 , pp. 275-288
    • Devore, R.1    Petrova, G.2    Wojtaszczyk, P.3
  • 18
    • 38249031101 scopus 로고
    • The Johnson-Lindenstrauss lemma and the sphericity of some graphs
    • P. Frankl and H. Maehara, "The Johnson-Lindenstrauss lemma and the sphericity of some graphs," J. Combinator. Theory, ser. Series B, vol. 44, no. 3, pp. 355-362, 1988.
    • (1988) J. Combinator. Theory, Ser. Series B , vol.44 , Issue.3 , pp. 355-362
    • Frankl, P.1    Maehara, H.2
  • 19
    • 67650105330 scopus 로고    scopus 로고
    • The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
    • May
    • N. Ailon and B. Chazelle, "The fast Johnson-Lindenstrauss transform and approximate nearest neighbors," SIAM J. Comput., vol. 39, pp. 302-322, May. 2009.
    • (2009) SIAM J. Comput. , vol.39 , pp. 302-322
    • Ailon, N.1    Chazelle, B.2
  • 23
    • 42649140570 scopus 로고    scopus 로고
    • The restricted isometry property and its implications for compressed sensing
    • E. J. Candès, "The restricted isometry property and its implications for compressed sensing," Comptes Rendus Math., vol. 346, no. 9-10, pp. 589-592, 2008.
    • (2008) Comptes Rendus Math. , vol.346 , Issue.9-10 , pp. 589-592
    • Candès, E.J.1
  • 25
    • 58849146227 scopus 로고    scopus 로고
    • Random projections of smooth manifolds
    • R. G. Baraniuk and M. B.Wakin, "Random projections of smooth manifolds," Found. Comp. Math., vol. 9, no. 1, pp. 51-77, 2009.
    • (2009) Found. Comp. Math. , vol.9 , Issue.1 , pp. 51-77
    • Baraniuk, R.G.1    Wakin, B.M.2
  • 26
    • 33947416035 scopus 로고    scopus 로고
    • Near-optimal signal recovery from random projections: Universal encoding strategies?
    • DOI 10.1109/TIT.2006.885507
    • E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, 2006. (Pubitemid 46445381)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.12 , pp. 5406-5425
    • Candes, E.J.1    Tao, T.2
  • 27
    • 34247578706 scopus 로고    scopus 로고
    • Subspaces and orthogonal decompositions generated by bounded orthogonal systems
    • O. Guédon, S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, "Subspaces and orthogonal decompositions generated by bounded orthogonal systems," Positivity, vol. 11, no. 2, pp. 269-283, 2007.
    • (2007) Positivity , vol.11 , Issue.2 , pp. 269-283
    • Guédon, O.1    Mendelson, S.2    Pajor, A.3    Tomczak-Jaegermann, N.4
  • 28
    • 52349092455 scopus 로고    scopus 로고
    • On sparse reconstruction from Fourier and Gaussian measurements
    • M. Rudelson and R. Vershynin, "On sparse reconstruction from Fourier and Gaussian measurements," Commun. Pure Appl. Math., vol. 61, no. 8, pp. 1025-1045, 2008.
    • (2008) Commun. Pure Appl. Math. , vol.61 , Issue.8 , pp. 1025-1045
    • Rudelson, M.1    Vershynin, R.2
  • 33
    • 79953134952 scopus 로고    scopus 로고
    • Concentration of measure inequalities for compressive Toeplitz matrices with applications to detection and system identification
    • B. M. Sanandaji, T. L. Vincent, and M. B. Wakin, "Concentration of measure inequalities for compressive Toeplitz matrices with applications to detection and system identification," in Proc. IEEE Conf. Decision Control (CDC), 2010.
    • (2010) Proc. IEEE Conf. Decision Control (CDC)
    • Sanandaji, B.M.1    Vincent, T.L.2    Wakin, M.B.3
  • 34
    • 57349172766 scopus 로고    scopus 로고
    • On the linear independence of spikes and sines
    • J. A. Tropp, "On the linear independence of spikes and sines," J. Fourier Anal. Appl., vol. 14, no. 5, pp. 838-858, 2008.
    • (2008) J. Fourier Anal. Appl. , vol.14 , Issue.5 , pp. 838-858
    • Tropp, J.A.1
  • 35
    • 33744726904 scopus 로고    scopus 로고
    • Quantitative robust uncertainty principles and optimally sparse decompositions
    • DOI 10.1007/s10208-004-0162-x
    • E. J. Candès and J. Romberg, "Quantitative robust uncertainty principles and optimally sparse decompositions," Found. Comp. Math., vol. 6, no. 2, pp. 227-254, 2006. (Pubitemid 43824483)
    • (2006) Foundations of Computational Mathematics , vol.6 , Issue.2 , pp. 227-254
    • Candes, E.J.1    Romberg, J.2
  • 36
    • 73849109362 scopus 로고    scopus 로고
    • Average case analysis of multichannel sparse recovery using convex relaxation
    • Y. C. Eldar and H. Rauhut, "Average case analysis of multichannel sparse recovery using convex relaxation," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 505-519, 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.56 , Issue.1 , pp. 505-519
    • Eldar, Y.C.1    Rauhut, H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.