Clutter Identification Based on Sparse Recovery and L1-Type Probabilistic Distance Measures
Yuansheng Zhu, Yijian Xiang, Satyabrata Sen, Elise Dagois, Arye Nehorai, Murat Akçakaya
Abstract
Cognitive radar framework has recently been proposed in radar signal processing to develope algorithms for target detection, tracking, and waveform design in the presence of nonstationary environmental (clutter) characteristics. In this framework, there are the three main steps: sensing the environmental changes, learning the new environmental statistical characteristics, and adapting the radar algorithms to the new characteristics. Here, we focus on the second step of the framework to identify the new clutter characteristics after a change is detected in the environment. We form a dictionary of various clutter distributions and identify the distribution of the new clutter data through matching pursuit using probabilistic similarity and distance measures under sparsity constraints. Specifically, we use inner-product as a similarity measure, and we apply three different L 1 -norm type probabilistic distance measures. We both numerically and analytically analyze their clutter-distribution identification performances and show that Kulczynski is the best distance measure for distribution identification.
BibTeX
@inproceedings{icassp2020_clutteridentific,
title = {Clutter Identification Based on Sparse Recovery and L1-Type Probabilistic Distance Measures},
author = {Yuansheng Zhu and Yijian Xiang and Satyabrata Sen and Elise Dagois and Arye Nehorai and Murat Akçakaya},
booktitle = {ICASSP 2020},
year = {2020}
}