loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007)
The GVF Snake with a Minimal Path Approach
Melbourne, Australia
July 11-July 13
ISBN: 0-7695-2841-4
Chensheng Sun, The Hong Kong Polytechnic University, Hong Kong
Kin-Man Lam, The Hong Kong Polytechnic University, Hong Kong
In this paper we propose a contour extraction method based on the active contour model, which uses the GVF snake to obtain the initial segments for a contour; and then a minimal path method for the refinement stage, to obtain an accurate and more robust result. By employing the minimal path method to find missing segments between pairs of nodes defined on the contour obtained by the GVF snake, our algorithm is able to detect deep concave parts of object boundary, and works well even when the snake initialization is not very good.
Citation:
Chensheng Sun, Kin-Man Lam, "The GVF Snake with a Minimal Path Approach," icis, pp.223-228, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.