.png){kind=icon}
返回
A Robust Algorithm for Joint-Sparse Recovery
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2009.2028107.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We address the problem of finding a set of sparse signals that have nonzero coefficients in the same locations from a set of their compressed measurements. A mixed l(2,0) norm optimization approach is considered. A cost function appropriate to the joint-sparse problem is developed, and an algorithm is derived. Compared to other convex relaxation based techniques, the results obtained by the proposed method show a clear improvement in both noiseless and noisy environments.
Keyword:
Basis pursuit
compressive sampling
joint-sparse
multiple measurement vectors
sparse representation
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation同时稀疏逼近的算法。第二部分: 凸松弛.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏 没有更多内容
没有更多内容