首页|Multiple Targets Localization Algorithm Based on Covariance Matrix Sparse Representation and Bayesian Learning
Multiple Targets Localization Algorithm Based on Covariance Matrix Sparse Representation and Bayesian Learning
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
万方数据
维普
The multi-source passive localization problem is a problem of great interest in signal pro-cessing with many applications. In this paper, a sparse representation model based on covariance matrix is constructed for the long-range localization scenario, and a sparse Bayesian learning algo-rithm based on Laplace prior of signal covariance is developed for the base mismatch problem caused by target deviation from the initial point grid. An adaptive grid sparse Bayesian learning targets localization (AGSBL) algorithm is proposed. The AGSBL algorithm implements a covari-ance-based sparse signal reconstruction and grid adaptive localization dictionary learning. Simula-tion results show that the AGSBL algorithm outperforms the traditional compressed-aware localiza-tion algorithm for different signal-to-noise ratios and different number of targets in long-range scenes.
万方数据
维普
