<< Chapter < Page | Chapter >> Page > |
We begin with a property of the null space which is at the heart of proving results on instance-optimality.
We say that has the Null Space Property if for all and all with we have
Intuitively, NSP implies that for any vector in the nullspace the energy will not be concentrated in a small number of entries.
The following are equivalent formulations for NSP for :
Note also that the triangle inequality can be used as follows
which shows that (b) is equivalent to NSP.
We will prove a slightly weaker version of this to save time. We first prove that instance optimality for
implies NSP
for
(hence this is slightly weaker than advertised) . Let
and set
then We now prove 2. Suppose
has the NSP for
. Given
,
. Let us define the decoder
by
, then
QED.
Note that the instance optimal property automatically gives reproduction of -sparse signals.
At this stage the challenge is to create with this instance optimal property. For this we shall use the restricted isometry property as introduced earlier and which we now recall.
Notification Switch
Would you like to follow the 'Compressive sensing' conversation and receive update notifications?