{'fraction_non_alphanumeric': 0.026041666666666668, 'fraction_numerical': 0.0026041666666666665, 'mean_word_length': 5.681159420289855, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Nearest-Regularized Subspace Classification for PolSAR Imagery Using Polarimetric Feature Vector and Spatial Information

Feature extraction using polarimetric synthetic aperture radar (PolSAR) images is of great interest in SAR classification, no matter if it is applied in an unsupervised approach or a supervised approach. In the supervised classification framework, a major group of methods is based on machine learning. Various machine learning methods have been investigated for PolSAR image classification, including neural network (NN), support vector machine (SVM), and so on. Recently, representation-based classifications have gained increasing attention in hyperspectral imagery, such as the newly-proposed sparse-representation classification (SRC) and nearest-regularized subspace (NRS). These classifiers provide excellent performance that is comparable to or even better than the classic SVM for remotely-sensed image processing. However, rare studies have been found to extend this representation-based NRS classification into PolSAR images. By the use of the NRS approach, a polarimetric feature vector-based PolSAR image classification method is proposed in this paper. The polarimetric SAR feature vector is constructed by the components of different target decomposition algorithms for each pixel, including those scattering components of Freeman, Huynen, Krogager, Yamaguchi decomposition, as well as the eigenvalues, eigenvectors and their consequential parameters such as entropy, anisotropy and mean scattering angle. Furthermore, because all these representation-based methods were originally designed to be pixel-wise classifiers, which only consider the separate pixel signature while ignoring the spatial-contextual information, the Markov random field (MRF) model is also introduced in our scheme. MRF can provide a basis for modeling contextual constraints. Two AIRSAR data in the Flevoland area are used to validate the proposed classification scheme. Experimental results demonstrate that the proposed method can reach an accuracy of around 99 % for both AIRSAR data by randomly selecting 300 pixels of each class as the training samples. Under the condition that the training data ratio is more than 4 % , it has better performance than the SVM, SVM-MRF and NRS methods.