GPU Accelerated Waterpixel algorithm for Superpixel Segmentation of Hyperspectral Images
The high computational cost of the superpixel segmentation algorithms for hyperspectral remote sensing images makes them ideal candidates for parallel computation. The waterpixel algorithm, in particular, extracts segmentation regions called waterpixels and consists of four stages called vectorial g...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2021 |
| País: | España |
| Institución: | Universidad de Santiago de Compostela (USC) |
| Repositorio: | Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela |
| Idioma: | español |
| OAI Identifier: | oai:minerva.usc.gal:10347/38537 |
| Acceso en línea: | https://hdl.handle.net/10347/38537 |
| Access Level: | acceso abierto |
| Palabra clave: | Superpixel segmentation Watershed transform Waterpixel segmentation Hyperspectral image Remote sensing CUDA 120317 Informática |
| Sumario: | The high computational cost of the superpixel segmentation algorithms for hyperspectral remote sensing images makes them ideal candidates for parallel computation. The waterpixel algorithm, in particular, extracts segmentation regions called waterpixels and consists of four stages called vectorial gradient, spatial regularization, marker selection, and watershed transform. In this paper, an efficient version of a GPU algorithm for waterpixel segmentation using the Compute Unified Device Architecture (CUDA) is presented. The algorithm extracts all the spectral information available in the bands of the hyperspectral image through the vectorial gradient. A cellular automaton is selected for the computation of the watershed transform using a block-asynchronous implementation with 8-connectivity. The experimental analysis shows high speedup values for the resulting GPU algorithm when it is compared to a multicore OpenMP implementation using 8 threads. |
|---|