메뉴 건너뛰기




Volumn , Issue , 2012, Pages 114-117

Medical image denoising using low pass filtering in sparse domain

Author keywords

[No Author keywords available]

Indexed keywords

BLOCKING ARTIFACTS; COMPUTED TOMOGRAPHY; DENOISING APPROACH; HIGHER FREQUENCIES; IMAGE NOISE; INNOVATIVE METHOD; LOW DOSE; LOW-PASS FILTERING; OPTIMIZATION PROBLEMS; OVER-COMPLETE; PEAK SIGNAL TO NOISE RATIO; PHASE INFORMATION; SPARSE CODING; SPARSE REPRESENTATION; WEIGHT MATRICES;

EID: 84881050267     PISSN: 1557170X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMBC.2012.6345884     Document Type: Conference Paper
Times cited : (6)

References (7)
  • 3
    • 33751379736 scopus 로고    scopus 로고
    • Image denoising via sparse and redundant representations over learned dictionaries
    • M. Elad and M. Aharon, "Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries," IEEE Transactions on Image Processing, Vol. 15, No. 12, pp. 3736-3745, 2006.
    • (2006) IEEE Transactions on Image Processing , vol.15 , Issue.12 , pp. 3736-3745
    • Elad, M.1    Aharon, M.2
  • 5
    • 78349258863 scopus 로고    scopus 로고
    • Double sparsity: Learning sparse dictionaries for sparse signal approximation
    • R. Rubinstein, M. Zibulevsky and M. Elad, "Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation," IEEE Transactions on Signal Processing, Vol. 58, no. 3, pp. 1553-1564, 2010.
    • (2010) IEEE Transactions on Signal Processing , vol.58 , Issue.3 , pp. 1553-1564
    • Rubinstein, R.1    Zibulevsky, M.2    Elad, M.3
  • 6
    • 5444237123 scopus 로고    scopus 로고
    • Greed is good: Algorithmic results for sparse approximation
    • J. Tropp, "Greed is good: algorithmic results for sparse approximation," IEEE Transactions on Information Theory, Vol. 50, no. 10, pp. 2231-2241, 2004.
    • (2004) IEEE Transactions on Information Theory , vol.50 , Issue.10 , pp. 2231-2241
    • Tropp, J.1
  • 7
    • 33750383209 scopus 로고    scopus 로고
    • K-svd: An algorithm for designing overcomplete dictionaries for sparse representation
    • November
    • M. Aharon, M. Elad and A. Bruckstein, "K-svd: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Transactions on Signal Processing, p. 4311-4322, November 2006.
    • (2006) IEEE Transactions on Signal Processing , pp. 4311-4322
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3


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