Non-convex compressed sensing using partial support information

Abstract: In this paper we address the recovery conditions of weighted

e l l_{p}

minimization for signal reconstruction from compressed sensing measurements when partial support information is available. We show that weighted

e l l_{p}

minimization with

0 < p < 1

is stable and robust under weaker sufficient conditions compared to weighted

e l l_{1}

minimization. Moreover, the sufficient recovery conditions of weighted

e l l_{p}

are weaker than those of regular

e l l_{p}

minimization if at least

50 %

of the support estimate is accurate. We also review some algorithms which exist to solve the non-convex

e l l_{p}

problem and illustrate our results with numerical experiments.

Recommendations

Cited in

(12)

This page was built for publication: Non-convex compressed sensing using partial support information