메뉴 건너뛰기




Volumn 3, Issue , 2006, Pages

Recovery conditions of sparse representations in the presence of noise

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; ERROR ANALYSIS; LINEAR PROGRAMMING; OPTIMIZATION; SIGNAL TO NOISE RATIO;

EID: 33947677595     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (10)

References (10)
  • 1
    • 2942640138 scopus 로고    scopus 로고
    • More on sparse representations in arbitrary bases
    • June
    • J.J. Fuchs. More on sparse representations in arbitrary bases. IEEE Trans. on I.T. 50, 6, 1341-1344, June 2004
    • (2004) IEEE Trans. on I.T , vol.50 , Issue.6 , pp. 1341-1344
    • Fuchs, J.J.1
  • 2
    • 0035504028 scopus 로고    scopus 로고
    • Uncertainty principles and ideal atomic decomposition
    • Nov
    • D.L. Donoho and X. Huo. Uncertainty principles and ideal atomic decomposition. IEEE Trans. on I.T., 47, 11, 2845-2862, Nov. 2001.
    • (2001) IEEE Trans. on I.T , vol.47 , Issue.11 , pp. 2845-2862
    • Donoho, D.L.1    Huo, X.2
  • 3
    • 0036714214 scopus 로고    scopus 로고
    • A generalized uncertainty principle and sparse representation in pairs of bases
    • Sept
    • M. Elad an A.M. Bruckstein. A generalized uncertainty principle and sparse representation in pairs of bases. IEEE Trans. on I.T., 48, 9, 2558-256, Sept. 2002.
    • (2002) IEEE Trans. on I.T , vol.48 , Issue.9 , pp. 2558-2256
    • Elad an, M.1    Bruckstein, A.M.2
  • 4
    • 0347968052 scopus 로고    scopus 로고
    • Sparse representations in unions of bases
    • Dec
    • R. Gribonval and M. Nielsen. Sparse representations in unions of bases. IEEE Trans. on I.T. 49, 12, 3320-3325, Dec. 2003.
    • (2003) IEEE Trans. on I.T , vol.49 , Issue.12 , pp. 3320-3325
    • Gribonval, R.1    Nielsen, M.2
  • 5
    • 5444237123 scopus 로고    scopus 로고
    • Greed is good: Algorithmic Results for Sparse Approximations
    • Oct
    • J.A. Tropp, "Greed is good: Algorithmic Results for Sparse Approximations," IEEE Trans. on I.T., 50, 10, 2231-2242, Oct. 2004.
    • (2004) IEEE Trans. on I.T , vol.50 , Issue.10 , pp. 2231-2242
    • Tropp, J.A.1
  • 6
    • 4644223536 scopus 로고    scopus 로고
    • Recovery of exact sparse representations in the presence of noise
    • Montreal, May
    • J.J. Fuchs, "Recovery of exact sparse representations in the presence of noise," Proceedings of the IEEE ICASSP Conference, vol. II, pp. 533-536, Montreal, May 2004.
    • (2004) Proceedings of the IEEE ICASSP Conference , vol.2 , pp. 533-536
    • Fuchs, J.J.1
  • 7
    • 26844461512 scopus 로고    scopus 로고
    • Recovery of exact sparse representations in the presence of bounded noise
    • Oct
    • J.J. Fuchs. Recovery of exact sparse representations in the presence of bounded noise IEEE Trans. on I.T. 51, 10, 3601-3608, Oct. 2005.
    • (2005) IEEE Trans. on I.T , vol.51 , Issue.10 , pp. 3601-3608
    • Fuchs, J.J.1
  • 8
    • 33947656796 scopus 로고    scopus 로고
    • D.L. Donoho, M. Elad and V. Temlyakov, Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise, submitted to IEEE Trans. on I.T., Feb. 2004.
    • D.L. Donoho, M. Elad and V. Temlyakov, "Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise," submitted to IEEE Trans. on I.T., Feb. 2004.
  • 9
    • 33947681574 scopus 로고    scopus 로고
    • J.A. Tropp, Just relax: Convex Programming Methods for Identifying Sparse Signals in Noise submitted to IEEE Trans. on I.T.,revised Feb. 2005.
    • J.A. Tropp, "Just relax: Convex Programming Methods for Identifying Sparse Signals in Noise" submitted to IEEE Trans. on I.T.,revised Feb. 2005.
  • 10


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