期刊
SIGNAL PROCESSING
卷 86, 期 3, 页码 533-548出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.sigpro.2005.05.028
关键词
basis pursuit; underdetermined systems of linear equations; random matrix theory; linear programming; overcomplete systems; sparse representations; random signs matrix ensemble; partial Fourier matrix ensemble; partial Hadamard matrix ensemble
Finding the sparsest solution to a set of underdetermined linear equations is NP-hard in general. However, recent research has shown that for certain systems of linear equations, the sparsest solution (i.e. the solution with the smallest number of nonzeros), is also the solution with minimal l(1) norm, and so can be found by a computationally tractable method. For a given n by m matrix Phi defining a system y = Phi alpha, with n
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据