Hyperspectral image classification based on spectral–spatial one-dimensional manifold embedding
IEEE Transactions on Geoscience and Remote Sensing, 2016•ieeexplore.ieee.org
A novel approach called Spectral-Spatial 1-D Manifold Embedding (SS1DME) is proposed
in this paper for remotely sensed hyperspectral image (HSI) classification. This novel
approach is based on a generalization of the recently developed smooth ordering model,
which has gathered a great interest in the image processing area. In the proposed
approach, first, we employ the spectral-spatial information-based affinity metric to learn the
similarity of HSI pixels, where the contextual information is encoded into the affinity metric …
in this paper for remotely sensed hyperspectral image (HSI) classification. This novel
approach is based on a generalization of the recently developed smooth ordering model,
which has gathered a great interest in the image processing area. In the proposed
approach, first, we employ the spectral-spatial information-based affinity metric to learn the
similarity of HSI pixels, where the contextual information is encoded into the affinity metric …
A novel approach called Spectral-Spatial 1-D Manifold Embedding (SS1DME) is proposed in this paper for remotely sensed hyperspectral image (HSI) classification. This novel approach is based on a generalization of the recently developed smooth ordering model, which has gathered a great interest in the image processing area. In the proposed approach, first, we employ the spectral-spatial information-based affinity metric to learn the similarity of HSI pixels, where the contextual information is encoded into the affinity metric using spatial information. In our derived model, based on the obtained affinity metric, the created multiple 1-D manifold embeddings (1DMEs) consist of several different versions of 1DME of the same set of all HSI points. Since each 1DME of the data is a 1-D sequence, a label function on the data can be obtained by applying the simple 1-D signal processing tools (such as interpolation/regression). By collecting the predicted labels from these label functions, we build a subset of the current unlabeled points, on which the labels are correctly labeled with high confidence. Next, we add a proportion of the elements from this subset to the original labeled set to get the updated labeled set, which is used for the next running instance. Repeating this process for several loops, we get an extended labeled set, where the new members are correctly labeled by the label functions with much high confidence. Finally, we utilize the extended labeled set to build the target classifier for the whole HSI pixels. In the whole process, 1DME plays the role of learning data features from the given affinity metric. With the incrementation of learning features during iteration, the proposed scheme will gradually approximate the exact labels of all sample points. The proposed scheme is experimentally demonstrated using four real HSI data sets, exhibiting promising classification performance when compared with other recently introduced spatial analysis alternatives.
ieeexplore.ieee.org