A super-resolution reconstruction approach of （SVD） technique was presented, and its performance was radar image using an adaptive-threshold singular value decomposition analyzed, compared and assessed detailedly. F...A super-resolution reconstruction approach of （SVD） technique was presented, and its performance was radar image using an adaptive-threshold singular value decomposition analyzed, compared and assessed detailedly. First, radar imaging model and super-resolution reconstruction mechanism were outlined. Then, the adaptive-threshold SVD super-resolution algorithm, and its two key aspects, namely the determination method of point spread function （PSF） matrix T and the selection scheme of singular value threshold, were presented. Finally, the super-resolution algorithm was demonstrated successfully using the measured synthetic-aperture radar （SAR） images, and a Monte Carlo assessment was carried out to evaluate the performance of the algorithm by using the input/output signal-to-noise ratio （SNR）. Five versions of SVD algorithms, namely 1 ） using all singular values, 2） using the top 80% singular values, 3） using the top 50% singular values, 4） using the top 20% singular values and 5） using singular values s such that S2≥/max（s2）/rinsNR were tested. The experimental results indicate that when the singular value threshold is set as Smax/（rinSNR）1/2, the super-resolution algorithm provides a good compromise between too much noise and too much bias and has good reconstruction results.展开更多
Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to sa...Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to save disk I/Os. However, two different decomposition algorithms are compared, such as inner vs. outer decomposition first algorithms for tuple-based and block-based nested loop joins, showing that the proposed approach is 20% better than general approach. Also lemmas are proved, when we have to use the outer decomposition first parallel join algorithms.展开更多
基金Project(2008041001) supported by the Academician Foundation of China Project(N0601-041) supported by the General Armament Department Science Foundation of China
文摘A super-resolution reconstruction approach of （SVD） technique was presented, and its performance was radar image using an adaptive-threshold singular value decomposition analyzed, compared and assessed detailedly. First, radar imaging model and super-resolution reconstruction mechanism were outlined. Then, the adaptive-threshold SVD super-resolution algorithm, and its two key aspects, namely the determination method of point spread function （PSF） matrix T and the selection scheme of singular value threshold, were presented. Finally, the super-resolution algorithm was demonstrated successfully using the measured synthetic-aperture radar （SAR） images, and a Monte Carlo assessment was carried out to evaluate the performance of the algorithm by using the input/output signal-to-noise ratio （SNR）. Five versions of SVD algorithms, namely 1 ） using all singular values, 2） using the top 80% singular values, 3） using the top 50% singular values, 4） using the top 20% singular values and 5） using singular values s such that S2≥/max（s2）/rinsNR were tested. The experimental results indicate that when the singular value threshold is set as Smax/（rinSNR）1/2, the super-resolution algorithm provides a good compromise between too much noise and too much bias and has good reconstruction results.
基金supported by the National Research Foundation (NRF) of Korea through contract N-14-NMIR06
文摘Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to save disk I/Os. However, two different decomposition algorithms are compared, such as inner vs. outer decomposition first algorithms for tuple-based and block-based nested loop joins, showing that the proposed approach is 20% better than general approach. Also lemmas are proved, when we have to use the outer decomposition first parallel join algorithms.
