{'fraction_non_alphanumeric': 0.01780693533270853, 'fraction_numerical': 0.0, 'mean_word_length': 5.472727272727273, '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}}
SPARSITY-BASED MULTI-TARGET DIRECT POSITION- ING ALGORITHM BASED ON JOINT-SPARSE RECOV- ERY

The direct position determination (DPD) method can improve the location accuracy compared with the traditional twostep location methods due to omitting the intermediate procedure of estimating the measurement parameters. However, the DPD methods presented so far are significantly more complex than the two-step approach. To overcome the shortcomings of the published DPD algorithms, a novel multi-target direct localization approach is firstly proposed by exploiting the jointly sparse property in the discrete spatial domain. The main idea of this paper is that the location estimation can be obtained by finding the sparsest solution according to the predefined overcomplete basis. Furthermore, the locations of targets can be obtained from noisy signals, even if the number of targets is not known a priori. Experimental results demonstrate that the proposed algorithm has superior positioning accuracy to other DPD methods and improves computational efficiency greatly.