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 !

I try to compare recovery algorithm using sparse matching pursuit (SMP) and Orthogonal Matching pursuit (OMP) and got below results:

I have search some sources on the internet and discovery a
good tutorials for this topic !

enjoy it !

http://www.ima.umn.edu/2006-2007/ND6.4-15.07/abstracts.html#Candès-Emmanuel

Link to Gmail from my WP

Posted: July 23, 2009 in Uncategorized

Alright, it’s convinient to use WP to share my ideals combine with Google Services, particularly “Gu” Docs and Readers.

Hello world!

Posted: April 27, 2009 in Uncategorized

Welcome to WordPress.com. This is your first post. Edit or delete it and start blogging!