메뉴 건너뛰기




Volumn , Issue , 2009, Pages 3033-3036

Dense error correction via L1-minimization

Author keywords

Error correction; Signal reconstruction; Signal representation

Indexed keywords

HIGHLY-CORRELATED; LINEAR MEASUREMENTS; MINIMIZATION PROBLEMS; SIGNAL REPRESENTATION; SPARSE SIGNALS;

EID: 70349211664     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2009.4960263     Document Type: Conference Paper
Times cited : (38)

References (10)
  • 1
    • 59849112503 scopus 로고    scopus 로고
    • From sparse solutions of systems of equations to sparse modeling of signals and images
    • A. M. Bruckstein, D. L. Donoho, and M. Elad, "From sparse solutions of systems of equations to sparse modeling of signals and images," submitted to SIAM Review, 2007.
    • (2007) submitted to SIAM Review
    • Bruckstein, A.M.1    Donoho, D.L.2    Elad, M.3
  • 2
    • 70349227534 scopus 로고    scopus 로고
    • 1-minimization, Tech. Rep. UILU-ENG-08-2210, DC 237, http://perception.csl.uiuc.edu/~jnwright/Wright08-IT.pdf, University of Illinois at Urbana-Champaign, 2008.
    • 1-minimization," Tech. Rep. UILU-ENG-08-2210, DC 237, http://perception.csl.uiuc.edu/~jnwright/Wright08-IT.pdf, University of Illinois at Urbana-Champaign, 2008.
  • 3
    • 61549128441 scopus 로고    scopus 로고
    • J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma, Robust face recognition via sparse representation, To appear in IEEE Trans. PAMI, 2008.
    • J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma, "Robust face recognition via sparse representation," To appear in IEEE Trans. PAMI, 2008.
  • 4
    • 29144439194 scopus 로고    scopus 로고
    • Decoding by linear programming
    • E. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. IT, vol. 51, no. 12, 2005.
    • (2005) IEEE Trans. IT , vol.51 , Issue.12
    • Candès, E.1    Tao, T.2
  • 5
    • 33646365077 scopus 로고    scopus 로고
    • 1-norm solution is also the sparsest solution
    • 1-norm solution is also the sparsest solution," Communications on Pure and Applied Mathematics, vol. 59, no. 6, pp. 797-829, 2006.
    • (2006) Communications on Pure and Applied Mathematics , vol.59 , Issue.6 , pp. 797-829
    • Donoho, D.1
  • 6
    • 29144489844 scopus 로고    scopus 로고
    • 1-norm near solution approximates the sparest solution
    • preprint
    • 1-norm near solution approximates the sparest solution," preprint, 2004.
    • (2004)
    • Donoho, D.1
  • 7
    • 30844437386 scopus 로고    scopus 로고
    • Neighborly polytopes and sparse solution of underdetermined linear equations
    • preprint
    • D. Donoho, "Neighborly polytopes and sparse solution of underdetermined linear equations," preprint, 2005.
    • (2005)
    • Donoho, D.1
  • 8
    • 57849144332 scopus 로고    scopus 로고
    • Signal recovery from inaccurate and incomplete measurements via regularized orthogonalized matching pursuit
    • preprint
    • D. Needell and R. Vershynin, "Signal recovery from inaccurate and incomplete measurements via regularized orthogonalized matching pursuit," preprint http://www.math.ucdavis.edu/~dneedell/, 2007.
    • (2007)
    • Needell, D.1    Vershynin, R.2
  • 9
    • 51949112810 scopus 로고    scopus 로고
    • Counting faces of randomly projected polytopes when the projection radically lowers dimension
    • preprint
    • D. Donoho and J. Tanner, "Counting faces of randomly projected polytopes when the projection radically lowers dimension," preprint, http://www.math.utah.edu/~tanner/, 2007.
    • (2007)
    • Donoho, D.1    Tanner, J.2
  • 10
    • 18144420071 scopus 로고    scopus 로고
    • Acquiring linear subspaces for face recognition under variable lighting
    • K. Lee, J. Ho, and D. Kriegman, "Acquiring linear subspaces for face recognition under variable lighting," IEEE Trans. PAMI, vol. 27, no. 5, pp. 684-698, 2005.
    • (2005) IEEE Trans. PAMI , vol.27 , Issue.5 , pp. 684-698
    • Lee, K.1    Ho, J.2    Kriegman, D.3


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