10908

A Fast GVF Snake Algorithm on the GPU

Zuoyong Zheng, Ruixia Zhang
Department of Information Engineering, North China University of Water Resources and Electric Power, Zhengzhou, China
Research Journal of Applied Sciences, Engineering and Technology 4(24): 5565-5571, 2012

@article{zheng2012fast,

   title={A Fast GVF Snake Algorithm on the GPU},

   author={Zheng, Zuoyong and Zhang, Ruixia},

   journal={image},

   volume={2},

   pages={4},

   year={2012}

}

Download Download (PDF)   View View   Source Source   

961

views

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.
No votes yet.
Please wait...

* * *

* * *

Featured events

2018
November
27-30
Hida Takayama, Japan

The Third International Workshop on GPU Computing and AI (GCA), 2018

2018
September
19-21
Nagoya University, Japan

The 5th International Conference on Power and Energy Systems Engineering (CPESE), 2018

2018
September
22-24
MediaCityUK, Salford Quays, Greater Manchester, England

The 10th International Conference on Information Management and Engineering (ICIME), 2018

2018
August
21-23
No. 1037, Luoyu Road, Hongshan District, Wuhan, China

The 4th International Conference on Control Science and Systems Engineering (ICCSSE), 2018

2018
October
29-31
Nanyang Executive Centre in Nanyang Technological University, Singapore

The 2018 International Conference on Cloud Computing and Internet of Things (CCIOT’18), 2018

HGPU group © 2010-2018 hgpu.org

All rights belong to the respective authors

Contact us: