A dictionary learning algorithm for sparse coding by the normalized bilateral projections

Taro Tezuka
{"title":"A dictionary learning algorithm for sparse coding by the normalized bilateral projections","authors":"Taro Tezuka","doi":"10.1109/MLSP.2014.6958892","DOIUrl":null,"url":null,"abstract":"Sparse coding is a method of expressing the input vector as a linear combination of a few vectors taken from a set of template vectors, often called a dictionary or codebook. A good dictionary is the one that sparse codes most vectors in a given class of possible input vectors. There are currently several proposals to learn a good dictionary from a set of input vectors. Such methods are termed under the title of dictionary learning. We propose a new dictionary learning algorithm, called K-normalized bilateral projections (K-NBP), which is a modification to a widely used dictionary learning method, i.e., K-singular value decomposition (K-SVD). The main idea behind this was to standardize and normalize the input matrix as a preprocessing stage, and to correspondingly normalize the estimated source vectors in the dictionary update stage. The experimental results revealed that our method was fast, and when the number of iterations was limited, it outperformed K-SVD. Also, if only a coarse approximation was needed, it provided results that were almost like those from K-SVD, but with fewer iterations. This indicated that our method was particularly suited to large data sets with many dimensions, where each iteration took a long time.","PeriodicalId":329167,"journal":{"name":"2014 IEEE International Workshop on Machine Learning for Signal Processing (MLSP)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Workshop on Machine Learning for Signal Processing (MLSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MLSP.2014.6958892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Sparse coding is a method of expressing the input vector as a linear combination of a few vectors taken from a set of template vectors, often called a dictionary or codebook. A good dictionary is the one that sparse codes most vectors in a given class of possible input vectors. There are currently several proposals to learn a good dictionary from a set of input vectors. Such methods are termed under the title of dictionary learning. We propose a new dictionary learning algorithm, called K-normalized bilateral projections (K-NBP), which is a modification to a widely used dictionary learning method, i.e., K-singular value decomposition (K-SVD). The main idea behind this was to standardize and normalize the input matrix as a preprocessing stage, and to correspondingly normalize the estimated source vectors in the dictionary update stage. The experimental results revealed that our method was fast, and when the number of iterations was limited, it outperformed K-SVD. Also, if only a coarse approximation was needed, it provided results that were almost like those from K-SVD, but with fewer iterations. This indicated that our method was particularly suited to large data sets with many dimensions, where each iteration took a long time.
一种归一化双边投影稀疏编码的字典学习算法
稀疏编码是一种将输入向量表示为从一组模板向量(通常称为字典或码本)中选取的几个向量的线性组合的方法。一个好的字典是对给定的可能输入向量类中的大多数向量进行稀疏编码的字典。目前有几个建议从一组输入向量中学习一个好的字典。这些方法被称为字典学习。我们提出了一种新的字典学习算法,称为k -归一化双边投影(K-NBP),它是对广泛使用的字典学习方法,即k -奇异值分解(K-SVD)的改进。这背后的主要思想是在预处理阶段对输入矩阵进行标准化和规范化,并在字典更新阶段对估计的源向量进行相应的规范化。实验结果表明,该方法速度快,且在迭代次数有限的情况下优于K-SVD。此外,如果只需要一个粗略的近似,它提供的结果几乎与K-SVD的结果相似,但迭代次数更少。这表明我们的方法特别适合于具有许多维度的大型数据集,其中每次迭代需要很长时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书