<< Chapter < Page Chapter >> Page >
In this module we demonstrate the difficulty of obtaining instance-optimal guarantees in the L2 norm. We then show that it is much easier to obtain such guarantees in the probabilistic setting.

We now briefly return to the noise-free setting to take a closer look at instance-optimal guarantees for recovering non-sparse signals. To begin, recall that in Theorem 1 from "Noise-free signal recovery" we bounded the 2 -norm of the reconstruction error of

x ^ = arg min z z 1 subject to z B ( y ) .


x ^ - x 2 C 0 σ K ( x ) 1 / K

when B ( y ) = { z : Φ z = y } . One can generalize this result to measure the reconstruction error using the p -norm for any p [ 1 , 2 ] . For example, by a slight modification of these arguments, one can also show that x ^ - x 1 C 0 σ K ( x ) 1 (see  [link] ). This leads us to ask whether we might replace the bound for the 2 error with a result of the form x ^ - x 2 C σ K ( x ) 2 . Unfortunately, obtaining such a result requires an unreasonably large number of measurements, as quantified by the following theorem of  [link] .

(theorem 5.1 of [link] )

Suppose that Φ is an M × N matrix and that Δ : R M R N is a recovery algorithm that satisfies

x - Δ ( Φ x ) 2 C σ K ( x ) 2

for some K 1 , then M > 1 - 1 - 1 / C 2 N .

We begin by letting h R N denote any vector in N ( Φ ) . We write h = h Λ + h Λ c where Λ is an arbitrary set of indices satisfying | Λ | K . Set x = h Λ c , and note that Φ x = Φ h Λ c = Φ h - Φ h Λ = - Φ h Λ since h N ( Φ ) . Since h Λ Σ K , [link] implies that Δ ( Φ x ) = Δ ( - Φ h Λ ) = - h Λ . Hence, x - Δ ( Φ x ) 2 = h Λ c - ( - h Λ ) 2 = h 2 . Furthermore, we observe that σ K ( x ) 2 x 2 , since by definition σ K ( x ) 2 x - x ˜ 2 for all x ˜ Σ K , including x ˜ = 0 . Thus h 2 C h Λ c 2 . Since h 2 2 = h Λ 2 2 + h Λ c 2 2 , this yields

h Λ 2 2 = h 2 2 - h Λ c 2 2 h 2 2 - 1 C 2 h 2 2 = 1 - 1 C 2 h 2 2 .

This must hold for any vector h N ( Φ ) and for any set of indices Λ such that | Λ | K . In particular, let { v i } i = 1 N - M be an orthonormal basis for N ( Φ ) , and define the vectors { h i } i = 1 N as follows:

h j = i = 1 N - M v i ( j ) v i .

We note that h j = i = 1 N - M e j , v i v i where e j denotes the vector of all zeros except for a 1 in the j -th entry. Thus we see that h j = P N e j where P N denotes an orthogonal projection onto N ( Φ ) . Since P N e j 2 2 + P N e j 2 2 = e j 2 2 = 1 , we have that h j 2 1 . Thus, by setting Λ = { j } for h j we observe that

i = 1 N - M | v i ( j ) | 2 2 = | h j ( j ) | 2 1 - 1 C 2 h j 2 2 1 - 1 C 2 .

Summing over j = 1 , 2 , ... , N , we obtain

N 1 - 1 / C 2 j = 1 N i = 1 N - M | v i ( j ) | 2 = i = 1 N - M j = 1 N | v i ( j ) | 2 = i = 1 N - M v i 2 2 = N - M ,

and thus M 1 - 1 - 1 / C 2 N as desired.

Thus, if we want a bound of the form [link] that holds for all signals x with a constant C 1 , then regardless of what recovery algorithm we use we will need to take M N measurements. However, in a sense this result is overly pessimistic, and we will now see that the results we just established for signal recovery in noise can actually allow us to overcome this limitation by essentially treating the approximation error as noise.

Towards this end, notice that all the results concerning 1 minimization stated thus far are deterministic instance-optimal guarantees that apply simultaneously to all x given any matrix that satisfies the restricted isometry property (RIP). This is an important theoretical property, but as noted in "Matrices that satisfy the RIP" , in practice it is very difficult to obtain a deterministic guarantee that the matrix Φ satisfies the RIP. In particular, constructions that rely on randomness are only known to satisfy the RIP with high probability. As an example, recall Theorem 1 from "Matrices that satisfy the RIP" , which opens the door to slightly weaker results that hold only with high probability.

Questions & Answers

find the 15th term of the geometric sequince whose first is 18 and last term of 387
Jerwin Reply
I know this work
The given of f(x=x-2. then what is the value of this f(3) 5f(x+1)
virgelyn Reply
hmm well what is the answer
how do they get the third part x = (32)5/4
kinnecy Reply
can someone help me with some logarithmic and exponential equations.
Jeffrey Reply
sure. what is your question?
okay, so you have 6 raised to the power of 2. what is that part of your answer
I don't understand what the A with approx sign and the boxed x mean
it think it's written 20/(X-6)^2 so it's 20 divided by X-6 squared
I'm not sure why it wrote it the other way
I got X =-6
ok. so take the square root of both sides, now you have plus or minus the square root of 20= x-6
oops. ignore that.
so you not have an equal sign anywhere in the original equation?
is it a question of log
I rally confuse this number And equations too I need exactly help
But this is not salma it's Faiza live in lousvile Ky I garbage this so I am going collage with JCTC that the of the collage thank you my friends
Commplementary angles
Idrissa Reply
im all ears I need to learn
right! what he said ⤴⤴⤴
what is a good calculator for all algebra; would a Casio fx 260 work with all algebra equations? please name the cheapest, thanks.
Kevin Reply
a perfect square v²+2v+_
Dearan Reply
kkk nice
Abdirahman Reply
algebra 2 Inequalities:If equation 2 = 0 it is an open set?
Kim Reply
or infinite solutions?
The answer is neither. The function, 2 = 0 cannot exist. Hence, the function is undefined.
Embra Reply
if |A| not equal to 0 and order of A is n prove that adj (adj A = |A|
Nancy Reply
rolling four fair dice and getting an even number an all four dice
ramon Reply
Kristine 2*2*2=8
Bridget Reply
Differences Between Laspeyres and Paasche Indices
Emedobi Reply
No. 7x -4y is simplified from 4x + (3y + 3x) -7y
Mary Reply
how do you translate this in Algebraic Expressions
linda Reply
Need to simplify the expresin. 3/7 (x+y)-1/7 (x-1)=
Crystal Reply
. After 3 months on a diet, Lisa had lost 12% of her original weight. She lost 21 pounds. What was Lisa's original weight?
Chris Reply
what's the easiest and fastest way to the synthesize AgNP?
Damian Reply
types of nano material
abeetha Reply
I start with an easy one. carbon nanotubes woven into a long filament like a string
many many of nanotubes
what is the k.e before it land
what is the function of carbon nanotubes?
I'm interested in nanotube
what is nanomaterials​ and their applications of sensors.
Ramkumar Reply
what is nano technology
Sravani Reply
what is system testing?
preparation of nanomaterial
Victor Reply
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
Himanshu Reply
good afternoon madam
what is system testing
what is the application of nanotechnology?
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
anybody can imagine what will be happen after 100 years from now in nano tech world
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
silver nanoparticles could handle the job?
not now but maybe in future only AgNP maybe any other nanomaterials
I'm interested in Nanotube
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
can nanotechnology change the direction of the face of the world
Prasenjit Reply
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
Ali Reply
the Beer law works very well for dilute solutions but fails for very high concentrations. why?
bamidele Reply
how did you get the value of 2000N.What calculations are needed to arrive at it
Smarajit Reply
Privacy Information Security Software Version 1.1a
Got questions? Join the online conversation and get instant answers!
QuizOver.com Reply

Get the best Algebra and trigonometry course in your pocket!

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?