Throughout the paper the following mathematical notations are used: lowercase letters for scalars-a, lowercase boldface for vectors- (with accent for unitary vectors, ) and uppercase boldface letters for matrices-. Letter is reserved for the identity matrix (indices directly expressing its dimension may be used or omitted, depending on the context).
2.2. Mapping Conjugate Similarity to Real Ordinary Similarity
When solving the consimilarity transformation of a complex, square matrix, Ling [
15] and Jiang [
16] have proposed to use a similarity transformation of an equivalent algebraic real representation (RR) form. Here, we go beyond the case study of Ling and address the new information that can be extracted using the Real representation scattering matrix.
The algebraic RR of a square, complex matrix is a real, block matrix of dimensions with constituent blocks, the real and imaginary parts of matrix .
Block composite real forms have been employed in applications using complex or quaternion matrices, to solve or achieve more convenient computations, in sectors ranging from complex signal processing to quantum computing [
17,
18,
19,
20]. Such real representations (RRs) are formed using real and imaginary block elements from the original complex matrices. Two general RRs forms are present in the literature: a real-valued block-skew symmetric (or, block skew-circulant) and a real-valued block-symmetric (or, block-Hankel-skew-circulant) [
21]. The former will be the block form of the algebraic real representation used in the current paper, as in (
4) [
22]:
To the best of our knowledge, there is no direct method in the complex domain for solving a consimilarity transformation between two complex matrices. With the models found in the literature, solving the consimilarity equation is primary based on using a mapping to an equivalent space where the conjugate similarity equation can be evaluated as a similarity one. The earlier methods have proposed to map a complex, symmetric matrix
to a power form (
) and then perform an eigen decomposition (the similarity transformation) of the power representation. A mathematical connection existing between the results from the power domain and the results from the original domain was then exploited. In radar polarimetry, the method is known as the Graves method (and the Hermitian power matrix is addressed as the Graves matrix) [
23]. It has remained the unique algorithm for solving the monostatic congruence equivalence in BSA and determining the coneigenvalues and coneigenvectors of the scattering matrix. A coneigenvalue/coneigenvector pair (
) of matrix
will verify the relation:
Under the necessary condition that the eigenvalues of matrix
are non-negative, the Graves method exploits the property that the two coneigenvalues of
,
and
, are the square roots of the eigenvalues of
. From the same method, the coneigenvectors are equal to the eigenvectors of the power matrix. However, one must emphasize that a necessary requirement in assuring non-negative eigenvalues of
is that
is reciprocal. In the current study, we represent the scattering matrix in the block-symmetric algebraic RR form (
4) and from there determine the products of the consimilarity transformation. For two matrices in the complex domain, the general consimilarity theorem states that: if
is consimilar to
, then
is similar to
[
16];
and
.
2.3. On (Con)-Eigenvalues/Eigenvectors
With the current RR approach, the eigen decomposition of the equivalent form is characterized by some symmetrical particularities, inherent to the mathematical model because of the dimensions of the scattering matrix.
2.3.1. Eigenvalues of the RRSM
For a real block matrix , the eigenvalues will appear either in the form of two positive–negative (±) real pairs: , or as a complex quad: , , , . In our notation, a complex quad is a set of two ± complex–conjugate pairs. While the Graves theory rejects from analysis anything outside the real non-negative eigenvalues case, negative and complex eigenvalues are directly embedded in the theory of the RR transformation. Moreover, because the values appear grouped in pairs, for a given 4 × 4 RRSM, all eigenvalues are numerically of the same type and, as a result may fall into one of two possibilities:
Case 1: Only real eigenvalues with:
two distinct ± real pairs, Case 1a: ; or
one double ± real pair, Case 1b: ).
Case 2: Only complex eigenvalues in the form of a quad: .
2.3.2. Coneigenvalues of the SM
Horn has shown that mathematically, a certain pair of (coneigenvalue, associated coneigenvector) is characterized by a phase uncertainty (
6) and as a result, a matrix may have an infinite number of such pairs [
24]. It can be verified that (
5) holds for any (
), ∀
:
However, from a practical point of view, we are interested only in identifying one unique pair from any such ambiguous set and for this, the coneigenvalues have been previously restricted to the unique modulus for any ambiguous coneigenvalue .
For the current investigation, any real pair of eigenvalues of will have associated one positive, real coneigenvalue, . Eigenvectors corresponding to a pair are used in calculating the coneigenvector associated to .
For any complex quad
, we shall associate a complex conjugate coneigenvalues pair [
25]. For this reasons, the coneigenvalues of a general scattering matrix can be all either real positive or complex under the current definition.
Two particular scattering matrix cases are those of (mathematically) complex symmetric and complex skew-symmetric. One can verify rapidly that the two have RR forms which also verify the symmetry and skew-symmetry property, respectively. It is generally known that a real symmetric matrix will have only real eigenvalues, while a real skew-symmetric matrix will have purely imaginary eigenvalues. Hence, we consider these two specific examples as the extreme cases for the eigenvalues classification scale.
2.3.3. Similarity Transformation Vectors
As a general statement from linear algebra, any square matrix with real elements is similar to a matrix (sometimes in block form) known as the Jordan canonical form [
24]. In our case, for the similarity operation to hold in the real representation space, irrespective of the RRSM that is used,
will be written in the Jordan form. For a
matrix returning real, distinct pairs of ± eigenvalues, this is identical to the diagonal form with proper values as diagonal elements. For a
matrix with eigenvalues in a complex quad,
is written in real Jordan form [
16].
In the real space, any eigenvalue has associated an eigenvector (or generalized eigenvectors), . The similarity transformation matrix, is written using the eigenvectors (or generalized eigenvectors) when is in the block canonical or the real Jordan form, as follows:
Case 1 (real ± eigenvalues pairs):
.
Case 2 (complex quad ± eigenvalues pairs):
In this case, because
is written in the real Jordan form, a real transformation matrix is created by column-wise operations with the real and imaginary parts of the initial complex eigenvectors,
:
2.3.4. Consimilarity Transformation Vectors
Then, one can solve for the consimilarity transformation matrix,
, using [
15]:
where
represents the
identity matrix and
.
The compliance of the result from (
7) can be verified by the consimilarity definition (
2). Each column of matrix
serves as coneigenvector. We expect the coneigenvectors having associated real, distinct coneigenvalues to be linear independent and orthogonal, while for real and equal coneigenvalues, the coneigenvectors may loose the orthogonality property. In the case of conjugate coneigenvalue, one of the coneigenvectors is null.
For some of the general monostatic scattering matrices included in
Table 1 [
9,
26], we present in
Table 2, the coneigenvalues and coneigenvectors derived by using the RR transformation. The results verify the consimilarity equation in (
2).
For clarity of notation, in PolSAR there is not a mere equivalence between a “symmetric scatterer” and a (mathematically) symmetric scattering matrix. While the latter describes the relation between the response’s measured cross and co-pol channel components, the former describes attributes of the physical scatterer generating the response. A “symmetric scatterer” usually describes the targets presenting an axis of symmetry in the plane orthogonal to the LOS. For monostatic acquisitions the response of such targets will always be symmetric, but they represent only a subgroup in the domain of scatterers having (mathematically) symmetric scattering matrices (which in the text are referred as reciprocal). All the elementary scatterers from
Table 1 have reciprocal scattering matrices. These are matrices for which the RR eigen decomposition returns only real, positive coneigenvalues.
2.4. Tolerance Parameters for RRSM Eigenvalues
The previous subsection has introduced some expected outcomes, in terms of the RRSM eigenvalue classification. In computing the final results, it is important to offer correct evaluation criteria also from a numerical point of view. Evaluation criteria are necessary when dealing with:
- 1.
RR complex eigenvalues with small imaginary part (orders of magnitude lower than the real part);
- 2.
RR real eigenvalues of near value (which can be considered equal under a given tolerance).
For this, two parameters are defined in order to evaluate and isolate eigenvalues which do not fall under some desired tolerances:
- 1.
: used to describe the ratio of the imaginary part of one complex eigenvalue (), with respect to its real part. We evaluate the threshold value determined by the product against the actual value of . If the imaginary part is lower than the threshold, then it is considered negligibly small compared to the real part and can be ignored. Because in the case of complex eigenvalues, the complex pairs have the same magnitude, when dropping the imaginary part, we remain with two real, equal pairs of eigenvalues.
- 2.
: used only in testing the case of ± real pairs, the parameter is useful for numerically evaluating if two values are equal (under a given tolerance). With the present implementation, two eigenvalues and , are within tolerance if they verify the relation: . Under practical tests, the parameter does not seem to modify the numerical implicit RRSM eigenvalues classification (i.e., without definition) for differences up to , which is, however, not an acceptable comparison precision. The threshold is fixed to a standard value, .
Figure 1 integrates the main steps for evaluating the RR eigenvalues considering both
and
parameters.
In the remainder of this section, we perform a practical evaluation on real monostatic data, for choosing the tolerance parameter (between significance values of 1% or 5%).
Karnychev et al. [
27,
28] have introduced an invariant parameter for characterizing asymmetric scattering matrices, the polarization nonreciprocity factor (NRF). With the scattering matrix written in the HV basis:
, the nonreciprocity factor will be:
where
is the Euclidean norm.
The parameter is a complex number , with . The value is zero when the two cross-polar components are equal (i.e., reciprocal scattering matrices). As discussed, this is a case for which the RRSM eigen classification should return only real eigenvalues. For partially nonreciprocal objects, any values in the open interval can be expected.
Apart from the NRF value or the simple comparison of the difference/radio between HV and VH channels, statistical tests on the coherency matrix have also been proposed for assessing the reciprocity of general scattering matrices [
29,
30]. As discussed in the previous subsection, the types of eigenvalues obtained from decomposing the RR of a complex matrix may vary from real to purely imaginary if the matrix changes from symmetric to skew-symmetric. That is why we argue that, by investigating the RR eigenvalues, a new criterion for assessing the reciprocity of coherent scattering matrices can be obtained.
Table 3 and
Figure 2 evaluate the differences in the distribution of RR eigenvalues classification of two Convair full-polarimetric monostatic scenes (details in
Table 4) directly or by NRF investigation, respectively, when
takes the values of
. Speckle filtering or reciprocity equalization
have not been applied to the two scenes; the investigation is performed directly on the original scattering matrices.
From
Table 3, we observe that with both polarimetric datasets, by setting the value of
to 1% the repartition of eigenvalues from complex to real, equal pairs changes with at most 0.1%. A more significant change, of ≈1% (migration from complex to real pairs) appears when increasing the
threshold value to 5%. The percentages characterizing real, distinct eigenvalues pairs do not change in the table. This is because the variation of
can influence only the distribution within the other two classes; e.g., complex eigenvalues pairs with a very small imaginary component may no longer pass the
evaluation threshold, case in which we set to zero the imaginary part and the eigenvalues are evaluated now as real, equal pairs.
We evaluate now, with the help of results in
Figure 2, the changes introduced by
values modification, considering the nonreciprocity parameter. The histograms in yellow/blue display the distribution of scattering matrices, with respect to the absolute NRF parameter values, when their RRSM eigenvalues pairs are only of complex/real type. Changes are recorded for
on first, second and third rows of
Figure 2, respectively. On the graphs, the red and magenta dotted lines mark values of
.
Figure 3b,d display the absolute value of the NRF parameter for the monostatic Convair Ottawa and Convair Ice scenes. The Pauli color composite for the two images are shown in
Figure 3a,c. The color coded images for the NRF parameters are rich in blue color which, as expected, corresponds to very low values for
.
For the blue histograms in
Figure 2g,h, we observe that the majority of monostatic scattering matrices having RR real eigenvalues are characterized by a NRF below 0.1 (red line mark) if
. For
and
, the yellow distributions reveal that a large number of scattering matrices (however, comparably lower than the peaks of the blue histogram) returning RR complex eigenvalues (but, of low values for the imaginary part) appear also for
values below
(i.e., nearly reciprocal matrices). On the third line of the yellow histograms (
Figure 2e,f), the distributions change significant, with the decrease in the total number of eigenvalues classified as complex. The remaining RRSM not only present complex eigenvalues with an imaginary part of at least 5% (of its real part), but they also have a NRF factor of at least 0.05.
As the analyzed datasets are both monostatic, we see that the threshold value of can play a role in removing scattering points affected by noise (or other errors), points which may not be representative in the initial classification returned by the numerical analysis. That is why, hereafter we choose a level of significance .