메뉴 건너뛰기




Volumn , Issue , 2012, Pages 2165-2168

Object classification with efficient global self-similarity descriptors based on sparse representations

Author keywords

Feature Extraction; Object Classification; Self Similarity

Indexed keywords

DESCRIPTORS; EXTRACTING INFORMATION; MULTIPLE SCALE; OBJECT CLASS; OBJECT CLASSIFICATION; SELF-SIMILARITIES; SPARSE REPRESENTATION;

EID: 84875823666     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2012.6467322     Document Type: Conference Paper
Times cited : (2)

References (12)
  • 6
    • 33750383209 scopus 로고    scopus 로고
    • K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    • Nov.
    • M. Aharon, M. Elad, and A. Bruckstein, "K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Transactions on Signal Processing, vol. 54, no. 11, pp. 4311-4322, Nov. 2006.
    • (2006) IEEE Transactions on Signal Processing , vol.54 , Issue.11 , pp. 4311-4322
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3
  • 9
    • 0027842081 scopus 로고
    • Matching pursuits with time-frequency dictionaries
    • Dec.
    • S.G. Mallat and Zhifeng Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Transactions on Signal Processing, vol. 41, no. 12, pp. 3397-3415, Dec 1993.
    • (1993) IEEE Transactions on Signal Processing , vol.41 , Issue.12 , pp. 3397-3415
    • Mallat, S.G.1    Zhang, Z.2
  • 10
    • 80052341119 scopus 로고    scopus 로고
    • Efficient implementation of the K-SVD algorithm using batch orthogonal matching pursuit
    • R. Rubinstein, M. Zibulevsky, and M. Elad, "Efficient implementation of the k-svd algorithm using batch orthogonal matching pursuit," CS Technion, 2008.
    • (2008) CS Technion
    • Rubinstein, R.1    Zibulevsky, M.2    Elad, M.3


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