Anh kev xem hộ em cái Abstract này được chưa


"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))$."

Bác kev ơi, cho PB vào chatbox với, ngoài này chán quá hu hu T_ T