메뉴 건너뛰기




Volumn , Issue , 2010, Pages 2691-2698

Discriminative K-SVD for dictionary learning in face recognition

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE APPROACH; CLASSIFICATION ERRORS; DICTIONARY LEARNING; FACE DATABASE; FACE RECOGNITION SCHEMES; FISHER CRITERION; HUMAN SUBJECTS; ITERATIVE APPROXIMATIONS; LINEAR CLASSIFIERS; OBJECTIVE FUNCTIONS; OPTIMAL DISCRIMINATIONS; OPTIMIZATION PROCEDURES; OVER-COMPLETE; SUB-PROBLEMS;

EID: 77955998411     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5539989     Document Type: Conference Paper
Times cited : (1257)

References (23)
  • 1
    • 33750383209 scopus 로고    scopus 로고
    • K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    • 1, 2
    • M. Aharon, M. Elad, and A. Bruckstein. K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE Transactions on signal processing, 54(11):4311, 2006. 1, 2
    • (2006) IEEE Transactions on Signal Processing , vol.54 , Issue.11 , pp. 4311
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3
  • 7
    • 31744440684 scopus 로고    scopus 로고
    • Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
    • 2
    • E. Candes, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on information theory, 52(2):489-509, 2006. 2
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.2 , pp. 489-509
    • Candes, E.1    Romberg, J.2    Tao, T.3
  • 8
    • 0026116468 scopus 로고
    • Orthogonal least squares learning algorithm for radial basis function networks
    • 4
    • S. Chen, C. Cowan, P. Grant, et al. Orthogonal least squares learning algorithm for radial basis function networks. IEEE Transactions on neural networks, 2(2):302-309, 1991. 4
    • (1991) IEEE Transactions on Neural Networks , vol.2 , Issue.2 , pp. 302-309
    • Chen, S.1    Cowan, C.2    Grant, P.3
  • 10
    • 33751379736 scopus 로고    scopus 로고
    • Image denoising via sparse and redundant representations over learned dictionaries
    • 1
    • M. Elad and M. Aharon. Image denoising via sparse and redundant representations over learned dictionaries. IEEE Transactions on Image Processing, 15(12):3736-3745, 2006. 1
    • (2006) IEEE Transactions on Image Processing , vol.15 , Issue.12 , pp. 3736-3745
    • Elad, M.1    Aharon, M.2
  • 11
    • 39449126969 scopus 로고    scopus 로고
    • Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems
    • 4
    • M. Figueiredo, R. Nowak, and S. Wright. Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE Journal on selected topics in Signal Processing, 1(4):586-597, 2007. 4
    • (2007) IEEE Journal on Selected Topics in Signal Processing , vol.1 , Issue.4 , pp. 586-597
    • Figueiredo, M.1    Nowak, R.2    Wright, S.3
  • 12
    • 0035363672 scopus 로고    scopus 로고
    • From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose
    • 1
    • A. Georghiades, P. Belhumeur, and D. Kriegman. From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose. IEEE Trans. Pattern Anal. Mach. Intelligence, 23(6):643-660, 2001. 1
    • (2001) IEEE Trans. Pattern Anal. Mach. Intelligence , vol.23 , Issue.6 , pp. 643-660
    • Georghiades, A.1    Belhumeur, P.2    Kriegman, D.3
  • 13
    • 18144420071 scopus 로고    scopus 로고
    • Acquiring Linear Subspaces for Face Recognition under Variable Lighting
    • 2, 6
    • K. Lee, J. Ho, and D. Kriegman. Acquiring Linear Subspaces for Face Recognition under Variable Lighting . IEEE Trans. Pattern Anal. Mach. Intelligence, 27(5):684-698, 2005. 2, 6
    • (2005) IEEE Trans. Pattern Anal. Mach. Intelligence , vol.27 , Issue.5 , pp. 684-698
    • Lee, K.1    Ho, J.2    Kriegman, D.3
  • 17
    • 0004171986 scopus 로고    scopus 로고
    • The AR face database
    • Univ. Purdue, 2
    • A. Martinez and R. Benavente. The AR face database. Univ. Purdue, CVC Tech. Rep, 24, 1998. 2
    • (1998) CVC Tech. Rep , vol.24
    • Martinez, A.1    Benavente, R.2
  • 19
    • 64249142446 scopus 로고    scopus 로고
    • Computation and relaxation of conditions for equivalence between l1 and l0 minimization
    • submitted to 5
    • Y. Sharon, J. Wright, and Y. Ma. Computation and relaxation of conditions for equivalence between l1 and l0 minimization. submitted to IEEE Transactions on Information Theory, 2007. 5
    • (2007) IEEE Transactions on Information Theory
    • Sharon, Y.1    Wright, J.2    Ma, Y.3
  • 20
    • 33645712308 scopus 로고    scopus 로고
    • Just relax: Convex programming methods for identifying sparse signals in noise
    • 4
    • J. Tropp. Just relax: Convex programming methods for identifying sparse signals in noise. IEEE Transactions on Information Theory, 52(3):1030-1051, 2006. 4
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.3 , pp. 1030-1051
    • Tropp, J.1


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