2019
DOI: 10.1109/access.2019.2942425
|View full text |Cite
|
Sign up to set email alerts
|

Geometrical Structure Classification of Target HRRP Scattering Centers Based on Dual Polarimetric $H/\alpha$ Features

Abstract: Polarimetric high resolution range profile (HRRP) contains the geometrical structural information along radar line-of-sight and has shown great potentials in target recognition. In existing researches, H /α decomposition has been applied to exploit global polarimetric features of a single HRRP from its spatially averaged coherent matrix, which loses target local scattering information. In this paper, we propose to apply the H /α decomposition along the slow time dimension in a dual polarimetric HRRP sequence. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 36 publications
0
6
0
Order By: Relevance
“…First, the polarized scattering components can be represented as a linear combination of eigenvalues and eigenvectors [ 1 , 5 , 11 ]. The decomposition into eigenvectors and eigenvalues for the Mueller matrix can be an efficient approach to polarimetric recognition [ 34 , 35 ]. The recognition approach is to use the coherence matrix (Equation (2)) as the polarimetric decomposition [ 11 , 14 ].…”
Section: Polarimetric Decomposition Of Feature Spacementioning
confidence: 99%
“…First, the polarized scattering components can be represented as a linear combination of eigenvalues and eigenvectors [ 1 , 5 , 11 ]. The decomposition into eigenvectors and eigenvalues for the Mueller matrix can be an efficient approach to polarimetric recognition [ 34 , 35 ]. The recognition approach is to use the coherence matrix (Equation (2)) as the polarimetric decomposition [ 11 , 14 ].…”
Section: Polarimetric Decomposition Of Feature Spacementioning
confidence: 99%
“…For a data-driven radar HRRP target recognition task, which is also regarded as a cooperative target recognition, 1,5,6,10,11,15,17,[20][21][22][31][32][33][34][35][36][37][38] we are provided with an independently and identically distributed set of HRRP samples X…”
Section: Hrrp-based Target Recognitionmentioning
confidence: 99%
“…For a data‐driven radar HRRP target recognition task, which is also regarded as a cooperative target recognition, 1,5,6,10,11,15,17,20‐22,31‐38 we are provided with an independently and identically distributed set of HRRP samples X={x1,x2,,xN}, xiRD with corresponding true labels Y={y1,y2,,yN}, yi{1,2,,S} from different azimuths, N and S refers to the number of samples and classes, respectively. The deep learning method we used, a.k.a., CNN, is a kind of supervised learning and consists of two main stages, namely, the training stage and the evaluating stage.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Transforming features describe the property of HRRP in a transformation domain, such as the spectra and the micro-Doppler [37,38]. Various classifiers can be used for target classification, such as decision tree, support vector machine (SVM) [39], Bayes classifier [40][41][42] and ensemble learning. A decision tree [43] is a flowchart-like predictive model whose internal nodes represent individual decision rules.…”
Section: A Radar Target Hrrp Recognitionmentioning
confidence: 99%