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

基于双正交字典的稀疏表示分析

Analysis of Sparse Representations Using Bi-Orthogonal Dictionaries

Mikko Vehkaperä, Yoshiyuki Kabashima, Saikat Chatterjee, Erik Aurell, Mikael Skoglund, Lars Rasmussen

摘要:

考虑了在给定字典D的情况下,从M < N个线性观测值y = Dx中恢复N维稀疏向量x的稀疏表示问题.标准的方法是让字典的元素是独立同分布(IID)的零均值高斯,并在约束y = Dx下最小化x的l1范数。本文分析了字典为双正交字典D = [O 1 O2]时的l1-重构性能,其中O 1,O2是独立的,且在正交矩阵群上按Haar测度一致地画.通过副本方法的应用,我们得到了双正交字典的完美l1-恢复是可能的临界条件。

英文摘要:

The sparse representation problem of recovering an N dimensional sparse vector x from M < N linear observations y = Dx given dictionary D is considered. The standard approach is to let the elements of the dictionary be independent and identically distributed (IID) zero-mean Gaussian and minimize the l1-norm of x under the constraint y = Dx. In this paper, the performance of l1-reconstruction is analyzed, when the dictionary is bi-orthogonal D = [O1 O2], where O1,O2 are independent and drawn uniformly according to the Haar measure on the group of orthogonal M x M matrices. By an application of the replica method, we obtain the critical conditions under which perfect l1-recovery is possible with bi-orthogonal dictionaries.

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

↑