Multiple Targets Localization Algorithm Based on Covariance Matrix Sparse Representation and Bayesian Learning

Journal of Beijing Institute of Technology ›› 2024, Vol. 33 ›› Issue (2) : 119 -129.

PDF (4624KB)
Journal of Beijing Institute of Technology ›› 2024, Vol. 33 ›› Issue (2) : 119 -129. DOI: 10.15918/j.jbit1004-0579.2023.098
 
research-article

Multiple Targets Localization Algorithm Based on Covariance Matrix Sparse Representation and Bayesian Learning

Author information +
History +
PDF (4624KB)

Abstract

The multi-source passive localization problem is a problem of great interest in signal processing 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 algorithm 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 covariance-based sparse signal reconstruction and grid adaptive localization dictionary learning. Simulation results show that the AGSBL algorithm outperforms the traditional compressed-aware localization algorithm for different signal-to-noise ratios and different number of targets in long-range scenes.

Graphical abstract

Keywords

grid adaptive model / Bayesian learning / multi-source localization

Cite this article

Download citation ▾
null. Multiple Targets Localization Algorithm Based on Covariance Matrix Sparse Representation and Bayesian Learning. Journal of Beijing Institute of Technology, 2024, 33(2): 119-129 DOI:10.15918/j.jbit1004-0579.2023.098

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (4624KB)

416

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/