7 March 2014 Comparative analysis of the speed performance of texture analysis algorithms on a graphic processing unit (GPU)
Author Affiliations +
Abstract
This paper compares the speed performance of a set of classic image algorithms for evaluating texture in images by using CUDA programming. We include a summary of the general program mode of CUDA. We select a set of texture algorithms, based on statistical analysis, that allow the use of repetitive functions, such as the Coocurrence Matrix, Haralick features and local binary patterns techniques. The memory allocation time between the host and device memory is not taken into account. The results of this approach show a comparison of the texture algorithms in terms of speed when executed on CPU and GPU processors. The comparison shows that the algorithms can be accelerated more than 40 times when implemented using CUDA environment.
© (2014) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
J. Triana-Martinez, S. A. Orjuela-Vargas, W. Philips, "Comparative analysis of the speed performance of texture analysis algorithms on a graphic processing unit (GPU)", Proc. SPIE 9020, Computational Imaging XII, 902017 (7 March 2014); doi: 10.1117/12.2042486; https://doi.org/10.1117/12.2042486
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT

Timed fast exact Euclidean distance (tFEED) maps
Proceedings of SPIE (February 25 2005)
A Microprogrammable Processor For Image Operations
Proceedings of SPIE (December 19 1985)
Image processing for automated visual surface inspection
Proceedings of SPIE (September 25 1997)
Application of SKIPSM to binary template matching
Proceedings of SPIE (October 03 1994)

Back to Top