{'fraction_non_alphanumeric': 0.019455252918287938, 'fraction_numerical': 0.0, 'mean_word_length': 5.125, '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}}
Uniform smooth filtering approach for fast template matching

Sum of square difference (SSD) and normalized cross correlation (NCC) are two different template matching techniques and their fast implementations have been investigated independently. The SSD approach is known to be simple and fast, however it is variant to image intensity change that lead to low performance. On the other hand, the NCC method is invariant to intensity change and has high performance, but its computational cost is high. In this paper, we derive an equation that connects NCC and SSD. From this equation, we propose SSD based partial elimination for the fast implementation of NCC template matching. This new technique takes the advantages of both NCC’s high performance and SSD’s low computational cost. It is fast and has high performance. Then we propose a uniform smoothing approach that further reduces computational cost for NCC. Experiments show that the proposed method is significantly faster than the techniques reported in literature.