Skip to main navigation Skip to search Skip to main content

An adaptive snake algorithm for contour detection

  • Xi'an Jiaotong University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

An adaptive Snake algorithm is presented in this paper. To every point in the initial position, the energy of the point in its neighbors is calculated by Greedy algorithm. If the target contour is not included in its neighbors, we can increase the radius of its neighbors and calculate the energy of all the points again until target contour is included. The target contour can be got by iterating once. In addition, the convergent radius is increased. It can also be applied to objects of high convexity. Comparative experiments indicate the validity of this method. Key Words: Active contour model Snake adaptive.

Original languageEnglish
Title of host publicationICSP 2002 - 2002 6th International Conference on Signal Processing, Proceedings
EditorsBaozong Yuan, Xiaofang Tang
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages628-631
Number of pages4
ISBN (Electronic)0780374886
DOIs
StatePublished - 2002
Event6th International Conference on Signal Processing, ICSP 2002 - Beijing, China
Duration: 26 Aug 200230 Aug 2002

Publication series

NameInternational Conference on Signal Processing Proceedings, ICSP
Volume1

Conference

Conference6th International Conference on Signal Processing, ICSP 2002
Country/TerritoryChina
CityBeijing
Period26/08/0230/08/02

Fingerprint

Dive into the research topics of 'An adaptive snake algorithm for contour detection'. Together they form a unique fingerprint.

Cite this