کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
531192 | 869818 | 2006 | 9 صفحه PDF | دانلود رایگان |
There have been many attempts to improve the original Snake algorithm by Kass et al. to enhance its ability to locate object boundaries with sharp corners or concave parts. But most of these variants of the Snake model require introducing additional external forces or modifying internal energy terms, all of which necessitate cumbersome fine-tuning by users for optimal performance. In this paper, we present a mathematical formulation for a new algorithm that embeds a domain transformation mapping within the Snake algorithm. The domain transformation step serves to render the object contour more convex and hence is more amenable to be better represented by the Snake contour. Analysis of the new algorithm is carried out which facilitated further enhancements to our technique, rendering a final algorithm that is computationally efficient and is easy and flexible to use. Our approach has been tested with very encouraging experimental results.
Journal: Pattern Recognition - Volume 39, Issue 9, September 2006, Pages 1566–1574