Green Citrus Detection and Counting in Orchards Based on YOLOv5-CS and AI Edge System

Green citrus detection in citrus orchards provides reliable support for production management chains, such as fruit thinning, sunburn prevention and yield estimation. In this paper, we proposed a lightweight object detection YOLOv5-CS (Citrus Sort) model to realize object detection and the accurate counting of green citrus in the natural environment. First, we employ image rotation codes to improve the generalization ability of the model. Second, in the backbone, a convolutional layer is replaced by a convolutional block attention module, and a detection layer is embedded to improve the detection accuracy of the little citrus. Third, both the loss function CIoU (Complete Intersection over Union) and cosine annealing algorithm are used to get the better training effect of the model. Finally, our model is migrated and deployed to the AI (Artificial Intelligence) edge system. Furthermore, we apply the scene segmentation method using the “virtual region” to achieve accurate counting of the green citrus, thereby forming an embedded system of green citrus counting by edge computing. The results show that the [email protected] of the YOLOv5-CS model for green citrus was 98.23%, and the recall is 97.66%. The inference speed of YOLOv5-CS detecting a picture on the server is 0.017 s, and the inference speed on Nvidia Jetson Xavier NX is 0.037 s. The detection and counting frame rate of the AI edge system-side counting system is 28 FPS, which meets the counting requirements of green citrus.

Genetic Diversity and Structure of Core Collection of Huangqi (Astragalus) Developed by Genomic Simple Sequence Repeat Markers

Huangqi (Astragalus) is a versatile herb that possesses several therapeutic effects against a variety of diseases, especially lung diseases. The aim of this study was to establish a core collection of Astragalus germplasm resources based on molecular 10 SSR markers. Based on 380 samples of Astragalus collected from different areas, five different methods were utilized to construct the core collection of Astragalus, including PowerCore-based M strategy, CoreFinder-based M strategy, Core Hunter-based stepwise sampling, PowerMarker-based simulated annealing algorithm based on allele maximization, and PowerMarker-based simulated annealing algorithm based on maximizing genetic diversity. Of the constructed Astragalus core collections, the CoreFinder-based M strategy was found to be the most suitable approach as it reserved all the alleles and most of the genetic diversity parameters were higher than those of the initial collection. Additional analyses demonstrated that the genetic diversity of the core collection matched the properties of the initial collection. Further, the phylogenetic trees indicated that the population structure of the core collection was similar to that of the initial collection. In addition, our results showed that the optimal grouping value of K was 2. The construction of a core collection is beneficial for the understanding, management, and utilization of Astragalus. Moreover, this study will act as a valuable reference for constructing core collections for other plants or fungi.

Bayesian Model Updating Based on Kriging Surrogate Model and Simulated Annealing Algorithm

Aiming at the problem of difficulty in selecting the proposal distribution and low computational efficiency in the traditional Markov chain Monte Carlo algorithm, a Bayesian model updating method using surrogate model technology and simulated annealing algorithm is proposed. Firstly, the Kriging surrogate model is used to mine the implicit relationship between the structural parameters to be updated and the corresponding dynamic responses, and the Kriging model that meets the accuracy requirement is used to replace the complex finite element model to participate in the iterative calculation to improve the model updating efficiency. Then, the simulated annealing algorithm is introduced to reorganize the Markov chains from different proposal distributions to obtain high-quality posterior samples, which are used to estimate the parameters posterior distributions. Finally, a space truss structure is used to verify the effectiveness of the proposed method.

Novel Metaheuristic Based on Iterated Constructive Stochastic Heuristic: Dhouib-Matrix-3 (DM3)

This paper presents a new metaheuristic named Dhouib-Matrix-3 (DM3) inspired by our recently developed constructive stochastic heuristic Dhouib-Matrix-TSP2 (DM-TSP2) and characterized by only one parameter: the number of iterations. The proposed metaheuristic DM3 is an iterative algorithm in which every iteration is based on two relay hybridization techniques. At first, the constructive stochastic heuristic DM-TSP2 starts by generating a different initial basic feasible solution and then each solution is intensified by the novel procedure Far-to-Near which exchanges far cities by closer ones using three perturbation techniques: insertion, exchange, and 2-opt. Experimental results carried out on the classical travelling salesman problem using the well-known TSP-LIB benchmark instances demonstrate that our approach DM3 outclasses the simulated annealing algorithm, the genetic algorithm, and the cellular genetic algorithm. Furthermore, the proposed DM3 is statistically concurrent to the hybrid simulated annealing cellular genetic algorithm. Nevertheless, DM3 is easier to implement and needs only one parameter to identify (the maximum number of iterations).

Optimization and Design of Hammerheads and Fenders on Scrap Metal Shredders Based on Improved Genetic Algorithm

Dynamic unbalance force is an important factor affecting the service life of scrap metal shredders (SMSs) as the product of mass error. Due to the complexity of hammerheads arrangement, it is difficult to take all the parts of the hammerhead into account in the traditional methods. A novel optimization algorithm combining genetic algorithm and simulated annealing algorithm is proposed to improve the dynamic balance of scrap metal shredders. The optimization of hammerheads and fenders on SMS in this paper is considered as a multiple traveling salesman problem (MTSP), which is a kind of NP-hard problem. To solve this problem, an improved genetic algorithm (IGA) combined with the global optimization characteristics of genetic algorithm (GA) and the local optimal solution of simulated annealing algorithm (SA) is proposed in this paper, which adopts SA in the process of selecting subpopulations. The optimization results show that the resultant force of the shredder central shaft by using IGA is less than the traditional metaheuristic algorithm, which greatly improves the dynamic balance of the SMS. Validated via ADAMS simulation, the results are in good agreement with the theoretical optimization analysis.