{'fraction_non_alphanumeric': 0.013234077750206782, 'fraction_numerical': 0.0, 'mean_word_length': 5.505376344086022, '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}}
Characterizing range progression of SAR point scatterers with recursive RANSAC

GPS-denied navigation is an active area of research due to poor GPS coverage in urban canyons and possible jamming or spoofing from other sources. By utilizing exteroceptive sensors, such as cameras and more recently radar, landmarks within the environment can be identified and tracked to provide velocity and rate estimates to reduce the effects from integrated errors from IMU sensor drift. While techniques exist to identify landmarks in a single sensor scan, tracking these landmarks from frame to frame in the presence of measurement noise and spurious detections results in an NP-hard data association problem. With regards to synthetic aperture radar, previous methods employed to solve this data association are the Hough transform and the nearest neighbor algorithms. Unfortunately, the Hough transform is computationally expensive, and the nearest neighbor algorithm can diverge in high clutter. In this work, we apply the recursive-RANSAC multiple target tracking algorithm and efficiently track multiple unknown point scatterers in high clutter using sequential measurements of both synthetic and real radar returns.