arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1005.0202cs.ITmath.IT
收藏

块稀疏表示的字典优化

Dictionary Optimization for Block-Sparse Representations

Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Eldar

摘要:

最近的工作表明,使用精心设计的字典,而不是一个预定义的,可以提高稀疏性联合表示一类信号。这激发了用于设计字典的学习方法的推导,该字典导致给定信号集合的稀疏表示。在一些应用中,感兴趣的信号可以具有进一步的结构,使得它们可以通过少量子空间(例如,面部识别和运动分割)。这意味着存在一个字典,一旦它的原子被正确地排序到块中,它就能够对输入信号进行块稀疏表示。在本文中,我们提出了一个算法学习一组给定的信号块稀疏字典。我们不需要将信号关联成组(子空间)的先验知识。相反,我们开发了一种自动检测底层块结构的方法。这是通过在更新字典的块结构和更新字典原子之间迭代交替以更好地适应数据来实现的。实验结果表明,对于块稀疏数据,该算法显着提高了字典恢复能力,降低了表示错误相比,字典学习方法,不采用块结构。

英文摘要:

Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has motivated the derivation of learning methods for designing a dictionary which leads to the sparsest representation for a given set of signals. In some applications, the signals of interest can have further structure, so that they can be well approximated by a union of a small number of subspaces (e.g., face recognition and motion segmentation). This implies the existence of a dictionary which enables block-sparse representations of the input signals once its atoms are properly sorted into blocks. In this paper, we propose an algorithm for learning a block-sparsifying dictionary of a given set of signals. We do not require prior knowledge on the association of signals into groups (subspaces). Instead, we develop a method that automatically detects the underlying block structure. This is achieved by iteratively alternating between updating the block structure of the dictionary and updating the dictionary atoms to better fit the data. Our experiments show that for block-sparse data the proposed algorithm significantly improves the dictionary recovery ability and lowers the representation error compared to dictionary learning methods that do not employ block structure.

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

↑