Multiplatform GPGPU implementation of the active contours without edges algorithm

An OpenCL implementation of the Active Contours Without Edges algorithm is presented. The proposed algorithm uses the General Purpose Computing on Graphics Processing Units (GPGPU) to accelerate the original model by parallelizing the two main steps of the segmentation process, the computation of the Signed Distance Function (SDF) and the evolution of the segmented curve. The proposed scheme for the computation of the SDF is based on the iterative construction of partial Voronoi diagrams of a reduced dimension and obtains the exact Euclidean distance in a time of order O(N/p), where N is the number of pixels and p the number of processors. With high resolution images the segmentation algorithm runs 10 times faster than its equivalent sequential implementation. This work is being done as an open source software that, being programmed in OpenCL, can be used in dierent platforms allowing a broad number of nal users and can be applied in dierent areas of computer vision, like medical imaging, tracking, robotics, etc. This work uses OpenGL to visualize the algorithm results in real time.

[1]  Guido Gerig,et al.  Level-set evolution with region competition: automatic 3-D segmentation of brain tumors , 2002, Object recognition supported by user interaction for service robots.

[2]  Tony F. Chan,et al.  A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model , 2002, International Journal of Computer Vision.

[3]  Xiuying Wang,et al.  A Fast Exact Euclidean Distance Transform Algorithm , 2011, 2011 Sixth International Conference on Image and Graphics.

[4]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[5]  Anthony J. Yezzi,et al.  Fast approximate surface evolution in arbitrary dimension , 2008, SPIE Medical Imaging.

[6]  Tony F. Chan,et al.  Active contours without edges , 2001, IEEE Trans. Image Process..

[7]  Calvin R. Maurer,et al.  A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[9]  Benjamin Smith,et al.  Level Set Segmentation : Active Contours Without Edges Release 0 , 2009 .

[10]  David Potter Computational physics , 1973 .

[11]  David G. Kirkpatrick,et al.  Linear Time Euclidean Distance Algorithms , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

[13]  Luciano da Fontoura Costa,et al.  2D Euclidean distance transform algorithms: A comparative survey , 2008, CSUR.

[14]  Ronald N. Perry,et al.  Adaptively sampled distance fields: a general representation of shape for computer graphics , 2000, SIGGRAPH.

[15]  P. Smereka,et al.  A Remark on Computing Distance Functions , 2000 .

[16]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[17]  Arie E. Kaufman,et al.  Fast Ray-Tracing of Rectilinear Volume Data Using Distance Transforms , 2000, IEEE Trans. Vis. Comput. Graph..