Paper
7 May 2012 Multiplatform GPGPU implementation of the active contours without edges algorithm
Olmo Zavala-Romero, Anke Meyer-Baese, Uwe Meyer-Baese
Author Affiliations +
Abstract
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.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Olmo Zavala-Romero, Anke Meyer-Baese, and Uwe Meyer-Baese "Multiplatform GPGPU implementation of the active contours without edges algorithm", Proc. SPIE 8399, Visual Information Processing XXI, 83990E (7 May 2012); https://doi.org/10.1117/12.921951
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Image processing algorithms and systems

Image resolution

MATLAB

Detection and tracking algorithms

Algorithm development

Binary data

RELATED CONTENT


Back to Top