The GVF snake with a minimal path approach

Chensheng Sun; Kin Man Lam

doi:10.1109/ICIS.2007.178

The GVF snake with a minimal path approach

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

1 Citation (Scopus)

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 language	English
Title of host publication	Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007
Pages	223-228
Number of pages	6
DOIs	https://doi.org/10.1109/ICIS.2007.178
Publication status	Published - 1 Dec 2007
Event	6th 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 2007 → 13 Jul 2007

Conference

Conference	6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007
Country/Territory	Australia
City	Melbourne, VIC
Period	11/07/07 → 13/07/07

ASJC Scopus subject areas

General Computer Science
Computer Networks and Communications
Electrical and Electronic Engineering

More information

10.1109/ICIS.2007.178

Cite this

@inproceedings{7ab0a6a804384e7299976533513059a3,

title = "The GVF snake with a minimal path approach",

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.",

author = "Chensheng Sun and Lam, {Kin Man}",

year = "2007",

month = dec,

day = "1",

doi = "10.1109/ICIS.2007.178",

language = "English",

isbn = "0769528414",

pages = "223--228",

booktitle = "Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007",

note = "6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007 ; Conference date: 11-07-2007 Through 13-07-2007",

}

Sun, C & Lam, KM 2007, The GVF snake with a minimal path approach. in Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007., 4276385, pp. 223-228, 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007, Melbourne, VIC, Australia, 11/07/07. https://doi.org/10.1109/ICIS.2007.178

The GVF snake with a minimal path approach. / Sun, Chensheng; Lam, Kin Man.
Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007. 2007. p. 223-228 4276385.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - The GVF snake with a minimal path approach

AU - Sun, Chensheng

AU - Lam, Kin Man

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=46749105919&partnerID=8YFLogxK

U2 - 10.1109/ICIS.2007.178

DO - 10.1109/ICIS.2007.178

M3 - Conference article published in proceeding or book

SN - 0769528414

SN - 9780769528410

SP - 223

EP - 228

BT - Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007

T2 - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007

Y2 - 11 July 2007 through 13 July 2007

ER -

The GVF snake with a minimal path approach

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this