Name
Abstract | ||
|---|---|---|
This paper develops a geometric detection approach based upon the total Bregman divergence on the Riemannian manifold of Hermitian Positive-Definite (HPD) matrices to realize target detection in a clutter. First of all, the radar received clutter data in each range cell in one coherent processing interval is modeled and mapped into an HPD matrix space, which can be described as a complex Riemannian manifold. Each point of this manifold is an HPD matrix. Then, a class of total Bregman divergences are presented to measure the closeness between HPD matrices. Based on these divergences, the medians for a finite collection of HPD matrices are derived. Furthermore, the three divergences, namely the total square loss, the total log-determinant divergence, and the total von Neumann divergence are deduced, and their corresponding geometric detection methods are designed. The principle of detection is that if a location has enough dissimilarity from the median estimated by its neighboring locations, targets are supposed to appear at this location. Numerical experiments and real clutter data are given to demonstrate the effectiveness of the proposed geometric detection methods. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.dsp.2018.01.008 | Digital Signal Processing |
Keywords | Field | DocType |
Riemannian manifold,Target detection,Total Bregman divergence,Geometric detection | Coherent processing interval,Divergence,Pattern recognition,Riemannian manifold,Matrix (mathematics),Clutter,Algorithm,Artificial intelligence,Bregman divergence,Hermitian matrix,Mathematics,Manifold | Journal |
Volume | ISSN | Citations |
75 | 1051-2004 | 5 |
PageRank | References | Authors |
0.43 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoqiang Hua | 1 | 12 | 0.94 |
| Yongqiang Cheng | 2 | 133 | 29.99 |
| Hongqiang Wang | 3 | 69 | 9.96 |
| Yuliang Qin | 4 | 142 | 27.06 |
| Dingchang Chen | 5 | 5 | 0.43 |