Open Access2D OMP algorithm for space–time parameters estimation of moving targets
Author(s) -
Feng Weike,
Zhang YongShun,
Guo YiDuo,
He XingYu
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2015.1039
Subject(s) - matching pursuit , clutter , algorithm , dimension (graph theory) , sparse approximation , radar , computer science , representation (politics) , signal (programming language) , matching (statistics) , pattern recognition (psychology) , mathematics , artificial intelligence , compressed sensing , statistics , telecommunications , politics , political science , pure mathematics , law , programming language
By exploiting the sparsity and data structure of the received signals of airborne radar, the two‐dimensional (2D) signal sparse representation (SR) model that is suitable for moving targets parameters estimation after clutter suppression is built. A novel 2D orthogonal matching pursuit (OMP) algorithm is also proposed to solve the 2D SR problem directly. The spatial parameters and temporal parameters of targets are first estimated separately based on two subdictionaries, i.e. space dictionary and time dictionary. The joint space–time parameter of each target is then obtained based on a very small space–time dictionary. The numerical results indicate that the proposed algorithm can achieve closely approximate parameters estimation performance with significant computational saving compared with the one‐dimension (1D) method using traditional 1D OMP algorithm.