<< Chapter < Page Chapter >> Page >

Let ϵ ( 0 , 1 ) be given. There exists a set of points Q such that q 2 = 1 for all q Q , | Q | ( 3 / ϵ ) K , and for any x R K with x 2 = 1 there is a point q Q satisfying x - q 2 ϵ .

We construct Q in a greedy fashion. We first select an arbitrary point q 1 R K with q 1 2 = 1 . We then continue adding points to Q so that at step i we add a point q i R K with q i 2 = 1 which satisfies q i - q j 2 > ϵ for all j < i . This continues until we can add no more points (and hence for any x R K with x 2 = 1 there is a point q Q satisfying x - q 2 ϵ .) Now we wish to bound | Q | . Observe that if we center balls of radius ϵ / 2 at each point in Q , then these balls are disjoint and lie within a ball of radius 1 + ϵ / 2 . Thus, if B K ( r ) denotes a ball of radius r in R K , then

| Q | · Vol B K ( ϵ / 2 ) Vol B K ( 1 + ϵ / 2 )

and hence

| Q | Vol B K ( 1 + ϵ / 2 ) Vol B K ( ϵ / 2 ) = ( 1 + ϵ / 2 ) K ( ϵ / 2 ) K 3 / ϵ K .

We now turn to our main theorem, which is based on the proof given in [link] .

Fix δ ( 0 , 1 ) . Let Φ be an M × N random matrix whose entries φ i j are i.i.d. with φ i j SSub ( 1 / M ) . If

M κ 1 K log N K ,

then Φ satisfies the RIP of order K with the prescribed δ with probability exceeding 1 - 2 e - κ 2 M , where κ 1 > 1 is arbitrary and κ 2 = δ 2 / 2 κ * - 1 / κ 1 - log ( 42 e / δ ) .

First note that it is enough to prove [link] in the case x 2 = 1 , since Φ is linear. Next, fix an index set T { 1 , 2 , ... , N } with | T | = K , and let X T denote the K -dimensional subspace spanned by the columns of Φ T . We choose a finite set of points Q T such that Q T X T , q 2 = 1 for all q Q T , and for all x X T with x 2 = 1 we have

min q Q T x - q 2 δ / 14 .

From [link] , we can choose such a set Q T with | Q T | ( 42 / δ ) K . We then repeat this process for each possible index set T , and collect all the sets Q T together:

Q = T : | T | = K Q T .

There are N K possible index sets T . We can bound this number by

N K = N ( N - 1 ) ( N - 2 ) ( N - K + 1 ) K ! N K K ! e N K K ,

where the last inequality follows since from Sterling's approximation we have K ! ( K / e ) K . Hence | Q | ( 42 e N / δ K ) K . Since the entries of Φ are drawn according to a strictly sub-Gaussian distribution, from [link] we have [link] . We next use the union bound to apply [link] to this set of points with ϵ = δ / 2 , with the result that, with probability exceeding

1 - 2 ( 42 e N / δ K ) K e - M δ 2 / 2 κ * ,

we have

( 1 - δ / 2 ) q 2 2 Φ q 2 2 ( 1 + δ / 2 ) q 2 2 , for all q Q .

We observe that if M satisfies [link] then

log 42 e N δ K K K log N K + log 42 e δ M κ 1 + M log 42 e δ

and thus [link] exceeds 1 - 2 e - κ 2 M as desired.

We now define A as the smallest number such that

Φ x 2 1 + A , for all x Σ K , x 2 = 1 .

Our goal is to show that A δ . For this, we recall that for any x Σ K with x 2 = 1 , we can pick a q Q such that x - q 2 δ / 14 and such that x - q Σ K (since if x X T , we can pick q Q T X T satisfying x - q 2 δ / 14 ). In this case we have

Φ x 2 Φ q 2 + Φ ( x - q ) 2 1 + δ / 2 + 1 + A · δ / 14 .

Since by definition A is the smallest number for which [link] holds, we obtain 1 + A 1 + δ / 2 + 1 + A · δ / 14 . Therefore

1 + A 1 + δ / 2 1 - δ / 14 1 + δ ,

as desired. We have proved the upper inequality in [link] . The lower inequality follows from this since

Φ x 2 Φ q 2 - Φ ( x - q ) 2 1 - δ / 2 - 1 + δ · δ / 14 1 - δ ,

which completes the proof.

Above we prove above that the RIP holds with high probability when the matrix Φ is drawn according to a strictly sub-Gaussian distribution. However, we are often interested in signals that are sparse or compressible in some orthonormal basis Ψ I , in which case we would like the matrix Φ Ψ to satisfy the RIP. In this setting it is easy to see that by choosing our net of points in the K -dimensional subspaces spanned by sets of K columns of Ψ , [link] will establish the RIP for Φ Ψ for Φ again drawn from a sub-Gaussian distribution. This universality of Φ with respect to the sparsity-inducing basis is an attractive property that was initially observed for the Gaussian distribution (based on symmetry arguments), but we can now see is a property of more general sub-Gaussian distributions. Indeed, it follows that with high probability such a Φ will simultaneously satisfy the RIP with respect to an exponential number of fixed bases.

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, An introduction to compressive sensing. OpenStax CNX. Apr 02, 2011 Download for free at http://legacy.cnx.org/content/col11133/1.5
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'An introduction to compressive sensing' conversation and receive update notifications?

Ask