A Depth-First Search algorithm automatic initialization splitting of snakes

被引:0
|
作者
Zhu, Liang [1 ]
Fox, Martin [1 ]
机构
[1] Univ Connecticut, Dept Elect & Comp Engn, Storrs, CT 06269 USA
关键词
D O I
10.1109/NEBC.2007.4413309
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
For object segmentation, the classical snake algorithms often require laborious human interaction; region growing methods are considerably dependent on the selected homogeneity criterion and initial seeds. In this paper we propose a new segmentation method for multi-object segmentation which is Depth-first Search algorithm based on GVF. The Depth-first Search process ends with a set of seeds scored and selected by considering local gradient direction information around each pixel. This step requires no human interaction; it enables our algorithm to segment objects which are separated from the background, while ignoring the internal structures of these objects. We have tested the proposed algorithm with several realistic images and obtained good results.
引用
收藏
页码:122 / 123
页数:2
相关论文
共 50 条
  • [11] An extended depth-first search algorithm for optimal triangulation of Bayesian networks
    Li, Chao (chao.li.314@gmail.com), 1600, Elsevier Inc. (80):
  • [12] A Depth-First Search Algorithm for Optimizing the Gravity Pipe Networks Layout
    Weyne Rodrigues, Gustavo Paiva
    Magalhaes Costa, Luis Henrique
    Farias, Guilherme Marques
    Holanda de Castro, Marco Aurelio
    WATER RESOURCES MANAGEMENT, 2019, 33 (13) : 4583 - 4598
  • [13] An extended depth-first search algorithm for optimal triangulation of Bayesian networks
    Li, Chao
    Ueno, Maomi
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2017, 80 : 294 - 312
  • [14] A depth-first search algorithm for computing pseudo-closed sets
    Bazin, Alexandre
    DISCRETE APPLIED MATHEMATICS, 2018, 249 : 28 - 35
  • [15] Concurrent depth-first search algorithms based on Tarjan’s Algorithm
    Gavin Lowe
    International Journal on Software Tools for Technology Transfer, 2016, 18 : 129 - 147
  • [16] A Work-Efficient Algorithm for Parallel Unordered Depth-First Search
    Acar, Umut A.
    Chargueraud, Arthur
    Rainey, Mike
    PROCEEDINGS OF SC15: THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2015,
  • [17] A Depth-First Search Algorithm for Optimizing the Gravity Pipe Networks Layout
    Gustavo Paiva Weyne Rodrigues
    Luis Henrique Magalhães Costa
    Guilherme Marques Farias
    Marco Aurélio Holanda de Castro
    Water Resources Management, 2019, 33 : 4583 - 4598
  • [18] Segmentation of external force field for automatic initialization and splitting of snakes
    Li, CM
    Liu, JD
    Fox, MD
    PATTERN RECOGNITION, 2005, 38 (11) : 1947 - 1960
  • [19] Depth-first layout algorithm for trees
    Miyadera, Y
    Anzai, K
    Unno, H
    Yaku, T
    INFORMATION PROCESSING LETTERS, 1998, 66 (04) : 187 - 194
  • [20] An external-memory depth-first search algorithm for general grid graphs
    Her, Jun-Ho
    Ramakrishna, R. S.
    THEORETICAL COMPUTER SCIENCE, 2007, 374 (1-3) : 170 - 180