{'fraction_non_alphanumeric': 0.011627906976744186, 'fraction_numerical': 0.006342494714587738, 'mean_word_length': 4.91875, '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}}
Point Target Location Using Hexagonal Detector Arrays

For staring sensors, improved performance in the location of point targets can be achieved by using an array of hexagonal detectors instead of the usual array of square or rectangular detectors. This fact is demonstrated by calculating the accuracy of the centroid algorithm as a function of signal to noise ratio and blur spot size for both types of detector arrays. The probability density function for the centroid random variable is derived and is used to perform all noise analysis. The analysis indicates that the algorithm error is reduced by as much as a factor of three, the sensitivity to noise is reduced by 17 percent, the computational load is decreased by 23 percent, and the data storage requirement is reduced by 22 percent. The clutter induced noise, as measured by the clutter equivalent target, is essentially identical for square and hexagonal detectors of the same area.