2025-6-21- 8
Home > Archive>Volume 12, Issue 3, 2020 >360-363. DOI:10.13878/j.cnki.jnuist.2020.03.015
PDF HTML XML Export Cite reminder
Convergence of sparse coding based on KKT conditions
Author:
Clc Number:

O232

  • Article
    • | |
  • Metrics
    • |
  • Reference [11]
    • |
  • Related [20]
    • | | |
  • Comments
    Abstract:

    This paper proposes a sparse coding algorithm based on KKT conditions.Firstly,the non-convex non-smooth sparse coding problem is decomposed into two convex non-smooth problems.Secondly,the two convex non-smooth problems are skillfully transformed into three smooth convex optimization problems by using two matrices.Finally,the three problems are solved by KKT conditions.In addition,we prove the convergence of the algorithm.Meanwhile,experimental simulation shows the convergence of the algorithm.

    Reference
    [1] Olshausen B A,Field D J.Emergence of simple-cell receptive field properties by learning a sparse code for natural images[J].Nature,1996,381(6583):607-609
    [2] Olshausen B A,Field D J.Sparse coding with an overcomplete basis set:a strategy employed by V1?[J].Vision Research,1997,37(23):3311-3325
    [3] Labusch K,Barth E,Martinetz T.Simple method for high-performance digit recognition based on sparse coding[J].IEEE Trans Neural Netw,2008,19(11):1985-1989
    [4] He B,Xu D,Rui N,et al.Fast face recognition via sparse coding and extreme learning machine[J].Cognitive Computation,2014,6(2):264-277
    [5] Zheng M,Bu J J,Chen C,et al.Graph regularized sparse coding for image representation[J].IEEE Transactions on Image Processing:a Publication of the IEEE Signal Processing Society,2011,20(5):1327-1336
    [6] Shu Z Q,Zhao C X,Huang P.Constrained sparse concept coding algorithm with application to image representation[J].KSⅡ Transactions on Internet and Information Systems,2014,8(9):3211-3230
    [7] Lörincz A,Palotai Z,Szirtes G.Efficient sparse coding in early sensory processing:lessons from signal recovery[J].PLoS Computational Biology,2012,8(3):e1002372
    [8] Zhao Y X,Liu Z Y,Wang Y Y,et al.Sparse coding algorithm with negentropy and weighted 1-norm for signal reconstruction[J].Entropy,2017,19(11):599
    [9] Bertsekas D P.Nonlinear programming[J].Journal of the Operational Research Society,1997,48:332-334
    [10] Lee H,Battle A,Raina R,et al.Efficient sparse coding algorithms[J].Proc of Nips,2007,19:801-808
    [11] Mairal J,Bach F,Ponce J,et al.Online learning for matrix factorization and sparse coding[J].Journal of Machine Learning Research,2009,11:19-60
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

TAO Yingyin, YANG Yi, DAI Xiangguang, SU Xiaojie. Convergence of sparse coding based on KKT conditions[J]. Journal of Nanjing University of Information Science & Technology,2020,12(3):360-363

Copy
Share
Article Metrics
  • Abstract:335
  • PDF: 1569
  • HTML: 0
  • Cited by: 0
History
  • Received:February 26,2020
  • Online: July 07,2020
Article QR Code

Address：No. 219, Ningliu Road, Nanjing, Jiangsu Province

Postcode：210044

Phone：025-58731025