The GVF snake with a minimal path approach

Chensheng Sun, Kin Man Lam

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

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.
Original languageEnglish
Title of host publicationProceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007
Pages223-228
Number of pages6
DOIs
Publication statusPublished - 1 Dec 2007
Event6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007 - Melbourne, VIC, Australia
Duration: 11 Jul 200713 Jul 2007

Conference

Conference6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007
Country/TerritoryAustralia
CityMelbourne, VIC
Period11/07/0713/07/07

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this