Search

Band selection is an effective approach to mitigate the “Hughes phenomenon” of hyperspectral image (HSI) classification. Recently, sparse representation (SR) theory has been successfully introduced to HSI band selection, and many SR-based methods have been developed and shown great potential and superiority. However, due to the inherent limitations of the SR scheme, i.e., individually representing each band with only a few other bands from the same subspace, the SR-based methods cannot effectively capture the global structures of the data, which limit the band selection performance. In this paper, to overcome this obstacle, the novel Laplacian-regularized low-rank subspace clustering (LLRSC) algorithm is proposed for HSI band selection. On the one hand, the low-rank subspace clustering model is introduced to capture the global structure information for the learned representation coefficient matrix and deal with the HSI band selection task in the clustering framework. On the other hand, considering the high correlation between adjacent bands, 1-D Laplacian regularization is utilized to incorporate the neighboring band information and further reduce the representation bias. Lastly, an eigenvalue analysis algorithm based on band mutation information is utilized to estimate the appropriate size of the band subset. The experimental results indicate that the proposed LLRSC algorithm outperforms the other state-of-the-art methods and achieves a very competitive band selection performance for HSIs. [ABSTRACT FROM AUTHOR]

This paper presents a global weighted least-squares (GWLS) optimization framework for polarimetric synthetic aperture radar (PolSAR) despeckling. GWLS is simpler than other optimization methods because it does not lead to complex optimization and iterative convergence problems. Solving the PolSAR despeckling problem based on GWLS is equivalent to solving nine sparse linear systems. First, the guidance image is constructed by the span image of the PolSAR data to calculate the five-point spatially inhomogeneous Laplacian matrix. Next, the weighted sum of the Laplacian matrix and an identity matrix is used to construct a coefficient matrix for the nine linear systems. Finally, each speckle-free channel of PolSAR data is reconstructed equally and globally by solving the linear systems with the same coefficient matrix. Filtering each element of the coherency matrix equally preserves the scattering property inherent in PolSAR data. The performance of the GWLS-based method is demonstrated by both simulated and real PolSAR data. Refined Lee filter, intensity-driven adaptive-neighborhood, improved sigma filter, and nonlocal pretest filter are used in qualitative and quantitative comparison. The experiments show that the proposed method can reach a good tradeoff between noise suppressing and detail preservation and has relatively high processing efficiency. [ABSTRACT FROM AUTHOR]

A new approach in polarimetric synthetic aperture radar (PolSAR) speckle filtering is proposed in this article. The proposed method preserves both point targets and dominant scattering mechanisms. The point targets are detected based on the span image, and they are then neither filtered nor involved in the other pixels’ filtering. To achieve the protection of the dominant scattering mechanism of each pixel, only pixels of the same dominant scattering mechanism as the centre pixel are included in the selection of the homogeneous pixels. Both point targets not being filtered and fact that only pixels of the same dominant scattering mechanism are included in the selection of the homogeneous pixels, which greatly improves the filtering efficiency. A likelihood-ratio test statistic based on the PolSAR covariance matrices is applied to determine the homogeneous pixels. Finally, the speckle filtering is processed using the weighted minimum mean square error estimator on the homogeneous pixels. We demonstrate the obvious advantages of the proposed method over other algorithms in the preservation of point targets and dominant scattering mechanisms, speckle suppression, protection of detail information, and maintenance of polarization information, by the use of both simulated and real PolSAR data. [ABSTRACT FROM AUTHOR]

Image super-resolution (SR) reconstruction has been a hot research topic in recent years. This technique allows the recovery of a high-resolution (HR) image from several low-resolution (LR) images that are noisy, blurred and down-sampled. Among the available reconstruction frameworks, the maximum a posteriori (MAP) model is widely used. In this model, the regularization parameter plays an important role. If the parameter is too small, the noise will not be effectively restrained; conversely, the reconstruction result will become blurry. Therefore, how to adaptively select the optimal regularization parameter has been widely discussed. In this paper, we propose an adaptive MAP reconstruction method based upon a U-curve. To determine the regularization parameter, a U-curve function is first constructed using the data fidelity term and prior term, and then the left maximum curvature point of the curve is regarded as the optimal parameter. The proposed algorithm is tested on both simulated and actual data. Experimental results show the effectiveness and robustness of this method, both in its visual effects and in quantitative terms. [ABSTRACT FROM AUTHOR]

The information extraction of polarimetric synthetic aperture radar (PolSAR) images typically requires a great number of training samples; however, the training samples from historical images are less reusable due to the distribution differences. Consequently, there is a significant manual cost to collecting training samples when processing new images. In this paper, to address this problem, we propose a novel active transfer learning method, which combines active learning and the deep forest model to perform transfer learning. The main idea of the proposed method is to gradually improve the performance of the model in target domain tasks with the increase of the levels of the cascade structure. More specifically, in the growing stage, a new active learning strategy is used to iteratively add the most informative target domain samples to the training set, and the augmented features generated by the representation learning capability of the deep forest model are used to improve the cross-domain representational capabilities of the feature space. In the filtering stage, an effective stopping criterion is used to adaptively control the complexity of the model, and two filtering strategies are used to accelerate the convergence of the model. We conducted experiments using three sets of PolSAR images, and the results were compared with those of four existing transfer learning algorithms. Overall, the experimental results fully demonstrated the effectiveness and robustness of the proposed method. [ABSTRACT FROM AUTHOR]

The combination of transfer learning and remote sensing image processing technology can effectively improve the automation level of image information extraction from a remote sensing time series. However, in the processing of polarimetric synthetic aperture radar (PolSAR) time-series images, the existing transfer learning methods often cannot make full use of the time-series information of the images, relying too much on the labeled samples in the target domain. Furthermore, the speckle noise inherent in synthetic aperture radar (SAR) imagery aggravates the difficulty of the manual selection of labeled samples, so these methods have difficulty in meeting the processing requirements of large data volumes and high efficiency. In lieu of these problems and the spatio-temporal relational knowledge of objects in time-series images, this paper introduces the theory of time-series clustering and proposes a new three-phase time-series clustering algorithm. Due to the full use of the inherent characteristics of the PolSAR images, this algorithm can accurately transfer the labels of the source domain samples to those samples that have not changed in the whole time series without relying on the target domain labeled samples, so as to realize transductive sample label transfer for PolSAR time-series images. Experiments were carried out using three different sets of PolSAR time-series images and the proposed method was compared with two of the existing methods. The experimental results showed that the transfer precision of the proposed method reaches a high level with different data and different objects and it performs significantly better than the existing methods. With strong reliability and practicability, the proposed method can provide a new solution for the rapid information extraction of remote sensing image time series. [ABSTRACT FROM AUTHOR]