메뉴 건너뛰기




Volumn 8, Issue 1, 2010, Pages 93-111

Fast linearized Bregman iteration for compressive sensing and sparse denoising

Author keywords

Basis pursuit; Compressed sensing; Iterative regularization; Sparse denoising; 1 minimization

Indexed keywords


EID: 77349126814     PISSN: 15396746     EISSN: None     Source Type: Journal    
DOI: 10.4310/cms.2010.v8.n1.a6     Document Type: Article
Times cited : (200)

References (15)
  • 2
    • 84977895355 scopus 로고    scopus 로고
    • Bregman iterative algorithms for compressed sensing and related problems
    • W. Yin, S. Osher, D. Goldfarb and J. Darbon, Bregman iterative algorithms for compressed sensing and related problems, SIAM J. Imaging Sciences, 1(1), 143-168, 2008.
    • (2008) SIAM J. Imaging Sciences , vol.1 , Issue.1 , pp. 143-168
    • Yin, W.1    Osher, S.2    Goldfarb, D.3    Darbon, J.4
  • 3
    • 77951959023 scopus 로고    scopus 로고
    • Linearized Bregman iterations for compressed sensing
    • to appear see also UCLA CAM Report
    • J. Cai, S. Osher and Z. Shen, Linearized Bregman iterations for compressed sensing, Math. Comp., to appear, 2008, see also UCLA CAM Report 08-06.
    • (2008) Math. Comp. , pp. 08-06
    • Cai, J.1    Osher, S.2    Shen, Z.3
  • 7
    • 19844370110 scopus 로고    scopus 로고
    • An iterative regularization method for total variation based image restoration
    • S. Osher, M. Burger, D. Goldfarb, J. Xu and W. Yin, An iterative regularization method for total variation based image restoration, Multiscale Model. Simul, 4(2), 460-489, 2005.
    • (2005) Multiscale Model. Simul , vol.4 , Issue.2 , pp. 460-489
    • Osher, S.1    Burger, M.2    Goldfarb, D.3    Xu, J.4    Yin, W.5
  • 9
    • 44049111982 scopus 로고
    • Nonlinear total variation based noise removal algorithms
    • L. Rudin, S. Osher and E. Fatemi, Nonlinear total variation based noise removal algorithms, Phys. D, 60, 259-268, 1992.
    • (1992) Phys. D , vol.60 , pp. 259-268
    • Rudin, L.1    Osher, S.2    Fatemi, E.3
  • 12
    • 49949144765 scopus 로고
    • The relaxation method of finding the common point of convex sets and its ap-plication to the solution of problems in convex programming
    • L.M. Bregman, The relaxation method of finding the common point of convex sets and its ap-plication to the solution of problems in convex programming, USSR Computational Mathematics and Mathematical Physics, 7(3), 200-217, 1967.
    • (1967) USSR Computational Mathematics and Mathematical Physics , vol.7 , Issue.3 , pp. 200-217
    • Bregman, L.M.1
  • 13
    • 0029307534 scopus 로고
    • De-noising by Soft-Thresholding
    • D.L. Donoho, De-noising by Soft-Thresholding, IEEE Trans. Inform. Theory, 41, 613-527, 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 613-527
    • Donoho, D.L.1


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