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 条
  • [41] A depth-first search algorithm based implementation approach of spanning tree in power system
    Tao, Hua
    Yang, Zhen
    Zhang, Min
    Yang, Jun-Xin
    He, Ren-Mu
    Shi, Yan
    Dianwang Jishu/Power System Technology, 2010, 34 (02): : 120 - 124
  • [42] Efficient semi-external depth-first search
    Wan, Xiaolong
    Wang, Hongzhi
    INFORMATION SCIENCES, 2022, 599 : 170 - 191
  • [43] Finding strong components using depth-first search
    Tarjan, Robert E.
    Zwick, Uri
    EUROPEAN JOURNAL OF COMBINATORICS, 2024, 119
  • [44] THE AVERAGE COMPLEXITY OF DEPTH-FIRST SEARCH WITH BACKTRACKING AND CUTOFF
    STONE, HS
    SIPALA, P
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1986, 30 (03) : 242 - 258
  • [45] Depth-First Heuristic Search for Software Model Checking
    Maeoka, Jun
    Tanabe, Yoshinori
    Ishikawa, Fuyuki
    COMPUTER AND INFORMATION SCIENCE 2015, 2016, 614 : 75 - 96
  • [46] Fully Dynamic Depth-First Search in Directed Graphs
    Yang, Bohua
    Wen, Dong
    Qin, Lu
    Zhang, Ying
    Wang, Xubo
    Lin, Xuemin
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2019, 13 (02): : 142 - 154
  • [47] Multi-core Nested Depth-First Search
    Laarman, Alfons
    Langerak, Rom
    van de Pol, Jaco
    Weber, Michael
    Wijs, Anton
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2011, 6996 : 321 - +
  • [48] Depth-first search in directed planar graphs, revisited
    Eric Allender
    Archit Chauhan
    Samir Datta
    Acta Informatica, 2022, 59 : 289 - 319
  • [49] Depth-First Search Using O(n) Bits
    Kiyomi, Masashi (masashi@yokohama-cu.ac.jp), 1600, Springer Verlag (8889):
  • [50] Finding Strong Components Using Depth-First Search
    Department of Computer Science, Princeton University, NJ, United States
    不详
    CA, United States
    不详
    arXiv,