Search

Polarimetric synthetic aperture radar (PolSAR) images contain useful information, which can lead to extensive land cover interpretation and a variety of output products. In contrast to optical imagery, there are several challenges in extracting beneficial features from PolSAR data. Deep learning (DL) methods can provide solutions to address PolSAR feature extraction challenges. The convolutional neural networks (CNNs) and graph convolutional networks (GCNs) can drive PolSAR image characteristics by deploying kernel abilities in considering neighborhood (local) information and graphs in considering long-range similarities. A novel dual-branch fusion of CNN and mini-GCN is proposed in this study for PolSAR image classification. To fully utilize the PolSAR image capacity, different spatial-based and polarimetric-based features are incorporated into CNN and mini-GCN branches of the proposed model. The performance of the proposed method is verified by comparing the classification results to multiple state-of-the-art approaches on the airborne synthetic aperture radar (AIRSAR) dataset of Flevoland and San Francisco. The proposed approach showed 1.3% and 2.7% improvements in overall accuracy compared to conventional methods with these AIRSAR datasets. Meanwhile, it enhanced its one-branch version by 0.73% and 1.82%. Analyses over Flevoland data further indicated the effectiveness of the dual-branch model using varied training sampling ratios, leading to a promising overall accuracy of 99.9% with a 10% sampling ratio. [ABSTRACT FROM AUTHOR]

We propose a generic scattering power factorization framework (SPFF) for polarimetric synthetic aperture radar (PolSAR) data to directly obtain N scattering power components along with a residue power component for each pixel. Each scattering power component is factorized into similarity (or dissimilarity) using elementary targets and a generalized volume model. The similarity measure is derived using a geodesic distance between pairs of 4 × 4 real Kennaugh matrices. In standard model-based decomposition schemes, the 3 × 3 Hermitian-positive semi-definite covariance (or coherency) matrix is expressed as a weighted linear combination of scattering targets following a fixed hierarchical process. In contrast, under the proposed framework, a convex splitting of unity is performed to obtain the weights while preserving the dominance of the scattering components. The product of the total power (Span) with these weights provides the nonnegative scattering power components. Furthermore, the framework, along with the geodesic distance (GD) is effectively used to obtain specific roll-invariant parameters such as scattering-type parameter (αGD), helicity parameter (τGD), and purity parameter (PGD). A PGD/αGD unsupervised classification scheme is also proposed for PolSAR images. The SPFF, the roll invariant parameters, and the classification results are assessed using C-band RADARSAT-2 and L-band ALOS-2 images of San Francisco. [ABSTRACT FROM AUTHOR]

A new scheme for pixel-based polarimetric synthetic aperture radar (PolSAR) classification of the urban area was proposed. First, the characteristic of urban backscattering was analysed and it was found that the backscattering of buildings is very sensitive to the orientation of buildings. Second, by utilising Euler rotation to the polarimetric coherency matrix, a sequence of data with different rotation angles was simulated. Then a polarimetric statistical feature vector would be extracted from the simulated data. At last, the feature vector together with four components decomposition result would be put into a multiple layer perceptron neural network to get the classification result. The proposed scheme can improve the accuracy of urban area classification in a PolSAR image and be verified by using AIRSAR image data of San Francisco. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new discriminative dictionary learning method based on Riemann geometric perception for polarimetric synthetic aperture radar (PolSAR) image classification. We made an optimization model for geometry-aware discrimination dictionary learning in which the dictionary learning (GADDL) is generalized from Euclidian space to Riemannian manifolds, and dictionary atoms are composed of manifold data. An efficient optimization algorithm based on an alternating direction multiplier method was developed to solve the model. Experiments were implemented on three public datasets: Flevoland-1989, San Francisco and Flevoland-1991. The experimental results show that the proposed method learned a discriminative dictionary with accuracies better those of comparative methods. The convergence of the model and the robustness of the initial dictionary were also verified through experiments. [ABSTRACT FROM AUTHOR]