Symmetry Based Fast Marching Method for Icosahedral Virus Segmentation

被引:0
作者
Shan, Guihua [1 ]
Liu, Jun [1 ]
Ye, Liang [1 ]
Chi, Xuebin [1 ]
机构
[1] Chinese Acad Sci, Comp Network Informat Ctr, Grad Univ, Beijing 100864, Peoples R China
来源
SECOND INTERNATIONAL CONFERENCE ON DIGITAL IMAGE PROCESSING | 2010年 / 7546卷
关键词
symmetry; icosahedron; segmentation; fast marching method;
D O I
10.1117/12.855737
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Segmentation of icosahedral virus density map from cryo-electron microscope (CryoEM) is a challenging task because virus structure is complex and density map is at low resolution. Fast marching method is widely used in segmentation, in which seed selection is essential for correct segmentation results. However, the selection of an appropriate seed is difficult. In this paper, we present the method of selecting the seed in fast marching algorithm by making use of the shape symmetry to improve the fast marching method for icosahedral virus segmentation. Based on the feature of icosahedron, we compute and get its symmetry axes inside the density map. With these symmetry axes, we specify the initial seeds with the local maxima value along symmetry axes. Further, the new data structures are presented, which can effectively reduce the memory cost when implement the fast marching algorithm. Experimental results show that the approach can obtain segmentation results of the density maps fast and accurately.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] Lung Nodule Segmentation with a Region-Based Fast Marching Method
    Savic, Marko
    Ma, Yanhe
    Ramponi, Giovanni
    Du, Weiwei
    Peng, Yahui
    SENSORS, 2021, 21 (05) : 1 - 32
  • [2] Generalized fast marching method: applications to image segmentation
    Forcadel, Nicolas
    Le Guyader, Carole
    Gout, Christian
    NUMERICAL ALGORITHMS, 2008, 48 (1-3) : 189 - 211
  • [3] Generalized fast marching method: applications to image segmentation
    Nicolas Forcadel
    Carole Le Guyader
    Christian Gout
    Numerical Algorithms, 2008, 48 : 189 - 211
  • [4] A Pulmonary Vascular Segmentation Algorithm of Chest CT Images Based on Fast Marching Method
    Tan, Wenjun
    Liu, Yao
    Yang, Jinzhu
    Wang, Hua
    Wang, Tongliang
    Zhang, Yanchun
    Zhao, Dazhe
    PROCEEDINGS 2018 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2018, : 1548 - 1555
  • [5] Modified fast marching method and its application in the segmentation of medical images
    Zhu, FP
    Jie, T
    SECOND INTERNATION CONFERENCE ON IMAGE AND GRAPHICS, PTS 1 AND 2, 2002, 4875 : 319 - 324
  • [6] Novel Fast Marching for Automated Segmentation of the Hippocampus (FMASH): Method and validation on clinical data
    Bishop, Courtney A.
    Jenkinson, Mark
    Andersson, Jesper
    Declerck, Jerome
    Merhof, Dorit
    NEUROIMAGE, 2011, 55 (03) : 1009 - 1019
  • [7] Automated Fast Marching Method for Segmentation and Tracking of Region of Interest in Scintigraphic Images Sequences
    Aribi, Yassine
    Wali, Ali
    Alimi, Adel M.
    COMPUTER ANALYSIS OF IMAGES AND PATTERNS, CAIP 2015, PT II, 2015, 9257 : 725 - 736
  • [8] Fuzzy generalized fast marching method for 3D segmentation of brain structures
    Baghdadi, Mohamed
    Benamrane, Nacera
    Sais, Lakhdar
    INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY, 2017, 27 (03) : 281 - 306
  • [9] Automated Segmentation of Esophagus Layers from OCT Images using Fast Marching Method
    Zhang, Miao
    Wang, Cong
    Gan, Meng
    Yang, Na
    Yang, Ting
    Wang, Lirong
    2018 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTING, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI), 2018, : 117 - 122
  • [10] Intravascular ultrasound image segmentation:: A three-dimensional fast-marching method based on gray level distributions
    Cardinal, MHR
    Meunier, J
    Soulez, G
    Maurice, RL
    Therasse, É
    Cloutier, G
    IEEE TRANSACTIONS ON MEDICAL IMAGING, 2006, 25 (05) : 590 - 601