"In this paper, we propose an improvement of SSMP algorithm in two perspectives. Firstly, the number of measurement is reduced and secondly, $K-sparse$ coefficient of signal is not required. This is important to process various images which are different in number of sparse components so it plays an essential role when the algorithm maps to hardware. Although the complexity of algorithm is just $O(MN)$ and slower compare to SSMP is $O(N\log(N/K)\log(R)$,(where M, N and R respectively is a number of measurement, a length of signal vector and a constant depends on noise), but it remains comparable to CoSaMP or SubSpace Pursuit Algorithms which has complexity $O(NK\log(N/K)\log(R))$."
Anh kev ơi,
Anh khi nào rảnh anh có thể gửi cho em mấy cái thư LOR lobby của mấy trường lớn của TQ gửi cho Caltech được không? Em rất muốn bik về vụ này. mail của em là khonghiep2000@yahoo.com
I have posted my application for advanced member. Would you please checked my application and delete the thread after making accepted/rejected decision since it contains some personal information. Many thanks
