{'fraction_non_alphanumeric': 0.0210896309314587, 'fraction_numerical': 0.0, 'mean_word_length': 5.404494382022472, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Quick determination of refraction points for GPR SAR imaging

Synthetic aperture radar (SAR) imaging with ground penetrating radar (GPR) has proven to be an effective nondestructive testing tool. Most GPR SAR imaging algorithms are based on delay-and-sum beamforming, which relies heavily on the travel path calculation in the media where targets are buried. In this paper, a computationally very efficient and convergence guaranteed algorithm is proposed for determining refraction points between boundaries of multiple planar media, which is vital to GPR SAR imaging.