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

学习稀疏表示的稳定多级字典

Learning Stable Multilevel Dictionaries for Sparse Representations

Arizona State University(亚利桑那州立大学)

Jayaraman J. Thiagarajan, Karthikeyan Natesan Ramamurthy, Andreas Spanias

摘要:

使用学习字典的稀疏表示越来越多地被成功地用于若干数据处理和机器学习应用中。丰富的训练数据的可用性需要开发有效的,鲁棒的和可证明良好的字典学习算法。字典学习算法的目标是建立全局字典,该全局字典可以有效地对与训练样本相似的任何测试数据进行建模。本文提出了一种从大规模数据中学习稀疏表示字典的算法,并证明了所提出的学习算法是稳定的和渐近可推广的。该算法采用了1-D子空间聚类过程,K-超线聚类,以学习一个多层次的字典。我们还提出了一个信息理论的计划,估计在每个级别的学习所需的原子数,并开发一个集成的方法来学习强大的字典。使用所提出的字典,新的测试数据的稀疏代码可以使用低复杂度的追求过程计算。我们证明了所提出的算法的稳定性和泛化特性,使用模拟。我们还评估了多级字典在压缩恢复和子空间学习应用中的实用性。

英文摘要:

Sparse representations using learned dictionaries are being increasingly used with success in several data processing and machine learning applications. The availability of abundant training data necessitates the development of efficient, robust and provably good dictionary learning algorithms. Algorithmic stability and generalization are desirable characteristics for dictionary learning algorithms that aim to build global dictionaries which can efficiently model any test data similar to the training samples. In this paper, we propose an algorithm to learn dictionaries for sparse representations from large scale data, and prove that the proposed learning algorithm is stable and generalizable asymptotically. The algorithm employs a 1-D subspace clustering procedure, the K-hyperline clustering, in order to learn a hierarchical dictionary with multiple levels. We also propose an information-theoretic scheme to estimate the number of atoms needed in each level of learning and develop an ensemble approach to learn robust dictionaries. Using the proposed dictionaries, the sparse code for novel test data can be computed using a low-complexity pursuit procedure. We demonstrate the stability and generalization characteristics of the proposed algorithm using simulations. We also evaluate the utility of the multilevel dictionaries in compressed recovery and subspace learning applications.

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

↑