Dictionary Learning for Sparse Coding : Algorithms and Convergence Analysis

In recent years, sparse coding has been widely used in many applications ranging from image processing to pattern recognition. Most existing sparse coding based applications require solving a class of challenging non-smooth and non-convex optimization problems. Despite the fact that many numerical m...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 38(2016), 7 vom: 15. Juli, Seite 1356-69
1. Verfasser: Bao, Chenglong (VerfasserIn)
Weitere Verfasser: Ji, Hui, Quan, Yuhui, Shen, Zuowei
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2016
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM253540038
003 DE-627
005 20231224170434.0
007 cr uuu---uuuuu
008 231224s2016 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2015.2487966  |2 doi 
028 5 2 |a pubmed24n0845.xml 
035 |a (DE-627)NLM253540038 
035 |a (NLM)26452248 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Bao, Chenglong  |e verfasserin  |4 aut 
245 1 0 |a Dictionary Learning for Sparse Coding  |b Algorithms and Convergence Analysis 
264 1 |c 2016 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 06.06.2017 
500 |a Date Revised 06.06.2017 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a In recent years, sparse coding has been widely used in many applications ranging from image processing to pattern recognition. Most existing sparse coding based applications require solving a class of challenging non-smooth and non-convex optimization problems. Despite the fact that many numerical methods have been developed for solving these problems, it remains an open problem to find a numerical method which is not only empirically fast, but also has mathematically guaranteed strong convergence. In this paper, we propose an alternating iteration scheme for solving such problems. A rigorous convergence analysis shows that the proposed method satisfies the global convergence property: the whole sequence of iterates is convergent and converges to a critical point. Besides the theoretical soundness, the practical benefit of the proposed method is validated in applications including image restoration and recognition. Experiments show that the proposed method achieves similar results with less computation when compared to widely used methods such as K-SVD 
650 4 |a Journal Article 
700 1 |a Ji, Hui  |e verfasserin  |4 aut 
700 1 |a Quan, Yuhui  |e verfasserin  |4 aut 
700 1 |a Shen, Zuowei  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 38(2016), 7 vom: 15. Juli, Seite 1356-69  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:38  |g year:2016  |g number:7  |g day:15  |g month:07  |g pages:1356-69 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2015.2487966  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 38  |j 2016  |e 7  |b 15  |c 07  |h 1356-69