The Improved Bounds of Restricted Isometry Constant for Recovery via ℓp-Minimization
Lists
Only you see this
Abstract
Nonconvex ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</sub> -minimization with p ∈ (0,1) has been studied recently in the context of compressed sensing. In this paper, we prove that as long as the sensing matrix A ∈ R <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m×n</sup> satisfies restricted isometry property with δ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2k</sub> ∈ (0,1), every k-sparse signal x ∈ R <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> can be recovered exactly from linear measurement y=Ax via solving some ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</sub> -minimization problem. In fact, it is shown that p <; min {1,1.0873(1-δ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2k</sub> )} suffices for the exact k-sparse recovery of ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</sub> -minimization, which improves the existing results greatly.
BibTeX
@article{wu2013improved,
author = {Rui Wu and Di-Rong Chen},
title = {{The Improved Bounds of Restricted Isometry Constant for Recovery via ℓp-Minimization}},
journal = {IEEE Trans. Information Theory},
year = {2013},
url = {https://openreview.net/forum?id=hBLn-q9jAQ},
}Loading related content...