메뉴 건너뛰기




Volumn , Issue , 2014, Pages 3858-3865

L0 norm based dictionary learning by proximal methods with global convergence

Author keywords

dictionary learning; global convergence; proximal method

Indexed keywords

CONVEX OPTIMIZATION; FACE RECOGNITION; ITERATIVE METHODS;

EID: 84911417441     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2014.493     Document Type: Conference Paper
Times cited : (76)

References (28)
  • 1
    • 33750383209 scopus 로고    scopus 로고
    • K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation
    • M. Aharon and M. E. Bruckstein. K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process., 2006.
    • (2006) IEEE Trans. Signal Process
    • Aharon, M.1    Bruckstein, M.E.2
  • 3
    • 45749101721 scopus 로고    scopus 로고
    • On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
    • H. Attouch and J. Bolte. On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Mathematical Programming, 2009.
    • (2009) Mathematical Programming
    • Attouch, H.1    Bolte, J.2
  • 4
    • 85014561619 scopus 로고    scopus 로고
    • A fast iterative shrinkage-thresholding algorithm for linear inverse problems
    • A. Beck and M. Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci., 2009.
    • (2009) SIAM J Imaging Sci.
    • Beck, A.1    Teboulle, M.2
  • 6
    • 84900531042 scopus 로고    scopus 로고
    • Data-driven tight frame construction and image denoising
    • In Press
    • J. Cai, H. Ji, Z. Shen, and G. Ye. Data-driven tight frame construction and image denoising. Appl. Comp. Harm. Anal., In Press, 2014.
    • (2014) Appl. Comp. Harm. Anal.
    • Cai, J.1    Ji, H.2    Shen, Z.3    Ye, G.4
  • 8
    • 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 Trans. Image Process, 2006.
    • (2006) IEEE Trans. Image Process
    • Elad, M.1    Aharon, M.2
  • 9
    • 1542784498 scopus 로고    scopus 로고
    • Variable selection via nonconcave penalized likelihood and its oracle properties
    • J. Fan and R. Li. Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Statist. Assoc., 2001.
    • (2001) J. Am. Statist. Assoc.
    • Fan, J.1    Li, R.2
  • 11
    • 22344435746 scopus 로고    scopus 로고
    • From few to many: Illumination cone models for face recognition under variable lighting and pose
    • A. S. Georghiades, P. N. Belhumeur, and D. J. Kriegman. From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE PAMI, 2001.
    • (2001) IEEE PAMI
    • Georghiades, A.S.1    Belhumeur, P.N.2    Kriegman, D.J.3
  • 12
    • 53349163971 scopus 로고    scopus 로고
    • A fixed-point continuation method for i\-regularized minimization with applications to compressed sensing
    • E. T. Hale, W. Yin, and Y. Zhang. A fixed-point continuation method for i\-regularized minimization with applications to compressed sensing. CAAM Report, 2007.
    • (2007) CAAM Report
    • Hale, E.T.1    Yin, W.2    Zhang, Y.3
  • 13
    • 77956506018 scopus 로고    scopus 로고
    • Proximal methods for sparse hierarchical dictionary learning
    • R. Jenatton, J. Mairal, F. R. Bach, and G. R. Obozinski. Proximal methods for sparse hierarchical dictionary learning. In ICML, 2010.
    • (2010) ICML
    • Jenatton, R.1    Mairal, J.2    Bach, F.R.3    Obozinski, G.R.4
  • 14
    • 84911417663 scopus 로고    scopus 로고
    • Proximal alternating linearized minimization for nonconvex and nonsmooth problems
    • B. Jerome, S. Shoham, and M. Teboulle. Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Mathematical Programming, 2013.
    • (2013) Mathematical Programming
    • Jerome, B.1    Shoham, S.2    Teboulle, M.3
  • 15
    • 80052901219 scopus 로고    scopus 로고
    • Learning a dicscriminative dictionary for sparse coding via label consistent K-SVD
    • Z. Jiang, Z. Lin, and L. Davis. Learning a dicscriminative dictionary for sparse coding via label consistent K-SVD. In CVPR, 2011.
    • (2011) CVPR
    • Jiang, Z.1    Lin, Z.2    Davis, L.3
  • 16
    • 76749107542 scopus 로고    scopus 로고
    • Online learning for matrix factorization and sparse coding
    • J. Mairal, F Bach, J. Ponce, and G. Sapiro. Online learning for matrix factorization and sparse coding. JMLR, 2010.
    • (2010) JMLR
    • Mairal, J.1    Bach, F.2    Ponce, J.3    Sapiro, G.4
  • 20
    • 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
  • 21
    • 80052910914 scopus 로고    scopus 로고
    • A non-convex relaxation approach to sparse dictionary learning
    • J. Shi, X. Ren, G. Dai, J. Wang, and Z. Zhang. A non-convex relaxation approach to sparse dictionary learning. In CVPR, 2011.
    • (2011) CVPR
    • Shi, J.1    Ren, X.2    Dai, G.3    Wang, J.4    Zhang, Z.5
  • 22
    • 84877778467 scopus 로고    scopus 로고
    • Scalable nonconvex inexact proximal splitting
    • S. Sra. Scalable nonconvex inexact proximal splitting. In NIPS, 2012.
    • (2012) NIPS
    • Sra, S.1
  • 24
    • 5444237123 scopus 로고    scopus 로고
    • Greed is good: Algorithmic results for sparse approximation
    • A. Tropp. Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inf. Theory, 2004.
    • (2004) IEEE Trans. Inf. Theory
    • Tropp, A.1
  • 25
    • 70049111607 scopus 로고    scopus 로고
    • On accelerated proximal gradient methods for convex-concave optimization
    • P. Tseng. On accelerated proximal gradient methods for convex-concave optimization. SIAM J. Optimiz., 2008.
    • (2008) SIAM J. Optimiz.
    • Tseng, P.1
  • 26
    • 84906331881 scopus 로고    scopus 로고
    • A fast patch-dictionary method for the whole image recovery
    • Y Xu and W Yin. A fast patch-dictionary method for the whole image recovery. UCLA CAM report, 2013.
    • (2013) UCLA CAM Report
    • Xu, Y.1    Yin, W.2
  • 27
    • 77649284492 scopus 로고    scopus 로고
    • Nearly unbiased variable selection under min-imax concave penalty
    • C.-H. Zhang. Nearly unbiased variable selection under min-imax concave penalty. The Annals of Statistics, 2010.
    • (2010) The Annals of Statistics
    • Zhang, C.-H.1
  • 28
    • 77955998411 scopus 로고    scopus 로고
    • Discriminative K-SVD for dictionary learning in face recognition
    • Q. Zhang and B. Li. Discriminative K-SVD for dictionary learning in face recognition. In CVPR, 2010.
    • (2010) CVPR
    • Zhang, Q.1    Li, B.2


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