.png){kind=icon}
返回
Sparse Recovery With Block Multiple Measurement Vectors Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2891568.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper investigates the performance of the block multiple measurement vectors (BMMV) algorithm in reconstructing block joint sparse matrices. We prove that if Phi obeys block restricted isometry property with delta(K)(+1) < 1/root K+1, then BMMV perfectly reconstructs any block K-joint sparse matrix X from observations Y = Phi X in K iterations. We also show that BMMV may not reconstruct block K-joint sparse matrices in K iterations under the condition delta(K)(+1) >= 1/root K+1. That is to say, the condition delta(K)(+1) < 1/root K+1 is optimal for the BMMV algorithm.
Keyword:
Sparse recovery
block restricted isometry property
block multiple measurement vectors (BMMV) algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
分享收藏Multiple-measurement vector based implementation for single-measurement vector sparse Bayesian learning with reduced complexity.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏Connected health services: Internet, mobile and wireless technologies in healthcareProceedings of 2011 IEEE International Conference on Service Operations, Logistics and Informatics
Proceedings of 2011 IEEE International Conference on Service Operations, Logistics and InformaticsIF0
PREAI
分享收藏分享收藏
查看更多内容