Experimental Analysis of Algorithms of Splitting and Connecting Snake for Extracting of the Boundary of Multiple Objects 


Vol. 19,  No. 4, pp. 221-224, Aug.  2012
10.3745/KIPSTB.2012.19.4.221


PDF
  Abstract

The most famous algorithm of splitting and connecting Snake for extracting the boundary of multiple objects is the nearest method using the distance between snake points. It often can`t split and connect Snake due to object topology. In this paper, its problem was discussed experimentally. The new algorithm using vector between Snake segment is proposed in order to split and connect Snake with complicated topology of objects. It is shown by experiment of two test images with 3 and 5 objects that the proposed one works better than the nearest one.

  Statistics
  Cite this article

[IEEE Style]

J. W. Jang and G. Cui, "Experimental Analysis of Algorithms of Splitting and Connecting Snake for Extracting of the Boundary of Multiple Objects," The KIPS Transactions:PartB , vol. 19, no. 4, pp. 221-224, 2012. DOI: 10.3745/KIPSTB.2012.19.4.221.

[ACM Style]

Jong Whan Jang and Guo Cui. 2012. Experimental Analysis of Algorithms of Splitting and Connecting Snake for Extracting of the Boundary of Multiple Objects. The KIPS Transactions:PartB , 19, 4, (2012), 221-224. DOI: 10.3745/KIPSTB.2012.19.4.221.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals