By Topic

Speed Improvement of B-Snake Algorithm Using Dynamic Programming Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Maher Charfi ; ESSTT (Ecole Supérieure des Sciences et Techniques de Tunis), University of Tunis, Tunisia ; Jalel Zrida

This paper presents a novel approach to contour approximation carried out by means of the B-snake algorithm and the dynamic programming (DP) optimization technique. Using the proposed strategy for contour point search procedure, computing complexity is reduced to O(N × M2), whereas the standard DP method has an O(N × M4) complexity, with N being the number of contour sample points and M being the number of candidates in the search space. The storage requirement was also decreased from N × M3 to N × M memory elements. Some experiments on noise corrupted synthetic image, magnetic resonance, and computer tomography medical images have shown that the proposed approach results are equivalent to those obtained by the standard DP algorithm.

Published in:

IEEE Transactions on Image Processing  (Volume:20 ,  Issue: 10 )