메뉴 건너뛰기




Volumn 59, Issue 12, 2011, Pages 6285-6290

Orthonormal expansion ℓ1-minimization algorithms for compressed sensing

Author keywords

[No Author keywords available]

Indexed keywords

BASIS PURSUITS; COMPRESSED SENSING; MINIMIZATION ALGORITHMS; NUMBER OF SAMPLES; ORTHONORMAL; SIGNALS OF INTERESTS; SOFT-THRESHOLDING ALGORITHM; SPARSE SIGNALS; STATE-OF-THE-ART ALGORITHMS;

EID: 81455136619     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2011.2168216     Document Type: Article
Times cited : (29)

References (23)
  • 1
    • 31744440684 scopus 로고    scopus 로고
    • Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
    • DOI 10.1109/TIT.2005.862083
    • E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, 2006. (Pubitemid 43174093)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.2 , pp. 489-509
    • Candes, E.J.1    Romberg, J.2    Tao, T.3
  • 2
    • 34249687049 scopus 로고    scopus 로고
    • Sparsity and incoherence in compressive sampling
    • DOI 10.1088/0266-5611/23/3/008, PII S0266561107398742, 008
    • E. Candès and J. Romberg, "Sparsity and incoherence in compressive sampling," Inverse Problems, vol. 23, pp. 969-985, 2007. (Pubitemid 46838836)
    • (2007) Inverse Problems , vol.23 , Issue.3 , pp. 969-985
    • Candes, E.1    Romberg, J.2
  • 3
    • 33645712892 scopus 로고    scopus 로고
    • Compressed sensing
    • D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.4 , pp. 1289-1306
    • Donoho, D.1
  • 4
    • 7044231546 scopus 로고    scopus 로고
    • An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
    • DOI 10.1002/cpa.20042
    • I. Daubechies, M. Defrise, and C. De Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Commun. Pure Appl. Math., vol. 57, no. 11, pp. 1413-1457, 2004. (Pubitemid 39427442)
    • (2004) Communications on Pure and Applied Mathematics , vol.57 , Issue.11 , pp. 1413-1457
    • Daubechies, I.1    Defrise, M.2    De Mol, C.3
  • 5
    • 57349100926 scopus 로고    scopus 로고
    • Linear convergence of iterative soft-thresholding
    • K. Bredies and D. Lorenz, "Linear convergence of iterative soft-thresholding," J. Fourier Anal. Appl., vol. 14, no. 5, pp. 813-837, 2008.
    • (2008) J. Fourier Anal. Appl. , vol.14 , Issue.5 , pp. 813-837
    • Bredies, K.1    Lorenz, D.2
  • 7
    • 36849088522 scopus 로고    scopus 로고
    • Sparse MRI: The application of compressed sensing for rapid MR imaging
    • DOI 10.1002/mrm.21391
    • M. Lustig, D. Donoho, and J. Pauly, "Sparse MRI: The application of compressed sensing for rapid MR imaging," Magn. Resonance Med., vol. 58, no. 6, pp. 1182-1195, 2007. (Pubitemid 350234205)
    • (2007) Magnetic Resonance in Medicine , vol.58 , Issue.6 , pp. 1182-1195
    • Lustig, M.1    Donoho, D.2    Pauly, J.M.3
  • 10
    • 79551550744 scopus 로고    scopus 로고
    • NESTA: A fast and accurate firstorder method for sparse recovery
    • S. Becker, J. Bobin, and E. Candes, "NESTA: A fast and accurate firstorder method for sparse recovery," SIAM J. Imag. Sci., vol. 4, no. 1, pp. 1-39, 2011.
    • (2011) SIAM J. Imag. Sci. , vol.4 , Issue.1 , pp. 1-39
    • Becker, S.1    Bobin, J.2    Candes, E.3
  • 11
    • 17444406259 scopus 로고    scopus 로고
    • Smooth minimization of non-smooth functions
    • DOI 10.1007/s10107-004-0552-5
    • Y. Nesterov, "Smooth minimization of non-smooth functions," Math. Programm., vol. 103, no. 1, pp. 127-152, 2005. (Pubitemid 40537674)
    • (2005) Mathematical Programming , vol.103 , Issue.1 , pp. 127-152
    • Nesterov, Yu.1
  • 12
    • 64649083745 scopus 로고    scopus 로고
    • Signal recovery from random measurements via orthogonal matching pursuit
    • J. Tropp and A. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4655-4666, 2007.
    • (2007) IEEE Trans. Inf. Theory , vol.53 , Issue.12 , pp. 4655-4666
    • Tropp, J.1    Gilbert, A.2
  • 13
    • 35548934118 scopus 로고    scopus 로고
    • Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit
    • submitted for publication
    • D. Donoho, Y. Tsaig, I. Drori, and J. Starck, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit," IEEE Trans. Signal Process, 2006, submitted for publication.
    • (2006) IEEE Trans. Signal Process
    • Donoho, D.1    Tsaig, Y.2    Drori, I.3    Starck, J.4
  • 14
    • 62749175137 scopus 로고    scopus 로고
    • CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
    • D. Needell and J. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol. 26, no. 3, pp. 301-321, 2009.
    • (2009) Appl. Comput. Harmon. Anal. , vol.26 , Issue.3 , pp. 301-321
    • Needell, D.1    Tropp, J.2
  • 15
    • 77955666600 scopus 로고    scopus 로고
    • A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization and continuation
    • Z. Wen, W. Yin, D. Goldfarb, and Y. Zhang, "A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization and continuation," SIAM J. Sci. Comput., vol. 32, no. 4, pp. 1832-1857, 2010.
    • (2010) SIAM J. Sci. Comput. , vol.32 , Issue.4 , pp. 1832-1857
    • Wen, Z.1    Yin, W.2    Goldfarb, D.3    Zhang, Y.4
  • 16
    • 77949685085 scopus 로고    scopus 로고
    • Optimally tuned iterative thresholding algorithms for compressed sensing
    • A. Maleki and D. Donoho, "Optimally tuned iterative thresholding algorithms for compressed sensing," IEEE J. Sel. Areas Signal Process., vol. 4, pp. 330-341, 2010.
    • (2010) IEEE J. Sel. Areas Signal Process. , vol.4 , pp. 330-341
    • Maleki, A.1    Donoho, D.2
  • 17
    • 73149095169 scopus 로고    scopus 로고
    • Message-passing algorithms for compressed sensing
    • D. Donoho, A. Maleki, and A. Montanari, "Message-passing algorithms for compressed sensing," Proc. Nat. Acad. Sci., vol. 106, no. 45, pp. 18 914-18 919, 2009.
    • (2009) Proc. Nat. Acad. Sci. , vol.106 , Issue.45 , pp. 18914-18919
    • Donoho, D.1    Maleki, A.2    Montanari, A.3
  • 20
    • 77950517814 scopus 로고    scopus 로고
    • Counting the faces of randomly-projected hypercubes and orthants, with applications
    • D. Donoho and J. Tanner, "Counting the faces of randomly-projected hypercubes and orthants, with applications," Discrete Comput. Geometry, vol. 43, no. 3, pp. 522-541, 2010.
    • (2010) Discrete Comput. Geometry , vol.43 , Issue.3 , pp. 522-541
    • Donoho, D.1    Tanner, J.2
  • 22
    • 73149095252 scopus 로고    scopus 로고
    • Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
    • D. Donoho and J. Tanner, "Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing," Philos. Trans. Roy. Soc. A, vol. 367, no. 1906, pp. 4273-4293, 2009.
    • (2009) Philos. Trans. Roy. Soc. A , vol.367 , Issue.1906 , pp. 4273-4293
    • Donoho, D.1    Tanner, J.2


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