Noiselet Measurement Matrix Usage in CS Framework

الموضوعات :

Haybert Markarian ¹ , Alireza Mohammad Zaki ² , Sedigheh Ghofrani ³

1 - Electrical Engineering Department South Tehran Branch, Islamic Azad University Tehran, Iran
2 - Electrical Engineering Department South Tehran Branch, Islamic Azad University Tehran, Iran
3 - Electrical Engineering Department South Tehran Branch, Islamic Azad University Tehran, Iran

تاريخ الإرسال : 07 الجمعة , صفر, 1439 تاريخ التأكيد : 23 الأحد , صفر, 1439 تاريخ الإصدار : 02 الأربعاء , جمادى الثانية, 1438

الکلمات المفتاحية: Compressive sensing (CS), Noiselets, Gaussian measurement, Bernoulli measurement, randomness,

ملخص المقالة :

Theory of compressive sensing (CS) is an alternative to Shannon/Nyquist sampling theorem which explained the number of samples requirement in order to have the perfect reconstruction. Perfect reconstruction of undersampled data in CS framework is highly dependent to incoherence of measurement and sparsifying basis matrices which the posterior is usually fulfilled by selecting a random matrix. While Noiselets, as a measurement matrix, have very low coherence with wavelets which are the interest of CS, they have never been studied well and compared with other well known Gaussian and Bernoulli measurement matrices, which have been widely used in CS framework, from randomness view point. Therefore, the main contribution of this paper is introducing Noiselets and comparing them with other measurement matrices in two point of view; randomness and quality of recovered images. In case of randomness, the entropy is used as a criterion for computing the randomness. In case of recovered images, the OMP and PDIP algorithms are applied under sampling rates 30, 40, 60%.