arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.03267cs.LGstat.ML
收藏

基于树的词典学习框架

A Tree-based Dictionary Learning Framework

Fraunhofer SCS(弗劳恩霍夫安全信息技术研究所);University of Göttingen(哥廷根大学)

Renato Budinich, Gerlind Plonka

摘要:

我们提出了一个新的大纲的自适应字典学习方法的稀疏编码的基础上的层次聚类的训练数据。通过递归应用的聚类方法,数据被组织成一个二叉划分树表示多尺度结构。基于划分树中的数据簇自适应地定义字典原子。这种方法可以被解释为离散Haar小波变换的推广。此外,可以简单地并入关于字典元素的期望结构的任何先验知识。我们提出的算法的计算复杂性取决于所采用的聚类方法和数据点之间的相似性度量。由于分区树的多尺度属性,我们的字典的结构:当使用正交匹配追踪从自然图像中重建补丁,字典原子对应的节点更接近树中的根结点有一个倾向于使用更大的系数。

英文摘要:

We propose a new outline for adaptive dictionary learning methods for sparse encoding based on a hierarchical clustering of the training data. Through recursive application of a clustering method, the data is organized into a binary partition tree representing a multiscale structure. The dictionary atoms are defined adaptively based on the data clusters in the partition tree. This approach can be interpreted as a generalization of a discrete Haar wavelet transform. Furthermore, any prior knowledge on the wanted structure of the dictionary elements can be simply incorporated. The computational complexity of our proposed algorithm depends on the employed clustering method and on the chosen similarity measure between data points. Thanks to the multiscale properties of the partition tree, our dictionary is structured: when using Orthogonal Matching Pursuit to reconstruct patches from a natural image, dictionary atoms corresponding to nodes being closer to the root node in the tree have a tendency to be used with greater coefficients.

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

↑