Loading...
Research Project
Beyond Convexity: Non-Convex Optimization and Game-Theoretic Approaches for Imaging Inverse Problems
Funder
Authors
Publications
GPU implementation of the simplex identification via split augmented Lagrangian
Publication . Sevilla, Jorge; Nascimento, Jose
Hyperspectral imaging can be used for object detection and for discriminating between different objects based on their spectral characteristics. One of the main problems of hyperspectral data analysis is the presence of mixed pixels, due to the low spatial resolution of such images. This means that several spectrally pure signatures (endmembers) are combined into the same mixed pixel. Linear spectral unmixing follows an unsupervised approach which aims at inferring pure spectral signatures and their material fractions at each pixel of the scene. The huge data volumes acquired by such sensors put stringent requirements on processing and unmixing methods.
This paper proposes an efficient implementation of a unsupervised linear unmixing method on GPUs using CUDA. The method finds the smallest simplex by solving a sequence of nonsmooth convex subproblems using variable splitting to obtain a constraint formulation, and then applying an augmented Lagrangian technique. The parallel implementation of SISAL presented in this work exploits the GPU architecture at low level, using shared memory and coalesced accesses to memory. The results herein presented indicate that the GPU implementation can significantly accelerate the method's execution over big datasets while maintaining the methods accuracy.
Parallel hyperspectral unmixing method via split augmented lagrangian on GPU
Publication . Sevilla, Jorge; Martin, Gabriel; Nascimento, Jose
One of the main problems of hyperspectral data analysis is the presence of mixed pixels due to the low spatial resolution of such images. Linear spectral unmixing aims at inferring pure spectral signatures and their fractions at each pixel of the scene. The huge data volumes acquired by hyperspectral sensors put stringent requirements on processing and unmixing methods. This letter proposes an efficient implementation of the method called simplex identification via split augmented Lagrangian (SISAL) which exploits the graphics processing unit (GPU) architecture at low level using Compute Unified Device Architecture. SISAL aims to identify the endmembers of a scene, i.e., is able to unmix hyperspectral data sets in which the pure pixel assumption is violated. The proposed implementation is performed in a pixel-by-pixel fashion using coalesced accesses to memory and exploiting shared memory to store temporary data. Furthermore, the kernels have been optimized to minimize the threads divergence, therefore achieving high GPU occupancy. The experimental results obtained for the simulated and real hyperspectral data sets reveal speedups up to 49 times, which demonstrates that the GPU implementation can significantly accelerate the method's execution over big data sets while maintaining the methods accuracy.
GPU implementation of a constrained hyperspectral coded aperture algorithm for compressive sensing
Publication . Bernabé, Sérgio; Martin, Gabriel; Nascimento, Jose; Bioucas-Dias, José M.; Plaza, Antonio; Silva, Vítor
In this paper, a parallel implementation of a previously constrained hyperspectral coded aperture (CHYCA) algorithm for compressive sensing on graphics processing units (GPUs) is proposed. CHYCA method combines the ideas of spectral unmixing and compressive sensing exploiting the high spatial correlation that can be observed in the data and the generally low number of endmembers needed in order to explain the data. The performance of CHYCA relies which does not depend on the tuning of a regularization parameter, which is a time consuming task offering good performance compared with a previously hyperspectral coded aperture (HYCA) method. The proposed implementation exploits the GPU architecture at low level, thus taking full advantage of the computational power of GPUs using shared memory and coalesced accesses to memory. Experimental results using simulated data reveals speedups up to 56 times, with regards to serial implementation.
Organizational Units
Description
Keywords
Contributors
Funders
Funding agency
Fundação para a Ciência e a Tecnologia
Funding programme
3599-PPCDT
Funding Award Number
PTDC/EEI-PRO/1470/2012