메뉴 건너뛰기




Volumn 36, Issue 3, 2014, Pages 495-507

Optimized projections for compressed sensing via rank-constrained nearest correlation matrix

Author keywords

Acquisition; Compressed sensing; Nearest correlation matrix; Optimization

Indexed keywords

ALGORITHMS; COMPRESSED SENSING; CONSTRAINED OPTIMIZATION; MERGERS AND ACQUISITIONS; OPTIMIZATION;

EID: 84895927017     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2013.08.005     Document Type: Article
Times cited : (37)

References (23)
  • 2
    • 33745604236 scopus 로고    scopus 로고
    • Stable signal recovery from incomplete and inaccurate measurements
    • E.J. Candès, J.K. Romberg, and T. Tao Stable signal recovery from incomplete and inaccurate measurements Comm. Pure Appl. Math. 59 2006 1207 1223
    • (2006) Comm. Pure Appl. Math. , vol.59 , pp. 1207-1223
    • Candès, E.J.1    Romberg, J.K.2    Tao, T.3
  • 3
  • 5
    • 69949164527 scopus 로고    scopus 로고
    • Iterative hard thresholding for compressed sensing
    • T. Blumensath, and M.E. Davies Iterative hard thresholding for compressed sensing Appl. Comput. Harmon. Anal. 27 3 2009 265 274
    • (2009) Appl. Comput. Harmon. Anal. , vol.27 , Issue.3 , pp. 265-274
    • Blumensath, T.1    Davies, M.E.2
  • 6
    • 33947416035 scopus 로고    scopus 로고
    • Near-optimal signal recovery from random projections: Universal encoding strategies?
    • E. Candes, and T. Tao Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inform. Theory 52 12 2006 5406 5425
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.12 , pp. 5406-5425
    • Candes, E.1    Tao, T.2
  • 7
    • 36749022762 scopus 로고    scopus 로고
    • Optimized projections for compressed sensing
    • M. Elad Optimized projections for compressed sensing IEEE Trans. Signal Process. 55 12 2007 5695 5702
    • (2007) IEEE Trans. Signal Process. , vol.55 , Issue.12 , pp. 5695-5702
    • Elad, M.1
  • 8
    • 77956830813 scopus 로고    scopus 로고
    • Optimized projection matrix for compressive sensing
    • J. Xu, Y. Pi, and Z. Cao Optimized projection matrix for compressive sensing EURASIP J. Adv. Signal Process. 2010 1 2010 560349
    • (2010) EURASIP J. Adv. Signal Process. , vol.2010 , Issue.1 , pp. 560349
    • Xu, J.1    Pi, Y.2    Cao, Z.3
  • 9
    • 67649842407 scopus 로고    scopus 로고
    • Learning to sense sparse signals: Simultaneous sensing matrix and sparsifying dictionary optimization
    • J. Duarte-Carvajalino, and G. Sapiro Learning to sense sparse signals: Simultaneous sensing matrix and sparsifying dictionary optimization IEEE Trans. Image Process. 18 7 2009 1395 1408
    • (2009) IEEE Trans. Image Process. , vol.18 , Issue.7 , pp. 1395-1408
    • Duarte-Carvajalino, J.1    Sapiro, G.2
  • 11
    • 0037418225 scopus 로고    scopus 로고
    • Optimally sparse representation in general (nonorthogonal) dictionaries via l-minimization
    • D.L. Donoho, and M. Elad Optimally sparse representation in general (nonorthogonal) dictionaries via l-minimization Proc. Natl. Acad. Sci. USA 100 5 2003 2197 2202
    • (2003) Proc. Natl. Acad. Sci. USA , vol.100 , Issue.5 , pp. 2197-2202
    • Donoho, D.L.1    Elad, M.2
  • 12
    • 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 2003 3320 3325
    • (2003) IEEE Trans. Inform. Theory , vol.49 , Issue.12 , pp. 3320-3325
    • Gribonval, R.1    Nielsen, M.2
  • 13
    • 5444237123 scopus 로고    scopus 로고
    • Greed is good: Algorithmic results for sparse approximation
    • J. Tropp Greed is good: algorithmic results for sparse approximation IEEE Trans. Inform. Theory 50 10 2004 2231 2242
    • (2004) IEEE Trans. Inform. Theory , vol.50 , Issue.10 , pp. 2231-2242
    • Tropp, J.1
  • 14
    • 0016060859 scopus 로고
    • Lower bounds on the maximum cross correlation of signals (corresp.)
    • L. Welch Lower bounds on the maximum cross correlation of signals (corresp.) IEEE Trans. Inform. Theory 20 3 1974 397 399
    • (1974) IEEE Trans. Inform. Theory , vol.20 , Issue.3 , pp. 397-399
    • Welch, L.1
  • 16
    • 18444386482 scopus 로고    scopus 로고
    • Rank reduction of correlation matrices by majorization
    • R. Pietersz, and P.J.F. Groenen Rank reduction of correlation matrices by majorization Quant. Finance 4 6 2004 649 662
    • (2004) Quant. Finance , vol.4 , Issue.6 , pp. 649-662
    • Pietersz, R.1    Groenen, P.J.F.2
  • 17
    • 84861325244 scopus 로고    scopus 로고
    • Calibrating least squares semidefinite programming with equality and inequality constraints
    • Y. Gao, and D. Sun Calibrating least squares semidefinite programming with equality and inequality constraints SIAM J. Matrix Anal. Appl. 31 3 2009 1432 1457
    • (2009) SIAM J. Matrix Anal. Appl. , vol.31 , Issue.3 , pp. 1432-1457
    • Gao, Y.1    Sun, D.2
  • 18
    • 33750383209 scopus 로고    scopus 로고
    • K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    • M. Aharon, M. Elad, and A. Bruckstein K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation IEEE Trans. Signal Process. 54 11 2006 4311
    • (2006) IEEE Trans. Signal Process. , vol.54 , Issue.11 , pp. 4311
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3
  • 20
    • 58649115827 scopus 로고    scopus 로고
    • A fast approach for overcomplete sparse decomposition based on smoothed l0 norm
    • H. Mohimani, M. Babaie-Zadeh, and C. Jutten A fast approach for overcomplete sparse decomposition based on smoothed l0 norm IEEE Trans. Signal Process. 57 1 2009 289 301
    • (2009) IEEE Trans. Signal Process. , vol.57 , Issue.1 , pp. 289-301
    • Mohimani, H.1    Babaie-Zadeh, M.2    Jutten, C.3
  • 22
    • 80755153635 scopus 로고    scopus 로고
    • Accelerated iterative hard thresholding
    • T. Blumensath Accelerated iterative hard thresholding Signal Process. 92 3 2012 752 756
    • (2012) Signal Process. , vol.92 , Issue.3 , pp. 752-756
    • Blumensath, T.1
  • 23
    • 73149095169 scopus 로고    scopus 로고
    • Message-passing algorithms for compressed sensing
    • D.L. Donoho, A. Maleki, and A. Montanari Message-passing algorithms for compressed sensing Proc. Natl. Acad. Sci. USA 106 45 2009 18914 18919
    • (2009) Proc. Natl. Acad. Sci. USA , vol.106 , Issue.45 , pp. 18914-18919
    • Donoho, D.L.1    Maleki, A.2    Montanari, A.3


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