Search

We introduce the Plant Disease Detection Platform (PDDP) that allows users to send photos of sick plant leaves or textual descriptions of their appearance to obtain information about an infection that hit the vegetation and treatment tips. The backend of the platform in terms of deep learning includes image classification and text similarity models. The image classification model has two parts: feature extractor and classifier. The feature extractor was trained using the triplet loss function along with transfer learning when the weights of the network are initialized from the MobileNetV2 pretrained on the ImageNet dataset. The classifier is a simple multilayer perceptron. The test on 100 random plant images from the Internet shows 98% of the classification accuracy. We did the post-training static quantization in order to reduce the overall model size and increase the inference performance. The final model has a size of 7 Mb and works 5 times faster than the initial model without significant loss of accuracy. The text similarity model is a BERT-based transformer for obtaining vector representation of input texts for further similarity calculation between user requests and disease descriptions on the PDDP. [ABSTRACT FROM AUTHOR]

The BESIII experiment is a multi-purpose detector operating at the beams of the electron-positron collider BEPCII in Beijing. Particle tracking is a fundamental part of data analysis for this experiment. The inner part of the BESIII tracker suffers from a strong beam-related background, which significantly reduces tracking efficiency for low-pT tracks and the physics performance of the experiment. The inner part of the tracker will be replaced with the CGEM detector, which is expected to have a better performance in the presence of a strong background. At the same time, it will produce a large number of fake hits. Traditional algorithmic solutions rely on hand-engineered features and metrics, do not parallelize easily, and scale poorly with detector occupancy. In this paper we present our solution for identification and reconstruction of tracks based on deep neural network called TrackNETv2. This model is lightweight, efficient and can be trained using Monte-Carlo simulation. TrackNETv2 was proposed for another experiment BM@N and proved its usefulness for task of particle tracking. Due to architectural restrictions we added some new blocks for this model developing it to TrackNetv2.1. In this paper we evaluated these ideas on simulated data and discussed its strengths and limitations for application in the BESIII tracking challenge. [ABSTRACT FROM AUTHOR]

Modern high-energy physical detectors provide a huge amount of data, and for future high-luminosity colliders such as NICA, an Exabyte data scale is expected. Particle track reconstruction in such a dense environment is a very challenging task. Common algorithms make use of hand-engineered features and do not scale well with detector occupancy. This work is a logical continuation of the research presented on the XXII International Scientific Conference of Young Scientists and Specialists (AYSS-2018), where we have already introduced the approach of sequential tracking with the help of ad-hoc deep recurrent neural network named TrackNET. But that first version had a number of shortcomings. To address them, we introduce here the TrackNETv2, which is faster, has much fewer parameters and is able to be trained directly from Monte-Carlo simulated events. [ABSTRACT FROM AUTHOR]

Tracking particles is a challenging problem in modern high-energy physics detectors producing a vast amount of data such, as experiments on the future NICA collider. Particle track reconstruction is one of the important parts of such experiments, but existing tracking algorithms do not scale well with a growing data stream. In the same time, new effective tracking methods based on graph neural network (GNN) are actively developed and tested in the HEP.TrkX project at CERN. We introduce our GNN approach for the GEM detector of BM@N experiment of the NICA megaproject. This approach is well-adapted for solving the known fake hit problem inherent to strip detectors like GEM with help of minimum branching tree algorithms. Preliminary results for simulated events of the BM@N GEM detector are presented. [ABSTRACT FROM AUTHOR]