http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Matching Reconstruction Algorithms Performance Comparison based on Compressed Sensing in GPR Imaging
Duan Rong-xing,Zhou Hui-lin,Zhu Gan-chun 보안공학연구지원센터 2015 International Journal of Signal Processing, Image Vol.8 No.8
Compressed sensing (CS) provides a new solution for the problems of requiring large amount of measurements data and long data acquisition time in radar application, and both issues also exist in ground penetrating radar (GPR). Aiming at this problem, we adopt impulse radar with CS framework, and transform the GPR imaging into sparse constraint optimization problem performed on time-domain sub-sampling in this paper. Specifically, it focuses on the impulse GPR imaging method based on CS under double underground targets condition containing noise and abundant clutter. Furthermore, the performance of matching reconstruction algorithms under the different signal to noise ratios (SNR), measurement dimensions and sparseness values is also presented. The experimental results show that CS algorithms based on matching reconstruction can obviously reduce measurement data, improve the image quality and make a better anti-noise performance. When SNR of measurement data is 1dB, the probability of accurate imaging can still reach 95%. So we may reasonably conclude that the regularized orthogonal matching pursuit algorithm has a better performance than the other matching algorithms.