{'fraction_non_alphanumeric': 0.014524328249818447, 'fraction_numerical': 0.002178649237472767, 'mean_word_length': 4.888888888888889, '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}}
An efficient algorithm for peak detection on B-Scan data generated using GPR

B-Scan data generated using the Ground Penetrating Radar contains information about the apparent location of the landmines and other similar objects buried underground. The peak of the hyperbola so generated in the B-Scan represents the apparent depth and lateral distance of the landmines from the point of operation and these apparent peaks need to be migrated to their true positions using migration technique. Peak-detection is the pre-requisite to determine the apparent location of landmines or any other object buried underground and in this paper we propose an effective and efficient algorithm for the same. The proposed algorithm works for all possible conditions in a specified range given that the landmines are separated by a lateral distance of 21cm which corresponds to a gap of 9-pixels in the B-scan data. Many problems faced by the previously proposed algorithms have been overcome significantly. The point at which the landmine is present is the apex/peak of the hyperbola in the B-scan. In order to eliminate the points of non-interest, the algorithm employs filters and morphological transforms and the nearest neighbor method. Segmentation process is applied to obtain the exact apparent peaks from the transformed image of the B-scan which makes it more capable and efficient.