Initial condition for efficient mapping of level set algorithms on many-core architectures

Gabor Janos Tornai, Gyorgy Cserey
Faculty of Information Technology and Bionics, Pazmany Peter Catholic University, Prater str. 50/a, Budapest 1083, Hungary
EURASIP Journal on Advances in Signal Processing, 2014:30, 2014


   title={Initial condition for efficient mapping of level set algorithms on many-core architectures},

   author={Tornai, Gabor Janos and Cserey, Gyorgy},




Download Download (PDF)   View View   Source Source   Source codes Source codes



In this paper, we investigated the effect of adding more small curves to the initial condition which determines the required number of iterations of a fast level set (LS) evolution. As a result, we discovered two new theorems and developed a proof on the worst case of the required number of iterations. Furthermore, we found that these kinds of initial conditions fit well to many-core architectures. To show this, we have included two case studies which are presented on different platforms. One runs on a graphical processing unit (GPU) and the other is executed on a cellular nonlinear network universal machine (CNN-UM). With the new initial conditions, the steady-state solutions of the LS are reached in less than eight iterations depending on the granularity of the initial condition. These dense iterations can be calculated very quickly on many-core platforms according to the two case studies. In the case of the proposed dense initial condition on GPU, there is a significant speedup compared to the sparse initial condition in all cases since our dense initial condition together with the algorithm utilizes the properties of the underlying architecture. Therefore, greater performance gain can be achieved (up to 18 times speedup compared to the sparse initial condition on GPU). Additionally, we have validated our concept against numerically approximated LS evolution of standard flows (mean curvature, Chan-Vese, geodesic active regions). The dice indexes between the fast LS evolutions and the evolutions of the numerically approximated partial differential equations are in the range of 0.99 +- 0.003.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: