{"title":"Improved online dictionary learning for sparse signal representation","authors":"F. Yeganli, Hüseyin Özkaramanli","doi":"10.1109/SIU.2014.6830576","DOIUrl":null,"url":null,"abstract":"In this paper a new dictionary learning algorithm is proposed. Similar to many dictionary learning algorithms, the proposed algorithm alternates between two stages. First, sparse coding stage uses the current dictionary to obtain the sparse representation coefficients. Herein, the orthogonal matching pursuit algorithm is used for sparse coding. Second, a dictionary update stage that employs the calculated coefficients to update the dictionary and is based on iterative least squares method. The autocorrelation and the cross correlation between the sparse coding coefficients and the training data are estimated recursively by applying a forgetting factor. The variable step size which depends on the forgetting factor and autocorrelation function is derived. The simulation results indicate that representation ability of dictionaries designed by the proposed method has improved SNR compared to those designed with existing state of the art algorithms with faster convergence. Preliminary results for single image super-resolution are promising.","PeriodicalId":384835,"journal":{"name":"2014 22nd Signal Processing and Communications Applications Conference (SIU)","volume":"06 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 22nd Signal Processing and Communications Applications Conference (SIU)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU.2014.6830576","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In this paper a new dictionary learning algorithm is proposed. Similar to many dictionary learning algorithms, the proposed algorithm alternates between two stages. First, sparse coding stage uses the current dictionary to obtain the sparse representation coefficients. Herein, the orthogonal matching pursuit algorithm is used for sparse coding. Second, a dictionary update stage that employs the calculated coefficients to update the dictionary and is based on iterative least squares method. The autocorrelation and the cross correlation between the sparse coding coefficients and the training data are estimated recursively by applying a forgetting factor. The variable step size which depends on the forgetting factor and autocorrelation function is derived. The simulation results indicate that representation ability of dictionaries designed by the proposed method has improved SNR compared to those designed with existing state of the art algorithms with faster convergence. Preliminary results for single image super-resolution are promising.