Petal segmentation in CT images based on divide-and-conquer strategy

被引:0
|
作者
Naka, Yuki [1 ]
Utsumi, Yuzuko [1 ]
Iwamura, Masakazu [1 ]
Tsukaya, Hirokazu [2 ]
Kise, Koichi [1 ]
机构
[1] Osaka Metropolitan Univ, Grad Sch Informat, Sakai, Japan
[2] Univ Tokyo, Grad Sch Sci, Tokyo, Japan
来源
关键词
CT data; petal segmentation; image segmentation; divide-conquer strategy; data augmentation; FLOWERS; MODEL;
D O I
10.3389/fpls.2024.1389902
中图分类号
Q94 [植物学];
学科分类号
071001 ;
摘要
Manual segmentation of the petals of flower computed tomography (CT) images is time-consuming and labor-intensive because the flower has many petals. In this study, we aim to obtain a three-dimensional (3D) structure of Camellia japonica flowers and propose a petal segmentation method using computer vision techniques. Petal segmentation on the slice images fails by simply applying the segmentation methods because the shape of the petals in CT images differs from that of the objects targeted by the latest instance segmentation methods. To overcome these challenges, we crop two-dimensional (2D) long rectangles from each slice image and apply the segmentation method to segment the petals on the images. Thanks to cropping, it is easier to segment the shape of the petals in the cropped images using the segmentation methods. We can also use the latest segmentation method for the task because the number of images used for training is augmented by cropping. Subsequently, the results are integrated into 3D to obtain 3D segmentation volume data. The experimental results show that the proposed method can segment petals on slice images with higher accuracy than the method without cropping. The 3D segmentation results were also obtained and visualized successfully.
引用
收藏
页数:11
相关论文
共 50 条
  • [41] DIVIDE-AND-CONQUER FOR PARALLEL PROCESSING
    HOROWITZ, E
    ZORAT, A
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1983, 32 (06) : 582 - 585
  • [42] A divide-and-conquer discretization algorithm
    Min, F
    Xie, LJ
    Liu, QH
    Cai, HB
    [J]. FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 1, PROCEEDINGS, 2005, 3613 : 1277 - 1286
  • [43] Using divide-and-conquer GA strategy in fuzzy data mining
    Hong, TP
    Chen, CH
    Wu, YL
    Lee, YC
    [J]. ISCC2004: NINTH INTERNATIONAL SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1 AND 2, PROCEEDINGS, 2004, : 116 - 121
  • [44] A Divide-and-Conquer Strategy to Deadlock Prevention in Flexible Manufacturing Systems
    Li, Zhiwu
    Zhu, Sen
    Zhou, MengChu
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2009, 39 (02): : 156 - 169
  • [45] PRUNING DIVIDE-AND-CONQUER NETWORKS
    ROMANIUK, SG
    [J]. NETWORK-COMPUTATION IN NEURAL SYSTEMS, 1993, 4 (04) : 481 - 494
  • [46] CUTTING HYPERPLANES FOR DIVIDE-AND-CONQUER
    CHAZELLE, B
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 9 (02) : 145 - 158
  • [47] DIVIDE-AND-CONQUER NEURAL NETWORKS
    ROMANIUK, SG
    HALL, LO
    [J]. NEURAL NETWORKS, 1993, 6 (08) : 1105 - 1116
  • [48] A Feature Divide-and-Conquer Network for RGB-T Semantic Segmentation
    Zhao, Shenlu
    Zhang, Qiang
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2023, 33 (06) : 2892 - 2905
  • [49] Divide and Verify: Using a Divide-and-Conquer Strategy for Polynomial Formal Verification of Complex Circuits
    Drechsler, Rolf
    Mahzoon, Alireza
    [J]. 2023 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, DATE, 2023,
  • [50] Genetic Algorithm Based on Divide-and-Conquer Strategy for Defect-Tolerant CMOL Mapping
    Zha, Xiaojing
    Xia, Yinshui
    [J]. 2017 IEEE 12TH INTERNATIONAL CONFERENCE ON ASIC (ASICON), 2017, : 863 - 866