改进了稀疏信号表示的在线字典学习

F. Yeganli, Hüseyin Özkaramanli
{"title":"改进了稀疏信号表示的在线字典学习","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":"{\"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}","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

摘要

本文提出了一种新的字典学习算法。与许多字典学习算法相似,本文提出的算法在两个阶段之间交替。首先,稀疏编码阶段利用当前字典获取稀疏表示系数。本文采用正交匹配追踪算法进行稀疏编码。其次是基于迭代最小二乘法的字典更新阶段,利用计算出的系数对字典进行更新。利用遗忘因子递归估计稀疏编码系数与训练数据之间的自相关和互相关。导出了依赖于遗忘因子和自相关函数的变步长。仿真结果表明,与现有算法相比,该方法所设计的字典的表示能力得到了提高,而且收敛速度更快。单图像超分辨率的初步结果是有希望的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improved online dictionary learning for sparse signal representation
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信