GPU architectures offer a significant opportunity for faster morphological image processing, and the NVIDIA CUDA architecture offers a relatively inexpensive and powerful framework for performing these operations. However, the generic morphological erosion and dilation operation in the CUDA NPP library is relatively naive, and performance scales expensively with increasing structuring element size. The objective of this work is to produce a freely available GPU capability for morphological operations so that fast GPU processing can be readily available to those in the morphological image processing community. Open-source extensions to CUDA (hereafter referred to as LTU-CUDA) have been produced for erosion and dilation using a number of structuring elements for both 8 bit and 32 bit images. Support for 32 bit image data is a specific objective of the work in order to facilitate fast processing of image data from 3D range sensors with high depth precision. Furthermore, the implementation specifically allows scalability of image size and structuring element size for processing of large image sets. Images up to 4096 by 4096 pixels with 32 bit precision were tested. This scalability has been achieved by forgoing the use of shared memory in CUDA multiprocessors. The vHGW algorithm for erosion and dilation independent of structuring element size has been implemented for horizontal, vertical, and 45 degree line structuring elements with significant performance improvements over NPP. However, memory handling limitations hinder performance in the vertical line case providing results not independent of structuring element size and posing an interesting challenge for further optimisation. This performance limitation is mitigated for larger structuring elements using an optimised transpose function, which is not default in NPP, and applying the horizontal structuring element. LTU-CUDA is an ongoing project and the code is freely available at https://github.com/VictorD/LTU-CUDA.
[1]
Rolf Adams,et al.
Radial Decomposition of Discs and Spheres
,
1993,
CVGIP Graph. Model. Image Process..
[2]
Ron Kimmel,et al.
Efficient Dilation, Erosion, Opening and Closing Algorithms
,
2000,
ISMM.
[3]
K. Shadan,et al.
Available online:
,
2012
.
[4]
Marcel van Herk.
A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels
,
1992,
Pattern Recognit. Lett..
[5]
Matthew Thurley,et al.
Automated online measurement of limestone particle size distributions using 3D range data
,
2011
.
[6]
Michael Werman,et al.
Computing 2-D Min, Median, and Max Filters
,
1993,
IEEE Trans. Pattern Anal. Mach. Intell..
[7]
Ben J Hicks,et al.
SPIE - The International Society for Optical Engineering
,
2001
.
[8]
Edward R. Dougherty,et al.
Hands-on Morphological Image Processing
,
2003
.
[9]
Pavel Karas.
Efficient Computation of Morphological Greyscale Reconstruction
,
2010,
MEMICS.
[10]
Pierre Soille,et al.
Recursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles
,
1996,
IEEE Trans. Pattern Anal. Mach. Intell..
[11]
Kim C. Ng,et al.
Identifying, visualizing, and comparing regions in irregularly spaced 3D surface data
,
2005,
Comput. Vis. Image Underst..