极多面体与稀疏表示的恢复
Polar Polytopes and Recovery of Sparse Representations
摘要:
假设我们有一个信号y,我们希望用许多基本原子a_i的线性组合来表示,y=sum_i x_i a_i = Ax。寻找y的最小L0范数表示是一个困难的问题。基寻踪(BP)方法建议找到最小L1范数表示,这对应于可以使用现代LP技术求解的线性规划(LP),并且最近的几位作者已经给出了BP(最小L1范数)和稀疏(最小L0解)表示相同的条件。在本文中,我们探讨这个稀疏表示问题}使用凸多面体的几何,最近引入到该领域的多诺霍。通过考虑对偶LP,我们发现中心对称多面体P的顶点为原子对+-ai的极多面体P特别有助于我们从几何上理解Fuchs和Tropp给出的非单位范数原子集的最优性条件.在探索这个几何,我们能够收紧这些早期的结果,例如,富克斯条件是必要的和充分的L1-唯一最优性,并有情况下,正交匹配追踪(OMP)最终可以找到所有的L1-唯一最优解m非零,即使ERC失败的m,如果允许运行超过m步。
英文摘要:
Suppose we have a signal y which we wish to represent using a linear combination of a number of basis atoms a_i, y=sum_i x_i a_i = Ax. The problem of finding the minimum L0 norm representation for y is a hard problem. The Basis Pursuit (BP) approach proposes to find the minimum L1 norm representation instead, which corresponds to a linear program (LP) that can be solved using modern LP techniques, and several recent authors have given conditions for the BP (minimum L1 norm) and sparse (minimum L0 solutions) representations to be identical. In this paper, we explore this sparse representation problem} using the geometry of convex polytopes, as recently introduced into the field by Donoho. By considering the dual LP we find that the so-called polar polytope P of the centrally-symmetric polytope P whose vertices are the atom pairs +-a_i is particularly helpful in providing us with geometrical insight into optimality conditions given by Fuchs and Tropp for non-unit-norm atom sets. In exploring this geometry we are able to tighten some of these earlier results, showing for example that the Fuchs condition is both necessary and sufficient for L1-unique-optimality, and that there are situations where Orthogonal Matching Pursuit (OMP) can eventually find all L1-unique-optimal solutions with m nonzeros even if ERC fails for m, if allowed to run for more than m steps.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。