The answers for sparse random matrix question are represented !

Posted: December 25, 2009 in Uncategorized

PB feel enthusiatic for this event, because W.Wang has published his Ph.D theis, namely Sparse Recovery Using Sparse Random Projection.

In this thesis, you can find the answer for one prominent Random Matrix question that is:

in this context,two key questions arise about the relationship between
the sparsity of the measurement matrix and the number of measurements needed to recover the
signal. First, how sparse can we make the measurement matrix without affecting the
sampling efficiency? And second, when we increase the sparsity beyond this limit,
what is the trade off between measurement sparsity and sampling efficiency?

I will soon give a resume on there answers !

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s