• DocumentCode
    18557
  • Title

    Multi-GPU Implementation of the Minimum Volume Simplex Analysis Algorithm for Hyperspectral Unmixing

  • Author

    Agathos, Alexander ; Jun Li ; Petcu, Dana ; Plaza, Antonio

  • Author_Institution
    Comput. Sci. Dept., West Univ. of Timisoara, Timisoara, Romania
  • Volume
    7
  • Issue
    6
  • fYear
    2014
  • fDate
    Jun-14
  • Firstpage
    2281
  • Lastpage
    2296
  • Abstract
    Spectral unmixing is an important task in remotely sensed hyperspectral data exploitation. The linear mixture model has been widely used to unmix hyperspectral images by identifying a set of pure spectral signatures, called endmembers, and estimating their respective abundances in each pixel of the scene. Several algorithms have been proposed in the recent literature to automatically identify endmembers, even if the original hyperspectral scene does not contain any pure signatures. A popular strategy for endmember identification in highly mixed hyperspectral scenes has been the minimum volume simplex analysis (MVSA), known to be a computationally very expensive algorithm. This algorithm calculates the minimum volume enclosing simplex, as opposed to other algorithms that perform maximum simplex volume analysis (MSVA). The high computational complexity of MVSA, together with its very high memory requirements, has limited its adoption in the hyperspectral imaging community. In this paper, we develop several optimizations to the MVSA algorithm. The main computational task of MVSA is the solution of a quadratic optimization problem with equality and inequality constraints, with the inequality constraints being in the order of the number of pixels multiplied by the number of endmembers. As a result, storing and computing the inequality constraint matrix is highly inefficient. The first optimization presented in this paper uses algebra operations in order to reduce the memory requirements of the algorithm. In the second optimization, we use graphics processing units (GPUs) to effectively solve (in parallel) the quadratic optimization problem involved in the computation of MVSA. In the third optimization, we extend the single GPU implementation to a multi-GPU one, developing a hybrid strategy that distributes the computation while taking advantage of GPU accelerators at each node. The presented optimizations are tested in different analysis scenarios (using both synthetic - nd real hyperspectral data) and shown to provide state-of-the-art results from the viewpoint of unmixing accuracy and computational performance. The speedup achieved using the full GPU cluster compared to the CPU implementation in tenfold in a real hyperspectral image.
  • Keywords
    geophysical image processing; graphics processing units; hyperspectral imaging; optimisation; remote sensing; CPU implementation; endmember identification; full GPU cluster; graphics processing units; hyperspectral unmixing; inequality constraint matrix; minimum volume simplex analysis algorithm; multiGPU implementation; quadratic optimization problem; Algorithm design and analysis; Graphics processing units; Hyperspectral imaging; Optimization; Prediction algorithms; Vectors; Endmember identification; graphics processing units (GPUs); hyperspectral imaging; minimum volume simplex analysis (MVSA); spectral unmixing;
  • fLanguage
    English
  • Journal_Title
    Selected Topics in Applied Earth Observations and Remote Sensing, IEEE Journal of
  • Publisher
    ieee
  • ISSN
    1939-1404
  • Type

    jour

  • DOI
    10.1109/JSTARS.2014.2320896
  • Filename
    6819848