{'fraction_non_alphanumeric': 0.023026315789473683, 'fraction_numerical': 0.0, 'mean_word_length': 5.543010752688172, '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}}
PGMP: A Device-Free Moving Object Counting and Localization Approach in the Varying Environment

Targets to be localized in the Device-Free Localization (DFL) scheme are generally moving, making the location vectors hold different supports. However, the existing Multiple Measurement Vectors (MMV) algorithms need the estimated vectors to own the same support, which is invalid for the moving objects. In this letter, we propose a novel algorithm called Potential Greedy Matching Pursuit (PGMP), in which the moving object counting and localization issue is investigated under the Compressive Sensing (CS) framework for the first time. Firstly, we exploit the mobility characteristics and design the potential dictionary to store the relationship between the target positions, which can significantly reduce the domain of the possible target positions. Then we build the index dictionary to collect all the possible target traces, among which the real target positions can be selected through the iteration. Finally, we create a novel criterion to recover the real target traces, which has low computation complexity. Simulations show that PGMP can significantly improve target counting and localization performance.