{'fraction_non_alphanumeric': 0.02127659574468085, 'fraction_numerical': 0.0064754856614246065, 'mean_word_length': 4.945054945054945, '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}}
Kernel Bandwidth Adaptive Target Tracking Algorithm Based on Mean-Shift

The kernel bandwidth of the classical Mean-Shift tracking algorithm is fixed, and it usually results in tracking failure when the target’s size changes. A kernel bandwidth adaptive Mean-Shift tracking algorithm is presented with frame difference method to solve the question in this paper. According to the targets’ size obtained from the inter-frame difference method, the bandwidth matrix of kernel function can be updated. Because the improved Mean-Shift algorithm is difficult to position target while it moves fast, so a Kalman filter is put forward as auxiliary tracker further in the paper. The results of experiment show that the target’s tracking accuracy of the non-rigid motion based this algorithm is improved by 3.28 % and the fast motion can be adapted to the target via the introduction of the prediction mechanism. This algorithm improved the defects on the target tracking which uses single color feature or motion information, so it is a practical tracking algorithm. Copyright © 2013 IFSA.