{'fraction_non_alphanumeric': 0.017743979721166033, 'fraction_numerical': 0.0, 'mean_word_length': 4.766423357664234, '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}}
Speeding up SSD planar tracking by pixel selection

Tracking planar patches is a subject of interest in computer vision. We present a method to estimate, in real-time, the position and orientation of a previously viewed planar patch. The algorithm is based on minimising the sum of squared differences (SSD) between a selected set of pixels obtained from a previously stored image of the patch and the current image of it. First a linear model for projectively tracking a planar patch is introduced; then, a procedure to accelerate the tracking process is presented. This procedure is based on using a small set of informative points in the tracking process. In experiments, we show the gain in performance and compare different procedures for selecting the set of points used in tracking.