Share Email Print
cover

Proceedings Paper

Multiplatform GPGPU implementation of the active contours without edges algorithm
Author(s): Olmo Zavala-Romero; Anke Meyer-Baese; Uwe Meyer-Baese
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 7 May 2012
PDF: 11 pages
Proc. SPIE 8399, Visual Information Processing XXI, 83990E (7 May 2012); doi: 10.1117/12.921951
Show Author Affiliations
Olmo Zavala-Romero, The Florida State Univ. (United States)
Anke Meyer-Baese, The Florida State Univ. (United States)
Uwe Meyer-Baese, The Florida State Univ. (United States)


Published in SPIE Proceedings Vol. 8399:
Visual Information Processing XXI
Mark Allen Neifeld; Amit Ashok, Editor(s)

© SPIE. Terms of Use
Back to Top