Related Experiment Videos
Benchmarking hybrid CNN and transformer backbones with graph convolution networks (GCN) for flower growth-stage
Aritra Das1, Karib Shams1, Mohammad Rifat Ahmmad Rashid2
1East West University, A, 2 Jahurul Islam Ave, Dhaka, 1212, Dhaka, Bangladesh.
None:
Accurate recognition of flower growth stages is important for plant phenotyping but remains challenging due to subtle visual differences and limited labeled data. This study proposes a hybrid CNN/Transformer + GCN framework for fine-grained flower growth-stage classification. A new dataset, BD Flower Growth, is introduced with 3,889 original images from eight Bangladeshi flower species, categorized into three stages (early, mid, full), forming 24 classes. The dataset is divided into training and testing sets, with augmentation applied only to the training data. Deep backbone networks are used to extract feature maps, which are transformed into graph representations and refined using Graph Convolutional Networks (GCN). A systematic ablation study is conducted by varying GCN depth (3, 5 layers), node resolution ([Formula: see text], [Formula: see text]), and graph construction methods (4-neighbour, 8-neighbour, and KNN with [Formula: see text]). Experimental results show that performance depends strongly on both backbone and graph configuration. The best performance of 97% accuracy is achieved by EfficientNetV2, DenseNet201-based hybrid models, additionally Swin Transformer model shows the largest improvement, increasing from 84% to 97% after GCN integration. Across different settings, grid-based graphs (4- and 8-neighbour) consistently provide more stable and higher performance compared to KNN graphs, while moderate GCN depth (3-5 layers) offers the best balance accuracy. Cross-dataset evaluation on the Oxford 102 Flower dataset further demonstrates the generalization capability of the proposed approach. These findings highlight the effectiveness of hybrid graph-based learning and the importance of graph configuration in improving fine-grained classification.