Performance analysis of joint-sparse recovery from multiple measurement vectors with prior information via convex optimization
Shih-Wei Hu, Gang-Xuan Lin, Sung-Hsien Hsieh, Wei-Jie Liang, Chun-Shien Lu
Abstract
We address the problem of compressed sensing with multiple measurement vectors associated with prior information in order to better reconstruct an original sparse signal. This problem is modeled via convex optimization with ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,1</sub> - ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,1</sub> minimization. We establish bounds on the number of measurements required for successful recovery. Our bounds and geometrical interpretations reveal that if the prior information can decrease the statistical dimension and make it lower than that under the case without prior information, ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,1</sub> - ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,1</sub> minimization improves the recovery performance dramatically. All our findings are further verified via simulations.
BibTeX
@inproceedings{icassp2016_performanceanaly,
title = {Performance analysis of joint-sparse recovery from multiple measurement vectors with prior information via convex optimization},
author = {Shih-Wei Hu and Gang-Xuan Lin and Sung-Hsien Hsieh and Wei-Jie Liang and Chun-Shien Lu},
booktitle = {ICASSP 2016},
year = {2016}
}