메뉴 건너뛰기




Volumn 86, Issue 3, 2006, Pages 533-548

Breakdown of equivalence between the minimal ℓ1-norm solution and the sparsest solution

Author keywords

Basis pursuit; Linear programming; Overcomplete systems; Partial Fourier matrix ensemble; Partial Hadamard matrix ensemble; Random matrix theory; Random signs matrix ensemble; Sparse representations; Underdetermined systems of linear equations

Indexed keywords

APPROXIMATION THEORY; HEURISTIC METHODS; LINEAR EQUATIONS; LINEAR PROGRAMMING; MATRIX ALGEBRA; SET THEORY;

EID: 30844458202     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sigpro.2005.05.028     Document Type: Article
Times cited : (236)

References (26)
  • 1
    • 0000322735 scopus 로고
    • Signal processing and compression with wavelet packets
    • J.S. Byrnes, J.L. Byrnes, K.A. Hargreaves, K. Berry (Eds.)
    • R.R. Coifman, Y. Meyer, S. Quake, M.V. Wickerhauser, Signal processing and compression with wavelet packets, in: J.S. Byrnes, J.L. Byrnes, K.A. Hargreaves, K. Berry (Eds.), Wavelets and Their Applications, 1994.
    • (1994) Wavelets and Their Applications
    • Coifman, R.R.1    Meyer, Y.2    Quake, S.3    Wickerhauser, M.V.4
  • 2
    • 0027842081 scopus 로고
    • Matching pursuits with time-frequency dictionaries
    • S. Mallat, and Z. Zhang Matching pursuits with time-frequency dictionaries IEEE Trans. Signal Process. 41 12 1993 3397 3415
    • (1993) IEEE Trans. Signal Process. , vol.41 , Issue.12 , pp. 3397-3415
    • Mallat, S.1    Zhang, Z.2
  • 4
    • 0029291966 scopus 로고
    • Sparse approximate solutions to linear systems
    • B.K. Natarajan Sparse approximate solutions to linear systems SIAM J. Comput. 24 1995 227 234
    • (1995) SIAM J. Comput. , vol.24 , pp. 227-234
    • Natarajan, B.K.1
  • 5
    • 0035504028 scopus 로고    scopus 로고
    • Uncertainty principles and ideal atomic decomposition
    • D.L. Donoho, and X. Huo Uncertainty principles and ideal atomic decomposition IEEE Trans. Inform. Theory 47 7 November 2001 2845 2862
    • (2001) IEEE Trans. Inform. Theory , vol.47 , Issue.7 , pp. 2845-2862
    • Donoho, D.L.1    Huo, X.2
  • 6
    • 0037418225 scopus 로고    scopus 로고
    • 1 norm minimization
    • March 4
    • D.L. Donoho, and M. Elad Optimally sparse representation from overcomplete dictionaries via ℓ 1 norm minimization Proc. Nat. Acad. Sci. USA 100 5 March 4, 2002 2197 2202
    • (2002) Proc. Nat. Acad. Sci. USA , vol.100 , Issue.5 , pp. 2197-2202
    • Donoho, D.L.1    Elad, M.2
  • 7
    • 0036714214 scopus 로고    scopus 로고
    • A generalized uncertainty principle and sparse representations in pairs of bases
    • M. Elad, and A.M. Bruckstein A generalized uncertainty principle and sparse representations in pairs of bases IEEE Trans. Inform. Theory 49 2002 2558 2567
    • (2002) IEEE Trans. Inform. Theory , vol.49 , pp. 2558-2567
    • Elad, M.1    Bruckstein, A.M.2
  • 8
    • 2942640138 scopus 로고    scopus 로고
    • On sparse representations in arbitrary redundant bases
    • J.J. Fuchs On sparse representations in arbitrary redundant bases IEEE Trans. Inform. Theory 50 6 June 2004 1341 1344
    • (2004) IEEE Trans. Inform. Theory , vol.50 , Issue.6 , pp. 1341-1344
    • Fuchs, J.J.1
  • 9
    • 0347968052 scopus 로고    scopus 로고
    • Sparse representations in unions of bases
    • R. Gribonval, and M. Nielsen Sparse representations in unions of bases IEEE Trans. Inform. Theory 49 12 December 2003 1320 1325
    • (2003) IEEE Trans. Inform. Theory , vol.49 , Issue.12 , pp. 1320-1325
    • Gribonval, R.1    Nielsen, M.2
  • 10
    • 5444237123 scopus 로고    scopus 로고
    • Greed is good: Algorithmic results for sparse approximation
    • J.A. Tropp Greed is good: algorithmic results for sparse approximation IEEE Trans. Inform. Theory 50 11 October 2004 2231 2242
    • (2004) IEEE Trans. Inform. Theory , vol.50 , Issue.11 , pp. 2231-2242
    • Tropp, J.A.1
  • 14
    • 29144489844 scopus 로고    scopus 로고
    • Manuscript, submitted for publication
    • D.L. Donoho, For most large underdetermined systems of linear equations, the minimal ℓ 1 solution is also the sparsest solution, Manuscript, submitted for publication, URL: http://www-stat.stanford.edu/~donoho/Reports/2004.
    • 1 Solution Is Also the Sparsest Solution
    • Donoho, D.L.1
  • 15
    • 0242323185 scopus 로고    scopus 로고
    • Grassmannian frames with applications to coding and communications
    • T. Strohmer, and R. Heath Jr. Grassmannian frames with applications to coding and communications Appl. Comput. Harm. Anal. 14 3 2003 257 275
    • (2003) Appl. Comput. Harm. Anal. , vol.14 , Issue.3 , pp. 257-275
    • Strohmer, T.1    Heath Jr., R.2
  • 17
    • 33144483155 scopus 로고    scopus 로고
    • Stable recovery of sparse overcomplete representations in the presence of noise
    • to appear
    • D.L. Donoho, M. Elad, V. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Trans. Inform. Theory, to appear.
    • IEEE Trans. Inform. Theory
    • Donoho, D.L.1    Elad, M.2    Temlyakov, V.3
  • 18
    • 29144491203 scopus 로고    scopus 로고
    • Manuscript, submitted for publication
    • D.L. Donoho, Compressed sensing. Manuscript, submitted for publication, URL: http://www-stat.stanford.edu/~donoho/Reports/2004.
    • Compressed Sensing
    • Donoho, D.L.1
  • 21
  • 22
    • 0000324960 scopus 로고
    • Eigenvalues and condition numbers of random matrices
    • A. Edelman Eigenvalues and condition numbers of random matrices SIAM J. Matrix Anal. Appl. 9 1988 543 560
    • (1988) SIAM J. Matrix Anal. Appl. , vol.9 , pp. 543-560
    • Edelman, A.1
  • 23
    • 0001387808 scopus 로고
    • Diameters of certain finite-dimensional sets in classes of smooth functions
    • B.S. Kashin Diameters of certain finite-dimensional sets in classes of smooth functions Izv. Akad. Nauk SSSR, Ser. Mat. 41 2 1977 334 351
    • (1977) Izv. Akad. Nauk SSSR, Ser. Mat. , vol.41 , Issue.2 , pp. 334-351
    • Kashin, B.S.1
  • 24
    • 3543141538 scopus 로고
    • On widths of the Euclidean ball
    • A.Y. Garnaev, and E.D. Gluskin On widths of the Euclidean ball Soviet Math. Dokl. 30 1984 200 203 (in English)
    • (1984) Soviet Math. Dokl. , vol.30 , pp. 200-203
    • Garnaev, A.Y.1    Gluskin, E.D.2


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