메뉴 건너뛰기




Volumn , Issue , 2007, Pages 129-132

Tree-based majorize-maximize algorithm for compressed sensing with sparse-tree prior

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE PROCESSING; COMPRESSED SENSING; IN TREES; LINEAR INVERSE PROBLEMS; MULTI SCALING; MULTI SENSORS; NUMERICA L RESULTS; RECONSTRUCTION QUALITY; SIGNALS OF INTEREST; SPARSE REPRESENTATIONS;

EID: 50249145166     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CAMSAP.2007.4497982     Document Type: Conference Paper
Times cited : (12)

References (9)
  • 1
    • 33645712892 scopus 로고    scopus 로고
    • Compressed sensing
    • Apr
    • D. L. Donoho, "Compressed sensing," IEEE Trans. Inform. Th., vol. 52, pp. 1289-1306, Apr. 2006.
    • (2006) IEEE Trans. Inform. Th , vol.52 , pp. 1289-1306
    • Donoho, D.L.1
  • 2
    • 33947416035 scopus 로고    scopus 로고
    • Near optimal signal recovery from random projections: Universal encoding strategies?
    • Dec
    • E. J. Candes and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inform. Th., vol. 52, pp. 5406-5425, Dec. 2006.
    • (2006) IEEE Trans. Inform. Th , vol.52 , pp. 5406-5425
    • Candes, E.J.1    Tao, T.2
  • 3
    • 33748525584 scopus 로고    scopus 로고
    • Signal recovery from partial information via orthogonal matching pursuit
    • Apr, submitted
    • J. A. Tropp and A. C. Gilbert, "Signal recovery from partial information via orthogonal matching pursuit," IEEE Trans. Inform. Th., Apr. 2005, submitted.
    • (2005) IEEE Trans. Inform. Th
    • Tropp, J.A.1    Gilbert, A.C.2
  • 5
    • 7044231546 scopus 로고    scopus 로고
    • An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
    • I. Daubechies, M. De Friese, and C. De Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Comm. Pure and Applied Math., vol. 57, pp. 3601-3608, 2004.
    • (2004) Comm. Pure and Applied Math , vol.57 , pp. 3601-3608
    • Daubechies, I.1    De Friese, M.2    De Mol, C.3
  • 7
    • 36949031800 scopus 로고    scopus 로고
    • Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
    • Submitted
    • M. Elad, B. Matalon, and M. Zibulevsky, "Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization," Journal of Appl. and Comput. Harmonic Analysis, 2006, Submitted.
    • (2006) Journal of Appl. and Comput. Harmonic Analysis
    • Elad, M.1    Matalon, B.2    Zibulevsky, M.3
  • 9
    • 0026686048 scopus 로고    scopus 로고
    • R. R. Coifman and M. V. Wickerhauser, Entropy-based algorithms for best basis selection, IEEE Transactions on Information Theory, Special Issue on Wavelet Transforms and Multiresolution Signal Analysis, 38, no. 2, pp. 713-718, March 1992.
    • R. R. Coifman and M. V. Wickerhauser, "Entropy-based algorithms for best basis selection," IEEE Transactions on Information Theory, Special Issue on Wavelet Transforms and Multiresolution Signal Analysis, vol. 38, no. 2, pp. 713-718, March 1992.


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