Home           Contact us           FAQs           
     Journal Home     |     Aim & Scope    |    Author(s) Information      |     Editorial Board     |     MSP Download Statistics
2012 (Vol. 4, Issue: 24)
Article Information:

A Fast GVF Snake Algorithm on the GPU

Zuoyong Zheng and Ruixia Zhang
Corresponding Author:  Zuoyong Zheng 

Key words:  Circulant matrix, discrete fourier transform, fragment shader, GPU, GVF, snake,
Vol. 4 , (24): 5565-5571
Submitted Accepted Published
April 25, 2012 May 13, 2012 December 15, 2012

GVF Snake is one of the most widely-used edge detection algorithms, nevertheless subject to its slow computation. This study reveals the bottleneck and transfers the time-consuming part of this algorithm to the GPU for better performance. In detail, this algorithm is decomposed into three parts, (1) GVF Computation, (2) inversing a circulant matrix and (3) curve deformation. All of these parts are analyzed and designed to run on the GPU via suitable data structures and corresponding operations. With the help of parallel computational power of the GPU, our improved algorithm could be about 15 times as fast as is executed on the CPU.
Abstract PDF HTML
  Cite this Reference:
Zuoyong Zheng and Ruixia Zhang, 2012. A Fast GVF Snake Algorithm on the GPU.  Research Journal of Applied Sciences, Engineering and Technology, 4(24): 5565-5571.
    Advertise with us
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Current Information
   Sales & Services
Home  |  Contact us  |  About us  |  Privacy Policy
Copyright © 2015. MAXWELL Scientific Publication Corp., All rights reserved