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.

Date Published: 7 March 2014
PDF: 9 pages
Proc. SPIE 9020, Computational Imaging XII, 902017 (7 March 2014); doi: 10.1117/12.2042486

Published in SPIE Proceedings Vol. 9020:
Computational Imaging XII
Charles A. Bouman; Ken D. Sauer, Editor(s)