Search

Hyperspectral unmixing is an important technique for remote sensing image exploitation. It aims to decompose a mixed pixel into a collection of spectrally pure components (called endmembers ), and their corresponding proportions (called fractional abundances ). In recent years, many studies have revealed that unmixing using spectral information alone does not sufficiently incorporate the spatial information in the remotely sensed hyperspectral image, as the pixels are treated as isolated entities without taking into account the existing local correlation among them. To address this issue, several spatial preprocessing methods have been developed to include spatial information in the spectral unmixing process. In this paper, we present a new spatial preprocessing method which presents several advantages over existing methods. The proposed method is derived from the Simple Linear Iterative Clustering (SLIC) method, which adapts the global search scope of the clustering into local regions. As a result, the spatial correlation and the spectral similarity are intrinsically incorporated at the clustering step, which results in O ( N ) computational complexity of the clustering procedure with N being the number of pixels in the image. First, a regional clustering is iteratively performed by using spatial and spectral information simultaneously. The obtained result is a set of clustered partitions that exhibit both spectral similarity and spatial correlation. Then, for each partition we select a subset of candidate pixels with high spectral purity. Finally, the obtained candidate pixels are gathered together and fed to a spectral-based endmember extraction method to extract the final endmembers and their corresponding fractional abundances. Our newly developed method naturally integrates the spatial and the spectral information to retain the most relevant endmember candidates. Our experimental results, conducted using both synthetic and real hyperspectral scenes, indicate that the proposed method can obtain accurate unmixing results with less than 0.5% of the number of pixels used by other state-of-the-art methods. This confirms the advantages of integrating spatial and spectral information for hyperspectral unmixing purposes. [ABSTRACT FROM AUTHOR]

Image segmentation has been an important technique in the field of image processing. Fine-level manual annotations are very limited and difficult for a large collection of imbalanced images, where each image contains quite different small objects. However, we find that these imbalanced images have similar decision graphs obtained by a lightweight and simple clustering algorithm Density Peaks (DPeaks). Hence, in this paper, we propose a weakly supervised image segmentation algorithm. It trains a decision curve from decision graphs of a few sample imbalanced images by SVM and Support Vector Regression (SVR), which is effective for identifying the sparse region of an imbalanced image. Besides, RangeTree is applied to accelerate RDP for large images due to the high complexity of DPeaks Clustering. Experiments prove that the proposed algorithm works well on imbalanced image data sets, not only it can recognize main things, but also has the ability to identify some relatively small objects. [ABSTRACT FROM AUTHOR]