{'fraction_non_alphanumeric': 0.029885057471264367, 'fraction_numerical': 0.0030651340996168583, 'mean_word_length': 5.629441624365482, 'pattern_counts': {'":': 0, '<': 1, '<?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}}
Sparse Learning via Iterative Minimization With Application to MIMO Radar Imaging

Through waveform diversity, multiple-input multiple-output (MIMO) radar can provide higher resolution, improved sensitivity, and increased parameter identifiability compared to more traditional phased-array radar schemes. Existing methods for target estimation, however, often fail to provide accurate MIMO angle-range-Doppler images when there are only a few data snapshots available. Sparse signal recovery algorithms, including many l1-norm based approaches, can offer improved estimation in that case. In this paper, we present a regularized minimization approach to sparse signal recovery. Sparse learning via iterative minimization (SLIM) follows an lq-norm constraint (for 0 <; q ≤ 1), and can thus be used to provide more accurate estimates compared to the l1-norm based approaches. We herein compare SLIM, through imaging examples and examination of computational complexity, to several well-known sparse methods, including the widely used CoSaMP approach. We show that SLIM provides superior performance for sparse MIMO radar imaging applications at a low computational cost. Furthermore, we will show that the user parameter q can be automatically determined by incorporating the Bayesian information criterion.