AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

DBGCN: Dual-branch Graph Convolutional Network for organ instance inference on sparsely labeled 3D plant data

Dawei Lia,b,c,1Zhaoyi Zhoua,1Si Yangd,eWeiliang Wend,e( )
School of Information and Intelligent Science, Donghua University, Shanghai, 201620, China
State Key Laboratory of Advanced Fiber Materials (SKLAFM), Donghua University, Shanghai, 201620, China
Engineering Research Center of Digitized Textile & Fashion Technology, Ministry of Education, Donghua University, Shanghai, 201620, China
Information Technology Research Center, Beijing Academy of Agriculture and Forestry Sciences, Beijing, 100097, China
Beijing Key Lab of Digital Plant, National Engineering Research Center for Information Technology in Agriculture, Beijing, 100097, China

1 These authors contributed equally to this work.

Show Author Information

Abstract

3D crop phenotyping technology provides critical support for screening morphology-related plant genes and identification of germplasm resource. Organ segmentation or recognition is the first key step in 3D crop phenotyping, where inductive deep learning currently dominates as the mainstream methodology. However, the high requirement for data annotation in inductive learning paradigm has transformed the manual data labeling into a labor-intensive task, thereby in turn restricting the progress of inductive learning. This problem has inspired us to leverage Graph Neural Networks (GNNs) as the transductive learning tool to directly segment organs on sparsely annotated crop point clouds. We propose a Dual-branch Graph Convolutional Network (DBGCN) that only requires sparse labels to perform organ instance inference directly on plant point clouds that have featureless point features. Different from existing graph-based networks, DBGCN not only carries out the static-feature-space graph convolutions that are good at mining and aggregating on local information on the point cloud, but also incorporates dynamic graph convolutions that captures the potential changes of the graph manifold in deep feature space. Extensive experiments prove that the fusion of two types of graph feature convolutions brings a high node (point) classification accuracy, outperforming mainstream GNNs and even several popular inductive deep architectures. On the PlantNet sub-dataset, DBGCN achieves an mAcc (mean accuracy of node classification) of 93.00% under 1.95% manual annotation ratio. On the Soybean-MVS sub-dataset, DBGCN achieves an mAcc of 91.05% under 4.88% manual annotation ratio. Furthermore, our DBGCN not only works well on crop 3D data but can also serve other applications such as the segmentation of point cloud data for large-scale street view. Our dataset and code can be found at https://github.com/chinazhouzhaoyi/DBGCN/tree/master/

Electronic Supplementary Material

Download File(s)
pp-8-2-100188_ESM.pdf (1.8 MB)

References

【1】
【1】
 
 
Plant Phenomics
Article number: 100188

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Li D, Zhou Z, Yang S, et al. DBGCN: Dual-branch Graph Convolutional Network for organ instance inference on sparsely labeled 3D plant data. Plant Phenomics, 2026, 8(2): 100188. https://doi.org/10.1016/j.plaphe.2026.100188

7

Views

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Received: 07 September 2025
Revised: 02 February 2026
Accepted: 10 February 2026
Published: 09 March 2026
© 2026 The Authors. Nanjing Agricultural University.

This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).