Esophageal cancer is a globally significant but understudied type of cancer with high mortality rates. The staging and differentiation of esophageal cancer are crucial factors in determining the prognosis and surgical treatment plan for patients, as well as improving their chances of survival. Endoscopy and histopathological examination are considered as the gold standard for esophageal cancer diagnosis. However, some previous studies have employed deep learning-based methods for esophageal cancer analysis, which are limited to single-modal features, resulting in inadequate classification results. In response to these limitations, multi-modal learning has emerged as a promising alternative for medical image analysis tasks. In this paper, we propose a hierarchical feature fusion network, MM-HiFuse, for multi-modal multitask learning to improve the classification accuracy of esophageal cancer staging and differentiation level. The proposed architecture combines low-level to deep-level features of both pathological and endoscopic images to achieve accurate classification results. The key characteristics of MM-HiFuse include: (i) a parallel hierarchy of convolution and self-attention layers specifically designed for pathological and endoscopic image features; (ii) a multi-modal hierarchical feature fusion module (MHF) and a new multitask weighted combination loss function. The benefits of these features are the effective extraction of multi-modal representations at different semantic scales and the mutual complementarity of the multitask learning, leading to improved classification performance. Experimental results demonstrate that MM-HiFuse outperforms single-modal methods in esophageal cancer staging and differentiation classification. Our findings provide evidence for the early diagnosis and accurate staging of esophageal cancer and serve as a new inspiration for the application of multi-modal multitask learning in medical image analysis. Code is available at https://github.com/huoxiangzuo/MM-HiFuse.

The early and accurate recognition of fruit tree pests and diseases is essential for safeguarding fruit yield, quality, and sustainable agricultural production. Conventional manual inspection methods are inadequate for meeting the demands of continuous, objective, and real-time monitoring in large-scale orchards. Following the framework of “model evolution–key challenges–edge-intelligent deployment,” this review systematically summarizes advances in deep learning-based recognition of fruit tree pests and diseases, and compares the effectiveness and limitations of representative methods from the perspectives of data complexity, model generalization and robustness, real-time inference, cross-modal fusion, and trustworthy diagnosis. Existing studies indicate that CNNs, attention mechanisms, Transformers, multimodal fusion, and lightweight networks have promoted the transition of fruit tree pest and disease recognition from image classification to object detection, lesion segmentation, and edge deployment; however, sample scarcity, class imbalance, insufficient cross-domain generalization, black-box decision-making, energy constraints, and long-term robustness remain major bottlenecks for field application. Future research should focus on open orchard environments and develop data-efficient, interpretable, low-power, and continuously updatable edge-intelligent recognition systems, thereby advancing precision agriculture and smart orchards.

In order to improve the positioning accuracy of the traditional geomagnetic matching algorithm, a new geomagnetic matching algorithm based on particle swarm optimization is proposed. The algorithm plans the search range of the real position centering on the measurement position of the reference navigation system. Extracting the corresponding geomagnetic data from the reference geomagnetic map, the particle swarm optimization algorithm is then introduced into the matching region search, and the obtained geomagnetic profile values are taken as particles in the particle population. On this basis, the normalized product correlation function is used as the particle fitness function, comparing the similarity between the reference sub graph and the real-time graph profile by the maximum fitness measure, Finally, through simulation analysis, the matching precision and matching time of matching algorithm based on ICP and PSO are compared. The simulation results show that the matching effect based on PSO algorithm is better than the traditional ICP algorithm. Although the matching time is slightly longer than the ICP algorithm, it meets the real-time requirements. Geomagnetic correlation matching algorithm is an extremely important type of algorithm in geomagnetic aided navigation algorithm. The current research focuses on the improvement of the traditional Terrain Contour Matching (TERCOM) algorithm metric function and the introduction of new metric functions and various ICP geomagnetic matching algorithms [1-4].The geomagnetic correlation matching algorithm of the aircraft not only requires high precision and high reliability, but also the execution efficiency of the algorithm is one of the important contents of the research. Based on the research of traditional geomagnetic correlation matching algorithm, this paper introduces particle swarm optimization algorithm into geomagnetic correlation matching algorithm. From the aspects of similarity measure function, geomagnetic matching feature quantity and search strategy, a new method of geomagnetic correlation matching for aircraft is proposed.