arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1611.08230cs.LG
收藏

学习快速稀疏化变换

Learning Fast Sparsifying Transforms

Institute for Digital Communications, School of Engineering, The University of Edinburgh(爱丁堡大学工程学院数字通信研究所)

Cristian Rusu, John Thompson

摘要:

给定一个数据集,学习一个允许数据稀疏表示的变换的任务被称为字典学习。在许多应用中,这些学习的字典比静态的众所周知的变换(傅立叶,阿达玛等)更好地表示数据。学习变换的主要缺点是它们缺乏结构,因此与经典变换不同,它们的计算效率不高。尤其是当使用诸如移动设备的功率受限的硬件时,这些带来了若干困难,因此阻碍了稀疏技术在这样的场景中的应用。在本文中,我们构造正交和非正交字典,分解为几个基本变换的产品。在正交的情况下,我们完全解决了字典更新问题的一个基本的变换,这可以被看作是一个广义的吉文斯旋转,然后建议构建正交字典,这些变换的产品,保证他们的快速操作。我们还提出了一种方法来构建快速的平方,但非正交的字典,分解为产品的几个变换,可以被视为进一步推广的吉文斯旋转的非正交设置。我们展示了如何建议的变换可以很好地平衡数据表示性能和计算复杂性。我们还比较了经典的快速和学习的一般和正交变换。

英文摘要:

Given a dataset, the task of learning a transform that allows sparse representations of the data bears the name of dictionary learning. In many applications, these learned dictionaries represent the data much better than the static well-known transforms (Fourier, Hadamard etc.). The main downside of learned transforms is that they lack structure and therefore they are not computationally efficient, unlike their classical counterparts. These posse several difficulties especially when using power limited hardware such as mobile devices, therefore discouraging the application of sparsity techniques in such scenarios. In this paper we construct orthogonal and non-orthogonal dictionaries that are factorized as a product of a few basic transformations. In the orthogonal case, we solve exactly the dictionary update problem for one basic transformation, which can be viewed as a generalized Givens rotation, and then propose to construct orthogonal dictionaries that are a product of these transformations, guaranteeing their fast manipulation. We also propose a method to construct fast square but non-orthogonal dictionaries that are factorized as a product of few transforms that can be viewed as a further generalization of Givens rotations to the non-orthogonal setting. We show how the proposed transforms can balance very well data representation performance and computational complexity. We also compare with classical fast and learned general and orthogonal transforms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑