Get Our e-AlertsSubmit Manuscript
Plant Phenomics / 2022 / Article

Research Article | Open Access

Volume 2022 |Article ID 9818452 | https://doi.org/10.34133/2022/9818452

Chengxin Liu, Kewei Wang, Hao Lu, Zhiguo Cao, "Dynamic Color Transform Networks for Wheat Head Detection", Plant Phenomics, vol. 2022, Article ID 9818452, 14 pages, 2022. https://doi.org/10.34133/2022/9818452

Dynamic Color Transform Networks for Wheat Head Detection

Received23 Sep 2021
Accepted04 Jan 2022
Published01 Feb 2022

Abstract

Wheat head detection can measure wheat traits such as head density and head characteristics. Standard wheat breeding largely relies on manual observation to detect wheat heads, yielding a tedious and inefficient procedure. The emergence of affordable camera platforms provides opportunities for deploying computer vision (CV) algorithms in wheat head detection, enabling automated measurements of wheat traits. Accurate wheat head detection, however, is challenging due to the variability of observation circumstances and the uncertainty of wheat head appearances. In this work, we propose a simple but effective idea—dynamic color transform (DCT)—for accurate wheat head detection. This idea is based on an observation that modifying the color channel of an input image can significantly alleviate false negatives and therefore improve detection results. DCT follows a linear color transform and can be easily implemented as a dynamic network. A key property of DCT is that the transform parameters are data-dependent such that illumination variations can be corrected adaptively. The DCT network can be incorporated into any existing object detectors. Experimental results on the Global Wheat Detection Dataset (GWHD) 2021 show that DCT can achieve notable improvements with negligible overhead parameters. In addition, DCT plays an important role in our solution participating in the Global Wheat Challenge (GWC) 2021, where our solution ranks the first on the initial public leaderboard, with an Average Domain Accuracy (ADA) of , and obtains the runner-up reward on the final private testing set, with an ADA of .

1. Introduction

Wheat is one of the principal cereal crops, playing an essential role in the human diet [1]. However, the growth of the world population and global climate change significantly threaten the supply of wheat [2]. To ensure sustainable wheat crop production, breeders need to identify productive wheat varieties by constantly monitoring many wheat traits. Among traits of interest, wheat head density, i.e., the number of wheat heads per unit area, is a key adaptation trait in the breeding process. It is closely related to yield estimation [3], stress-tolerant plant variety discovery [4], and disease resistance [5]. A natural way to estimate wheat head density is to detect every wheat head in a sampled area. In practice, wheat head density estimation still largely relies on human observation in the traditional breeding process, which is inefficient, tedious, and error-prone [6]. To meet the need of efficient measurement of wheat traits, it is required to develop machine-based techniques for automated wheat head detection.

With the prevalence of affordable camera platforms (e.g., unmanned aerial vehicles and smartphones), in-filed image-based wheat head detection emerges as a potential solution to replace tedious manual observation. It enables automated measurements of wheat traits and therefore relieves the burden of human efforts. To develop efficient and robust detection algorithms, a large and diverse wheat head dataset is necessary. However, most existing wheat head datasets [3, 4, 6] are far from satisfactory. The limited number of images and genotypes cannot guarantee the robustness of CNN models in a new environment. In addition, inconsistent labeling protocols between different datasets impede the comparison of detection methods. To tackle the issues above, the Global Wheat Head Detection dataset [5, 7] is proposed. Based on this dataset, two sessions of the Global Wheat Challenge (GWC) have been held in the Computer Vision Problems in plant phenotyping workshops (CVPPP2020 [8] and CVPPA 2021 [9]), aimed at encouraging practitioners to develop robust algorithms. The hosting of GWC 2020 and GWC 2021 has attracted a large cohort of practitioners with computer vision backgrounds. With active contributions from competitors around the world, GWC has made an important step toward a robust solution to wheat head detection. Nevertheless, the nature of in-filed images renders wheat head detection a challenging task. As shown in Figure 1, there exist several visual challenges: (i)Domain shift. Wheat head images acquired at different locations are diverse, leading to severe domain shifts. For example, the GWHD dataset covers genotypes from various countries, such as Europe, Australia, and Asia.(ii)Illumination variations. Since in-filed images are captured with ground-based platforms and cameras, illumination varies significantly under different observation conditions, especially under blazing sunlight.(iii)Appearance variations. Wheat heads exhibit distinct appearances at different developmental stages, e.g., wheat heads are green at the postflowering stage but turn yellow at the ripening stage.(iv)Degraded images. Natural conditions like wind may result in occluded images, making it hard to distinguish wheat heads.

Notice that some challenges above not only appear in wheat head detection but also occur in generic object detection. Fortunately, due to the emergence of large-scale datasets [10, 11] and high-performance graphics processing units (GPUs), deep learning has significantly advanced the progress of generic object detection [1215]. Therefore, some challenges can be well addressed. For example, the powerful representation capability of convolutional neural networks (CNNs) [1618] can mitigate the impact of appearance variations. By deploying heavy data augmentation during training, CNNs can adapt to degraded images to some extent. Despite the remarkable progress that has been achieved in generic object detection, some unique challenges in wheat head detection remain unsolved, e.g., domain shifts and illumination variations.

Recently, much effort has been made to wheat head detection [4, 6, 19]. Hasan et al. [4] apply Region-based Convolutional Neural Networks (R-CNN) for wheat spike detection, achieving high detection accuracy. Madec et al. [6] investigate two deep learning methods for wheat ear density estimation, i.e., FasterRCNN [13] and TasselNet [20], finding that FasterRCNN is more robust when the wheat ear is at the high maturity stage. Although previous studies report competitive results, the intrinsic challenges in wheat head detection are still overlooked, which impedes the progress of developing robust algorithms.

To address the aforementioned challenges, we propose the idea of dynamic color transform, aiming to adapt the CNN model to different illumination and domains. This idea is motivated by the observation that an appropriate treatment of color cues can greatly benefit wheat head detection, particularly in alleviating false negatives. Specifically, we present an analysis of the impact of the color channel and propose to deal with colors with dynamic color transform (DCT). The DCT is in the same spirit of recent dynamic networks [21, 22] that enable date-dependent inference. For example, the DCT follows a linear color model that dynamically generates parameters to modulate the color of the input image.

We evaluate our method on the GWHD 2021 dataset. In particular, we validate the effectiveness of two formulations of DCT, i.e., a regression-based DCT and a classification-based DCT, and show that DCT is not sensitive to the hyperparameters chosen. Moreover, we initiate DCT on four different backbone networks, including MobileNetV2 [23], ShuffleNetV2 [23], ResNet18 [16], and ResNet34 [16]. Notably, the ResNet18- [16] based DCT network can operate images at around 142 fps. Experimental results demonstrate that the use of DCT can help to achieve state-of-the-art performance of wheat head detection, with the validation ADA of and the testing ADA of . DCT plays an important role in our competition entry in the GWC 2021, where we finally obtain the runner-up reward.

Our main contributions include the following: (i)We investigate the impact of the color channel and observe that modifying the color channel of the input image can improve detection results(ii)We introduce a DCT network based on our observation and show that DCT can obtain notable improvements with negligible parameters overhead(iii)Our method reports state-of-the-art results on the GWHD 2021 dataset and achieves the runner-up performance on the Global Wheat Challenge 2021

The preliminary conference version of this work [24] appeared in the International Conference on Computer Vision (ICCV) Workshop—CVPPA 2021 (https://cvppa2021.github.io/). In this paper, we make the following extensions. First, we further investigate a classification-based formulation to model color transform. Second, we systematically explore the design of the DCT network, providing practical references to the agriculture and plant science community. Third, we further conduct substantial experiments and analyses to demonstrate the effectiveness of our method and to justify the rational of our design choice.

2.1. Object Detection in Computer Vision

Object detection, a fundamental task in computer vision, has witnessed remarkable progress in recent years. In the era of deep learning, object detection is typically divided into two paradigms: two-stage detection and one-stage detection. The former formulates detection as a coarse-to-fine process, while the latter predicts the object in one step. FasterRCNN [13] is a classical two-stage object detector, which unifies object proposal, feature extraction, and bounding box regression. Specifically, a Region Proposal Network (RPN) is introduced to enable nearly cost-free region proposals. Then, a box refinement module is followed after RPN, outputting final predictions. To improve the efficiency of FasterRCNN, much effort has been made like cascade detection [25], position-sensitive regression [26], and feature pyramid [17]. In contrast to two-stage detection that consists of proposal generation and verification, one-stage detection outputs objects directly. You Only Look Once (YOLO) [27] is the first deep learning-based one-stage detector. It divides an image into separate regions and predicts the objects in each region simultaneously, therefore achieving fast inference speed. Despite being efficient, it suffers from localization errors and low recall. To address these issues, YOLOv2 [28] introduces several ideas to obtain better performance, such as batch normalization [29], high-resolution classifier, anchor boxes, fine-grained features, and multiscale training. A new architecture DarkNet therefore is proposed, which achieves promising results and maintains fast inference. Subsequently, YOLOv3 [30] presents some updates on YOLOv2. Several changes in the network design decorate the detection model, such as multiscale predictions and a stronger backbone. Further, Bochkovskiy et al. [12] empirically investigate the combinations of different features that are said to improve CNN accuracy. Based on the investigation, a new edition—YOLOv4—is presented. It integrates a bunch of new features (e.g., Cross-Stage-Partial (CSP) connections [18], path aggregated network (PAN) [31], and mosaic data augmentation), achieving state-of-the-art results. Built upon YOLOv4, Scaled-YOLOv4 proposes a network scaling method that modifies the depth, width, resolution, and structure of the detection network, aimed at maintaining the best trade-off between speed and accuracy.

Benefiting from the recent progress of object detection, DCT builds upon Scaled-YOLOv4. It is worth mentioning that our DCT is generic and is capable of cooperating with other object detectors.

2.2. Wheat Head Detection in Plant Phenotyping

In recent years, computer vision-based approaches have attracted great attention in crop detection [6, 19, 32, 33]. In particular, several methods [3, 4, 6, 19, 34] have been developed for wheat head detection. As wheat heads exhibit unique texture, i.e., the spatial arrangement of color or intensity in a specific region, Qiongyan et al. [3] proposes to leverage law texture energies for wheat spike detection. By incorporating texture features into a neural network, it achieves high classification accuracy. Following this idea, Narisetti et al. [34] adopts wavelet amplitude as the input image and suppresses nonspike structures using a Frangi filter. The improved method obtains more reliable results on European wheat plants. Another line of research focuses on leveraging the power of CNNs. Hasan et al. [4] presents a specifically designed deep learning model, i.e., Region-based Convolutional Neural Networks (R-CNN), for wheat spike detection. With the high-quality spike dataset, the R-CNN model achieves favorable detection accuracy. Madec et al. [6] investigate two deep learning methods, i.e., FasterRCNN [13] and TasselNet [20], in wheat ear density estimation. The results show that FasterRCNN is more robust than TasselNet when the wheat ear is at a high maturity stage. To reduce the labeling cost in cereal crop detection, Chandra et al. [19] proposes a point supervision-based active learning approach, saving more than of the labeling time. In addition, synthesizing datasets [35] is also an appealing way to tackle the lack of large-scale training data.

In contrast to previous studies, we aim to develop high-performance detectors for wheat head detection by addressing illumination variations.

2.3. Dynamic Networks

Recently, dynamic networks emerge as a new research topic in deep learning. In contrast to conventional deep neural networks [16, 36] where the computational graphs and parameters are fixed, dynamic networks enable data-dependent inference where parameters or network architecture can be adapted conditioned on the input. A typical line of research in dynamic networks is to adapt network parameters to the input and to produce dynamic features. In the context of image classification, Spatial Transformer Networks (STNs) [37] allow the spatial manipulation of features via a differentiable data-dependent module, which makes neural networks robust to translation, scale, and rotation. Sharing a similar spirit, deformable convolutional networks [38, 39] perform irregular spatial sampling with learnable offsets and therefore achieve promising results on object detection and semantic segmentation. Apart from spatial transform, another solution is to reweight features with soft attention. The commonly used attention mechanisms include channel-wise attention [40], spatial-wise attention [41], or both [42]. Akin to soft attention, IndexNet [21, 22] is proposed to deal with the downsampling/upsampling stage in deep networks.

Our DCT is related to dynamic networks in the sense that it predicts color transform parameters based on the input. Different from previous studies, DCT manipulates the input image rather than the feature and therefore can easily cooperate with existing object detectors.

3. Materials and Methods

3.1. Global Wheat Head Detection Dataset

In this work, we adopt a recent Global Wheat Head Detection dataset 2021 [5, 7] as experimental data. The RGB images in the GWHD 2021 dataset are collected between and by institutions distributed across countries, covering genotypes from Europe, Africa, Asia, Australia, and North America. Since the GWHD dataset contains wheat heads across several developmental stages, e.g., postflowering and ripening stages, a definition of “subdataset” is introduced to help researchers to investigate the impact of each developmental stage. Specifically, a “subdataset” defines a domain, which is formulated as a consistent set of images captured under the same experimental and acquisition conditions. Figure 2 shows examples of images from different domains. Notice that the images are acquired with various ground-based phenotyping platforms and cameras at the nadir-viewing direction, resulting in diverse image properties. For example, the platforms used by different institutions include spidercam, gantry, tractor, cart, and handheld.

To assemble the images from different “subdatasets,” a manual inspection is first conducted to eliminate the invalid images that contained unclearly visible wheat heads. Next, the original images are split into squared patches. Each patch contains around to wheat heads, and a few heads will cross the patch edges. Following the standard object detection annotation paradigm, each wheat head is labeled by drawing a bounding box on a web-based labeling platform. The GWHD 2021 dataset hence is composed of these annotated squared patches, containing training images, validation images, and test images. It is worth mentioning that GWHD 2021 is used by the Global Wheat Challenge 2021 (https://www.aicrowd.com/challenges/global-wheat-challenge-2021). The validation set and the test set correspond to the partial leaderboard and the final leaderboard, respectively.

3.2. Overview of Dynamic Color Transform

Motivated by the observation that simple modification of color channels can improve detection results (Section 4.2), we propose a DCT network to improve wheat head detection. The use of the DCT network is depicted in Figure 3. Specifically, we first pass the input image through the DCT network to obtain the transformed image . Then, we perform standard object detection to compute the loss and update the DCT and the detection network.

3.3. Color Transform Modeling

Due to different observation conditions, in-filed wheat head images would suffer from illuminations variations, which deteriorate the performance of the CNN models. In practice, illumination affects the contrast of color channels, suggesting that color is an important cue to tackle illumination variations. Therefore, we propose to model color transform by a DCT network. Sharing the same spirit of recent dynamic networks [22], DCT enables data-dependent inference. It dynamically generates the linear color transform parameters to modulate the color of the input image. An appealing property of DCT is that illumination variations can be corrected adaptively.

Given an input RGB image , we adopt linear color transform to modulate as follows: where , , and denote the red, green, and blue color channels of the input image , respectively. , , and are transformed color channels. , , , , , and are color transform parameters predicted by the DCT network. Although these parameters can be modeled independently, we empirically find that it is better to unify the parameters of different color channels, i.e., , , and share the same and , , and share the same .

Formally, a DCT network parameterized by is applied to the input image , predicting color transform parameters by

Combining Equation (1), the transformed input image can be written as where , , and denote channel-wise multiplication.

3.3.1. Predicting and

Here, we present two formulations to predict and , including a regression-based formulation and a classification-based formulation.

(1) Regression-Based Formulation. Regression is the most intuitive way to predict and . Let and denote the outputs of the DCT network. We obtain and by where and are hyperparameters that control the value range of and , respectively. is the sigmoid function, is the inverse tangent function, and is a mathematical constant defined as the ratio of a circle’s circumference to its diameter. Note that and are in the range of and , respectively.

(2) Classification-Based Formulation. We also present a classification-based idea to predict and . The motivation behind this is that we consider that classification may be easier to learn than regression. Specifically, we parameterize the values of color transform parameters by a discrete interval: where and are step sizes, while and control the value range. For example, if we set and . With the definitions above, we use the DCT network to predict the probability of each element in and , obtaining the color transform parameters by where and are the probability output of the DCT network. Note that and .

3.3.2. DCT Network Architecture

Practically, DCT can be easily implemented as a dynamic network [21, 22]. Since off-the-shelf networks exhibit superior performance on computer vision tasks, in this work, we evaluate four different network architectures: ShuffleNetV2 [23], MobileNetV2 [43], ResNet18 [16], and ResNet34 [16]. The first two networks are lightweight and efficient, which have relatively low model capacity. On the contrary, ResNet18 is a medium-capacity model and ResNet34 is a high-capacity model. Note that the structure of the DCT network is not limited to existing networks, and one may manually design a DCT network.

Let the output features of the encoder of DCT network be denoted by , where , , and are the channel number, height, and width of , respectively. Following the modern CNN design protocol [16], we apply Global Average Pooling (GAP) on to obtain the pooled feature . Next, we attach a fully connected layer to to predict and . Figure 4 illustrates the details of the regression-based DCT network and classification-based DCT network. For regression-based DCT, we directly output parameters, i.e., and . We then predict and following Equations (4) and (5). Regarding classification-based DCT, we first obtain intermediate representation and . Then, we apply the softmax function on and , outputting the probability vector and . and are subsequently computed via Equations (8) and (9).

3.4. Baseline Object Detector

We adopt a state-of-the-art object detector—Scaled-YOLOv4 [15]—as our baseline, which is the latest version of the YOLO series object detector [12, 27, 28, 30]. The reasons why we chose Scaled-YOLOv4 include the following: (1)It reports strong performance on generic object detection(2)It is clean to enable flexible modifications

More importantly, we empirically find that Scaled-YOLOv4 performs favorably against state-of-the-art methods on the GWHD 2021 dataset. Table 1 shows the comparison results.


MethodVal ADATest ADA

FasterRCNN [13]0.6320.511
FCOS [44]0.7310.554
Scaled-YOLOv4 [15]0.7770.604

Here, we briefly introduce the Scaled-YOLOv4 for the sake of completeness. The architecture of Scaled-YOLOv4 is illustrated in Figure 5. Multiscale features are first extracted by CSPDarkNet backbone. Feature pyramid network (FPN) and path aggregated network are then adopted to strengthen the representation capability of features. Finally, detection heads are deployed to predict objects.

CSPDarkNet backbone. Following YOLOv4, CSPDarkNet is adopted as the backbone network. CSP [18] tackles the heavy inference computations from the perspective of network architecture. It integrates features from the beginning and the end of a network stage, reducing computation cost by . The advantages of CSPDarkNet are multifold: (i) it strengths the learning ability of a CNN; (ii) the amount of computation is evenly distributed at each layer in CNN, which removes computational bottlenecks by a significant magnitude; (iii) it reduces the memory cost, enabling efficient inference.

Feature pyramid network (FPN). Feature pyramids are a classic idea in computer vision to address objects at different scales. To exploit the inherent pyramidal hierarchy of CNN, feature pyramid network is deployed. By building a top-down architecture with lateral connections, FPN can obtain high-level semantic features at multiple scales, which significantly improves the feature representation and benefits object detection.

Path aggregated network (PAN). Information propagation is of great importance in CNN. The path aggregated network is applied to boost information flow. In contrast to FPN that is a top-down architecture, PAN adopts bottom-up path augmentation. In particular, it shortens the information path from low-level structure to topmost features. The accurate localization signals in low-level features are naturally propagated through the bottom-up path, enhancing the feature hierarchy.

Detection head. A detection head consists of classification and bounding box regression. The classification branch is attached to each PAN level, predicting the classes of each anchor box from multiple scales. Binary cross-entropy loss is adopted as a supervision signal. Parallel to the classification branch, the box regression branch predicts coordinates for each box along with an objectness score. The objectness equals if the anchor box overlaps with a ground-truth box more than any other anchor boxes. In addition, an anchor box that is not assigned with a ground-truth box contributes no loss for regression and classification. Note that a generalized intersection-over-union (GIoU) loss [45] is adopted as regression loss. GIoU loss breaks the gap between network training objective and metric evaluation by directly optimizing the metric itself, thus bringing consistent improvements in detection performance.

3.5. Loss Function

Given an object detector parameterized by and the transformed input image , the training loss is formulated as where is the ground-truth label ( is the class label and is the bounding box). In practice, is composed of classification loss and localization loss [12, 15]. Thus, Equation (10) can be rewritten as follows: where is a classification loss (i.e., cross-entropy loss) and is a localization loss (i.e., GIoU loss [45]).

It is worth mentioning that our DCT network is not limited to specific object detectors. Here, we only instantiate an application of the DCT network on Scaled-YOLOv4 [15].

3.6. Implementation Details
3.6.1. The Hyperparameters of the DCT Network

Since we present two formulations of DCT, i.e., regression-based DCT and classification-based DCT, here, we delineate their hyperparameters separately. For regression-based DCT, we set and . and therefore are in the range of and , respectively. For classification-based DCT, the hyperparameters are set as , , , and . The value range of and thus are and , respectively. Unless otherwise noted, we adopt ResNet18 as the DCT network.

3.6.2. Training Details

We adopt a two-step training strategy, i.e., we first train the detection network, then we fix it and train the DCT network. Following [15], the detection network is trained for epochs. The initial learning rate is set to , decaying with a cosine annealing schedule. Note that the input image is normalized to the range of , which is the same as [15]. We employ heavy data augmentation to increase the diversity of training samples, including random scaling, random translation, random color distortion, random flip, and mosaic [12]. Regarding the DCT network, we train it for epochs. We set the initial learning rate as , which is decreased by a factor of every epochs. Stochastic Gradient Descent (SGD) is adopted as the optimizer.

3.6.3. Testing

To further improve the detection performance, we propose a voting-based model ensemble (VME) method.

(1) Voting-Based Model Ensemble. For each image, suppose we are given a set of predictions , where is the predictions of a model and is the total number of different models. Our goal is to obtain better results by ensembling them. Let us denote one predicted box as , where and ( is the number of boxes in ). For each , we keep it only when there are more than similar boxes, i.e., is valid only when most models agree with it, otherwise discarded. Note that we consider that two boxes are similar when the intersection over union (IoU) between them is larger than a threshold (we set ). Among similar boxes, we further average them to reduce redundant boxes. In this way, we can obtain more accurate predictions and alleviate false positives. Figure 6 illustrates two situations of VME. In particular, we use test time augmentation [46] (e.g., up-down flip, left-right flip, and rotation) to obtain the predictions set .

In addition, we also use pseudolabeling [47] to achieve top ranking on GWC 2021 (Section 4.4), i.e., we retrain the model with a fusion of the training and testing data, where the predictions of our model on the test set are treated as pseudolabels.

4. Results

4.1. Evaluation Metric

We use Average Domain Accuracy (ADA) as the evaluation metric. The accuracy of each image is calculated by where , , and are true positive, false negative, and false positive, respectively. A ground-truth box is considered to match with one predicted box if their IoU is higher than a threshold of . The accuracy of all images from the same domain is averaged to obtain the domain accuracy. The ADA is the average of all domain accuracy.

4.2. Impact of the Color Channel

Here, we empirically investigate the impact of the color channel on wheat head detection and show that an appropriate treatment of color can improve detection. Specifically, given an object detector trained on the GWHD 2021 [7] dataset (e.g., we adopt Scaled-YOLOv4 [15]), we manually modify the value of each color channel using Equation (1), where and . We first fix and vary (). The qualitative results are shown in Figures 7(a)–7(c). Note that, the transformed image is the same as the original image when and . Interestingly, we observe that modifying can improve the detection results. For instance, false negatives are alleviated and false positives are suppressed. Next, we fix and vary (). Figures 7(d)–7(f) show the qualitative results. Similarly, modifying the value of can also improve detection.

Moreover, we also compare the detection performance of Scaled-YOLOv4 under different ’s and ’s on the GWHD 2021 test set. Figure 8 shows the test ADA plots of Scaled-YOLOv4, where the orange point ( and ) denotes the baseline. We notice that an appropriate choice of and can indeed improve the ADA metric. For example, setting improves the ADA from to . The results in Figure 8 are consistent with the observation in Figure 7.

To summarize, our results indicate that color is a useful clue in wheat head detection. However, we remark that, despite color being useful, it is not sufficient to tackle object detection based on colors solely. The reasons are twofold: (1)Since wheat heads vary significantly in different domains, color information is not shared among different areas(2)Color is sensitive to observation/illumination conditions; thus, color distortions may occur when perturbation appears

Therefore, we relieve the role of the color and incorporate color information into existing object detectors to improve detection.

4.3. Ablation Study
4.3.1. Effectiveness of DCT

Table 2 shows the comparison results of baseline Scaled-YOLOv4 and DCT Scaled-YOLOv4, where Val ADA and Test ADA denote the ADA on validation and test sets, respectively. Regression-based DCT and classification-based DCT both achieve notable improvements over baseline, which validates the effectiveness of our approach. Specifically, the former boosts the baseline from to on the test set. The latter obtains similar results on the test set, with an ADA of . Note that the validation set has low illumination variations; therefore, our DCT only achieves minor improvements on the validation set. Since the results between our DCT and baseline are relatively close in Val ADA, we repeat the experiments three times with different random seeds, aiming to confirm that our higher results are not due to chance. Table 3 shows the detailed results. For classification-based DCT, the results of Val ADA are , where is the mean ADA and is the standard deviation. Regarding regression-based DCT, it achieves a mean Val ADA of and a standard deviation of . The results above imply that our DCT indeed brings consistent improvements over baseline instead of by chance. To further understand the impact of DCT, we visualize the detection results and the transformed image in Figure 9. The DCT model is robust to various illumination conditions and performs consistently better than standard Scaled-YOLOv4. For example, it significantly reduces the number of false negatives.


MethodVal ADATest ADA

Baseline0.7770.604
Baseline+regression-based DCT0.7870.629
Baseline+classification-based DCT0.7820.630


MethodVal ADATest ADA

Regression-based DCT
Classification-based DCT

4.3.2. Comparison of Different DCT Networks

Table 4 compares the performance of different DCT backbones, including ShuffleNetV2 [23], MobileNetV2 [43], ResNet18 [16], and ResNet34 [16]. Our results indicate that regression-based DCT and classification-based DCT are both robust to the choice of backbone networks. Among them, ResNet18 achieves the best performance. Notice that applying lightweight networks are sufficient to achieve good performance. For example, ShuffleNetV2 only has 0.8 M and 1.0 M parameters in regression-based DCT and classification-based DCT, respectively. With negligible overhead parameters, it achieves competing results against ResNet18 DCT. In addition, it is worth mentioning that the inference time of ResNet18 DCT network is 7 ms on a single RTX 3090 GPU (i.e., around frames per second), indicating that the DCT network is efficient.


DCT networkRegression-based DCTClassification-based DCT
ParametersVal ADATest ADAParametersVal ADATest ADA

ShuffleNetV2 [23]0.8 M0.7810.6261.0 M0.7820.628
MobileNetV2 [43]2.2 M0.7820.6293.9 M0.7800.630
ResNet18 [16]11.2 M0.7870.62911.4 M0.7820.630
ResNet34 [16]21.3 M0.7810.62221.6 M0.7810.629

4.3.3. Sensitiveness of DCT Parameters

Here, we investigate the sensitiveness of the hyperparameters in regression-based DCT and classification-based DCT.

Sensitiveness of regression-based DCT. We manually tune and to examine the sensitiveness of regression-based DCT. Table 5 shows the detailed results. Increasing the range of from to slightly degrades the detection performance, which suggests that is not necessary to have a large value range. Similarly, extending the range of from to does not bring further improvement. Nevertheless, the above results demonstrate that regression-based DCT is not sensitive to hyperparameters. In addition, we recommend to use relatively small and , e.g., and already achieve good performance.


Hyperparameters range rangeVal ADATest ADA

20.2(0, 2)(-0.2, 0.2)0.7850.626
20.1(0, 2)(-0.1, 0.1)0.7870.629
30.1(0, 3)(-0.1, 0.1)0.7840.623

Sensitiveness of classification-based DCT. Since the hyperparameters of classification-based DCT control discrete interval and , we separately investigate their effects. To show the sensitiveness of , we adopt three different configurations, resulting in various and ranges. Note that we limit the maximum value of to and set . Table 6 indicates that classification-based DCT is relatively robust to different . The best results are achieved when interval , suggesting that we shall choose an appropriate interval value. Coarse interval () may miss the optimal value, while fine interval () may confuse the classification model. Therefore, both of them lead to suboptimal results.


VariableHyperparameters (Equation (6)) rangeVal ADATest ADA
0.0540[0.05,2]0.7790.626
0.120[0.1,2]0.7800.628
0.210[0.2,2]0.7770.623

VariableHyperparameters (Equation (7)) rangeVal ADATest ADA
0.025[-0.1,0.1]0.7810.628
0.052[-0.1,0.1]0.7810.629
0.054[-0.2,0.2]0.7780.629
0.12[-0.2,0.2]0.7820.630

For , we experiment with four different configurations, where we fix . The results in Table 6 show that classification-based DCT is also robust to the choice of . We observe that it is not necessary to use a too-small interval (e.g., ). In addition, the range of has a minor impact on detection performance.

4.3.4. Effectiveness of VME

The comparison results are shown in Table 7. Applying VME further unveils the potential of our approach. For the regression-based DCT model, it improves ADA by and on validation and test sets, respectively. The best performance is achieved by the classification-based DCT model with VME, with Val ADA of and Test ADA of . Figure 10 shows the qualitative results on the GWHD 2021 dataset. The predictions are in red, and the ground-truth labels are in green. It is worth noticing that our method achieves pleasing results under various illumination conditions.


MethodVal ADATest ADA

Reg. DCT0.7870.629
Reg. DCT+VME0.7960.657
Cls. DCT0.7820.630
Cls. DCT+VME0.8020.657

Reg. DCT: regression-based DCT; Cls. DCT: classification-based DCT.
4.4. Qualitative Results on the Global Wheat Challenge 2021

We participated in the GWC 2021 using our method. The competition results are shown in Table 8, and the username of our team is SMART. We rank second in the final leaderboard, with an ADA of . In addition, we rank first in the partial leaderboard (i.e., initial public leaderboard), with an ADA of . Here, we only show the results of the top teams. We refer readers to the leaderboard page (https://www.aicrowd.com/challenges/global-wheat-challenge-2021/leaderboards) for full results. Note that, despite GWC 2021 and GWHD 2021 sharing the same data, the results of our method in Table 1 are different from those in Table 8. The reasons are twofold: (1) we ensemble the predictions of multiple models in GWC 2021 to obtain top ranking, but we report the results of a single model in GWHD 2021 for fair comparison; (2) we also adopt pseudolabeling [47] to improve the detection performance in GWC 2021.


Final leaderboardPartial leaderboard
RankParticipantsADARankParticipantsADA

1randomTeamName0.7001SMART0.821
2SMART0.6952Kosung0.812
3david_jeon0.6953wheat_hunters0.811
4keyhan_najafian0.6924randomTeamName0.807
5hitsz0.6895david_jeon0.807
6maxim0.6826Hitsz0.805
7kosung0.6767augly_wheat0.792
8augly_wheat0.6718Wu_Chun_Huan_0.790
9Wu_Chun_Huan_0.6699UoL0.787
10Ural0.66610vlad_barbu0.786

5. Discussion and Conclusion

In this work, we introduce a simple but effective idea—dynamic color transform—for wheat head detection. By incorporating our DCT network into an existing object detector, we observe a notable improvement in wheat head detection. The DCT network exhibits robustness to various illumination conditions and indicates that a simple idea can make a difference if it is treated the right way. Our method reports state-of-the-art results on the GWHD 2021 dataset and achieves runner-up performance on the GWC 2021.

In the experimental section, we empirically investigate the design of DCT networks, the choice of DCT networks, and the sensitiveness of hyperparameters (the range of and ). Our results show the following: (i) Regression-based DCT and classification-based DCT are both applicable to wheat head detection. In addition, the latter performs slightly better when applying VME during testing. (ii) The performance of DCT is robust to the backbone networks chosen, and lightweight networks are sufficient to work. (iii) The DCT is not sensitive to hyperparameters. (iv) The DCT is efficient and reports state-of-the-art results with negligible overhead parameters.

Although DCT has performed favorably on the GWHD 2021 dataset, there still exist several limitations. First, it is difficult for our model to distinguish objects that have similar colors to the backgrounds. We infer that the global color transform deployed by our DCT could not tackle well similar objects and background. Local DCT may be an alternative choice to address this problem. In addition, blurred images may also render detection failure. Second, DCT is helpful when dealing with illumination variations. The impact of DCT may be minor when images are captured under a constant illumination condition.

For future work, we intend to extend our method to other plant detection tasks, e.g., maize tassel detection.

Data Availability

The GWHD 2021 dataset is available at https://zenodo.org/record/5092309.

Conflicts of Interest

The authors declare that there is no conflict of interest regarding this work.

Authors’ Contributions

CL and HL jointly proposed the idea of DCT. KW and CL implemented the technical pipeline, conducted the experiments, and analyzed the results. CL drafted the manuscript, and HL contributed extensively to the writing of the manuscript. ZC supervised the study.

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China under Grant 61876211 and in part by the Chinese Fundamental Research Funds for the Central Universities under Grant No. 2021XXJS095.

References

  1. H.-J. Braun, G. Atlin, and T. Payne, “Multi-location testing as a tool to identify plant response to global climate change,” Climate Change and Crop Production, vol. 1, pp. 115–138, 2010. View at: Publisher Site | Google Scholar
  2. M. Tester and P. Langridge, “Breeding technologies to increase crop production in a changing world,” Science, vol. 327, pp. 818–822, 2010. View at: Publisher Site | Google Scholar
  3. L. Qiongyan, J. Cai, B. Berger, M. Okamoto, and S. J. Miklavcic, “Detecting spikes of wheat plants using neural networks with laws texture energy,” Plant Methods, vol. 13, no. 1, p. 83, 2017. View at: Publisher Site | Google Scholar
  4. M. M. Hasan, J. P. Chopin, H. Laga, and S. J. Miklavcic, “Detection and analysis of wheat spikes using convolutional neural networks,” Plant Methods, vol. 14, no. 1, p. 100, 2018. View at: Publisher Site | Google Scholar
  5. E. David, S. Madec, P. Sadeghi-Tehran et al., “Global wheat head detection (GWHD) dataset: a large and diverse dataset of high-resolution RGB-labelled images to develop and benchmark wheat head detection methods,” Plant Phenomics, vol. 2020, article 3521852, 12 pages, 2020. View at: Publisher Site | Google Scholar
  6. S. Madec, X. Jin, H. Lu et al., “Ear density estimation from high resolution RGB imagery using deep learning technique,” Agricultural and Forest Meteorology, vol. 264, pp. 225–234, 2019. View at: Publisher Site | Google Scholar
  7. E. David, M. Serouart, D. Smith et al., “Global wheat head detection 2021: an improved dataset for benchmarking wheat head detection methods,” Plant Phenomics, vol. 2021, article 9846158, 9 pages, 2021. View at: Publisher Site | Google Scholar
  8. T. Pridmore, Computer vision problems in plant phenotyping, 2020, https://www.plant-phenotyping.org/CVPPP2017.
  9. I. Stavness, Computer vision in plant phenotyping and agriculture, 2021, https://cvppa2021.github.io/.
  10. O. Russakovsky, J. Deng, H. Su et al., “Imagenet large scale visual recognition challenge,” International Journal of Computer Vision, vol. 115, no. 3, pp. 211–252, 2015. View at: Publisher Site | Google Scholar
  11. T.-Y. Lin, M. Maire, S. Belongie et al., “Microsoft coco: common objects in context,” in Proceedings of the European Conference on Computer Vision (ECCV), pp. 740–755, Springer, Cham, 2014. View at: Google Scholar
  12. A. Bochkovskiy, C.-Y. Wang, and H. Liao, “Yolov4: optimal speed and accuracy of object detection,” 2020, http://arxiv.org/abs/2004.10934. View at: Google Scholar
  13. S. Ren, K. He, R. Girshick, and J. Sun, “Faster r-cnn: towards real-time object detection with region proposal networks,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 39, no. 6, pp. 1137–1149, 2017. View at: Publisher Site | Google Scholar
  14. Z. Tian, C. Shen, H. Chen, and T. He, “Fcos: fully convolutional one-stage object detection,” in 2019 IEEE/CVF International Conference on Computer Vision (ICCV), pp. 9626–9635, Seoul, Korea (South), 2019. View at: Publisher Site | Google Scholar
  15. C.-Y. Wang, A. Bochkovskiy, and H.-Y. M. Liao, “Scaled-yolov4: scaling cross stage partial network,” in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Nashville, TN, USA, 2021. View at: Publisher Site | Google Scholar
  16. K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 770–778, Las Vegas, NV, USA, 2016. View at: Publisher Site | Google Scholar
  17. T.-Y. Lin, P. Dollar, R. Girshick, K. He, B. Hariharan, and S. Belongie, “Feature pyramid networks for object detection,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 936–944, Honolulu, HI, USA, 2017. View at: Publisher Site | Google Scholar
  18. C.-Y. Wang, H.-Y. Mark Liao, Y.-H. Wu, P.-Y. Chen, J.-W. Hsieh, and I.-H. Yeh, “CSPNet: A New Backbone that can Enhance Learning Capability of CNN,” in 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), pp. 1571–1580, Seattle, WA, USA, 2020. View at: Publisher Site | Google Scholar
  19. A. L. Chandra, S. V. Desai, V. Balasubramanian, S. Ninomiya, and W. Guo, “Active learning with point supervision for cost-effective panicle detection in cereal crops,” Plant Methods, vol. 16, no. 1, p. 34, 2020. View at: Publisher Site | Google Scholar
  20. H. Lu, Z. Cao, Y. Xiao, B. Zhuang, and C. Shen, “Tasselnet: counting maize tassels in the wild via local counts regression network,” Plant Methods, vol. 13, no. 1, p. 79, 2017. View at: Publisher Site | Google Scholar
  21. H. Lu, Y. Dai, C. Shen, and S. Xu, “Indices matter: learning to index for deep image matting,” in 2019 IEEE/CVF International Conference on Computer Vision (ICCV), pp. 3265–3274, Seoul, Korea (South), 2019. View at: Publisher Site | Google Scholar
  22. H. Lu, Y. Dai, C. Shen, and S. Xu, “Index networks,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 44, no. 1, 2020. View at: Publisher Site | Google Scholar
  23. N. Ma, X. Zhang, H.-T. Zheng, and J. Sun, “Shufflenet v2: practical guidelines for efficient CNN architecture design,” in Computer Vision – ECCV 2018, pp. 122–138, Springer, Cham, 2018. View at: Publisher Site | Google Scholar
  24. C. Liu, K. Wang, H. Lu, and Z. Cao, “Dynamic color transform for wheat head detection,” in Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) Workshops, pp. 1278–1283, Montreal, BC, Canada, Oct. 2021. View at: Google Scholar
  25. Z. Cai and N. Vasconcelos, “Cascade r-cnn: delving into high quality object detection,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 6154–6162, Salt Lake City, UT, USA, 2018. View at: Publisher Site | Google Scholar
  26. J. Dai, Y. Li, K. He, and J. Sun, “R-FCN: object detection via region-based fully convolutional networks,” Advances in Neural Information Processing Systems (NeurIPS), pp. 379–387, 2016, http://arxiv.org/abs/1605.06409. View at: Google Scholar
  27. J. Redmon, S. Divvala, R. B. Girshick, and A. Farhadi, “You only look once: unified, real-time object detection,” in 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 779–788, Las Vegas, NV, USA, 2016. View at: Google Scholar
  28. J. Redmon and A. Farhadi, “Yolo9000: better, faster, stronger,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 6517–6525, Honolulu, HI, USA, 2017. View at: Google Scholar
  29. S. Ioe and C. Szegedy, “Batch normalization: accelerating deep network training by reducing internal covariate shift,” 2015, http://arxiv.org/abs/1502.03167. View at: Google Scholar
  30. J. Redmon and A. Farhadi, “Yolov3: an incremental improvement,” 2018, http://arxiv.org/abs/1804.02767. View at: Google Scholar
  31. S. Liu, L. Qi, H. Qin, J. Shi, and J. Jia, “Path aggregation network for instance segmentation,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 8759–8768, Salt Lake City, UT, USA, 2018. View at: Publisher Site | Google Scholar
  32. S. Ghosal, B. Zheng, S. Chapman et al., “A weakly supervised deep learning framework for sorghum head detection and counting,” Plant Phenomics, vol. 2019, article 1525874, 14 pages, 2019. View at: Publisher Site | Google Scholar
  33. H. Zou, H. Lu, Y. Li, L. Liu, and Z. Cao, “Maize tassels detection: a benchmark of the state of the art,” Plant Methods, vol. 16, no. 1, p. 108, 2020. View at: Publisher Site | Google Scholar
  34. N. Narisetti, K. Neumann, M. Röder, and E. Gladilin, “Automated spike detection in diverse European wheat plants using textural features and the Frangi filter in 2d greenhouse images,” Frontiers in Plant Science, vol. 11, 2020. View at: Publisher Site | Google Scholar
  35. Z. K. J. Hartley, A. S. Jackson, M. Pound, and A. P. French, “Ganana: unsupervised domain adaptation for volumetric regression of fruit,” Plant Phenomics, vol. 2021, article 9874597, 2021. View at: Publisher Site | Google Scholar
  36. K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,” International Conference on Learning Representations (ICLR), 2015, http://arxiv.org/abs/1409.1556. View at: Google Scholar
  37. M. Jaderberg, K. Simonyan, A. Zisserman, and K. Kavukcuoglu, “Spatial transformer networks,” Advances in Neural Information Processing Systems (NeurIPS), vol. 28, pp. 2017–2025, 2015. View at: Google Scholar
  38. J. Dai, H. Qi, Y. Xiong et al., “Deformable convolutional networks,” in Proceedings of the IEEE International Conference on Computer Vision (ICCV), pp. 764–773, Venice, Italy, 2017. View at: Google Scholar
  39. X. Zhu, H. Hu, S. Lin, and J. Dai, “Deformable convnets v2: more deformable, better results,” in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 9300–9308, Long Beach, CA, USA, 2019. View at: Google Scholar
  40. J. Hu, L. Shen, and G. Sun, “Squeeze-and-excitation networks,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 7132–7141, Salt Lake City, UT, USA, 2018. View at: Google Scholar
  41. F. Wang, M. Jiang, C. Qian et al., “Residual attention network for image classification,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 6450–6458, Honolulu, HI, USA, 2017. View at: Google Scholar
  42. S. Woo, J. Park, J.-Y. Lee, and I.-S. Kweon, “CBAM: convolutional block attention module,” in Computer Vision – ECCV 2018, pp. 3–19, Springer, Cham, 2018. View at: Publisher Site | Google Scholar
  43. M. Sandler, A. G. Howard, M. Zhu, A. Zhmoginov, and L.-C. Chen, “Mobilenetv2: inverted residuals and linear bottlenecks,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 4510–4520, Salt Lake City, UT, USA, 2018. View at: Google Scholar
  44. Z. Tian, C. Shen, H. Chen, and T. He, “FCOS: a simple and strong anchor-free object detector,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 2020. View at: Publisher Site | Google Scholar
  45. H. Rezatoghi, N. Tsoi, J. Gwak, A. Sadeghian, I. Reid, and S. Savarese, “Generalized intersection over union: a metric and a loss for bounding box regression,” in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 658–666, Long Beach, CA, USA, 2019. View at: Publisher Site | Google Scholar
  46. Ultralytics, Yolov5,, 2020, https://github.com/ultralytics/yolov5.
  47. D.-H. Lee, “Pseudo-label : the simple and efficient semi-supervised learning method for deep neural networks,” International Conference on Machine Learning (ICML) 2013 Workshop, vol. 3, no. 2, 2013. View at: Google Scholar

Copyright © 2022 Chengxin Liu et al. Exclusive Licensee Nanjing Agricultural University. Distributed under a Creative Commons Attribution License (CC BY 4.0).

 PDF Download Citation Citation
Views491
Downloads485
Altmetric Score
Citations