TY - JOUR
T1 - Spatial subspace clustering for drill hole spectral data
AU - Guo, Yi
AU - Gao, Junbin
AU - Li, Feng
N1 - Includes bibliographical references.
PY - 2014
Y1 - 2014
N2 - A method called spatial subspace clustering (SpatSC) is proposed for the hyperspectral data segmentation problem focusing on the hyperspectral data taken from a drill hole, which can be seen as one-dimensional image data compared with hyperspectral/multispectral image data. Addressing this problem has several practical uses, such as improving interpretability of the data, and, especially, obtaining a better understanding of the mineralogy. SpatSC is a combination of subspace learning and the fused least absolute shrinkage and selection operator. As a result, it is able to produce spatially smooth clusters. From this point of view, it can be simply interpreted as a spatial information guided subspace learning algorithm. SpatSC has flexible structures that embrace the cases with and without library of pure spectra. It can be further extended, for example, using different error structures, such as including rank operator. We test this method on both simulated data and real-world hyperspectral data. SpatSC produces stable and continuous segments, which are more interpretable than those obtained from other state-of-the-art subspace learning algorithms.
AB - A method called spatial subspace clustering (SpatSC) is proposed for the hyperspectral data segmentation problem focusing on the hyperspectral data taken from a drill hole, which can be seen as one-dimensional image data compared with hyperspectral/multispectral image data. Addressing this problem has several practical uses, such as improving interpretability of the data, and, especially, obtaining a better understanding of the mineralogy. SpatSC is a combination of subspace learning and the fused least absolute shrinkage and selection operator. As a result, it is able to produce spatially smooth clusters. From this point of view, it can be simply interpreted as a spatial information guided subspace learning algorithm. SpatSC has flexible structures that embrace the cases with and without library of pure spectra. It can be further extended, for example, using different error structures, such as including rank operator. We test this method on both simulated data and real-world hyperspectral data. SpatSC produces stable and continuous segments, which are more interpretable than those obtained from other state-of-the-art subspace learning algorithms.
KW - subspace learning
KW - clustering
KW - spectral unmixing
KW - fused least absolute shrinkage and selection operator
KW - sparse model
KW - spatial smoothness
U2 - 10.1117/1.JRS.8.083644
DO - 10.1117/1.JRS.8.083644
M3 - Article
SN - 1931-3195
VL - 8
SP - 1
EP - 19
JO - Journal of Applied Remote Sensing
JF - Journal of Applied Remote Sensing
M1 - 083644
ER -