25 March 2011 in Journal of Mathematical Imaging and Vision
1 October 2005 in Journal of Food Engineering
19 December 2011 in IEEE Transactions on Geoscience and Remote Sensing
Spectral unmixing is an important technique for hyperspectral data exploitation, in which a mixed spectral signature is decomposed into a collection of spectrally pure constituent spectra, called endmembers, and a set of correspondent fractions, or abundances, that indicate the proportion of each endmember present in the mixture. Over the last years, several algorithms have been developed for automatic or semiautomatic endmember extraction. Some available approaches assume that the input data set contains at least one pure spectral signature for each distinct material and further conduct a search for the most spectrally pure signatures in the high-dimensional space spanned by the hyperspectral data. Among these approaches, those aimed at maximizing the volume of the simplex that can be formed using available spectral signatures have found wide acceptance. However, the presence of spectrally pure constituents is unlikely in remotely sensed hyperspectral scenes due to spatial resolution, mixing phenomena, and other considerations. In order to address this issue, other available algorithms have been developed to generate virtual endmembers (not necessarily present among the input data samples) by finding the simplex with minimum volume that encloses all available observations. In this paper, we discuss maximum-volume versus minimum-volume enclosing solutions and further develop a novel algorithm in the latter category which incorporates the fractional abundance estimation as an internal step of the endmember searching process (i.e., it does not require an external method to produce endmember fractional abundances). The method is based on iteratively enclosing the observations in a lower dimensional space and removing observations that are most likely not to be enclosed by the simplex of the endmembers to be estimated. The performance of the algorithm is investigated and compared to that of other algorithms (with and without the pure pixel assumption) using synthetic and real hyperspectral data sets collected by a variety of hyperspectral imaging instruments.
1 June 2002 in European Journal of Operational Research
VHV.G.W. van Den Hazelkamp
1 November 2014 in International Journal of Production Economics
JVJack G.A.J. van der Vorst
Jack G.A.J. van der Vorst
29 September 2020 in IEEE Access
Detection of surface material based on hyperspectral imaging (HSI) analysis is an important and challenging task in remote sensing. It is widely known that spectral-spatial data exploitation performs better than traditional spectral pixel-wise procedures. Nowadays, convolutional neural networks (CNNs) have shown to be a powerful deep learning (DL) technique due their strong feature extraction ability. CNNs not only combine spectral-spatial information in a natural way, but have also shown to be able to learn translation-equivariant representations, i.e. a translation of input features into an equivalent internal CNN feature map. This provides great robustness to spatial feature locations. However, as far as we know, CNNs do not exhibit a natural way to exploit rotation equivariance, i.e. make use of the fact that data patches in a HSI data cube are observed in different orientations due to their orientation or on the varying paths/orbits of the airborne/spaceborne spectrometers. This paper presents a rotation-equivariant CNN2D model for HSI analysis, where traditional convolution kernels have been replaced by circular harmonic filters (CHFs). The obtained results over three well-known HSI datasets showcase the potential of the approach.