The classification and recognition of radar clutter is helpful to improve the efficiency of radar signal processing and target detection. In order to realize the effective classification of uniform circular array (UCA) radar clutter data, a classification method of ground clutter data based on the chaotic genetic algorithm is proposed. In this paper, the characteristics of UCA radar ground clutter data are studied, and then the statistical characteristic factors of correlation, non-stationery and range-Doppler maps are extracted, which can be used to classify ground clutter data. Based on the clustering analysis, results of characteristic factors of radar clutter data under different wave-controlled modes in multiple scenarios, we can see: in radar clutter clustering of different scenes, the chaotic genetic algorithm can save 34.61% of clustering time and improve the classification accuracy by 42.82% compared with the standard genetic algorithm. In radar clutter clustering of different wave-controlled modes, the timeliness and accuracy of the chaotic genetic algorithm are improved by 42.69% and 20.79%, respectively, compared to standard genetic algorithm clustering. The clustering experiment results show that the chaotic genetic algorithm can effectively classify UCA radar’s ground clutter data.

The advancement of near-ground remote sensing and artificial intelligence techniques has revolutionized field surveys, replacing traditional manual methods. Nevertheless, understanding and exploring the growth patterns and intricate morphology of natural elm tree crowns present significant challenges, especially when attempting to extract their features, which are often susceptible to interference from surrounding grass and vegetation. In addition, existing detection and segmentation models based on convolutional neural networks exhibit redundancies in their network architectures and employ less efficient algorithms, such as mask region-based convolutional neural networks. As a result, these models may not be the most suitable options for analyzing extensive and highly detailed remote-sensing image data. We focus on detecting trees in semi-arid regions and extracting their canopy parameters, such as canopy width and area. A training set is established by outlining a total of 20,594 tree canopies on high-spatial resolution unmanned aerial vehicle images. A two-stage instance segmentation model is proposed to develop a method for individual tree detection and efficient extraction of canopy parameters in complex natural environments. The results demonstrate the method’s capability to accurately detect the location, number, and canopy parameters (e.g., crown width and area) of individual trees in diverse natural scenes. The model achieves a detection speed of 13.3 fps@1024, with the model weight parameters totaling 8.08 M and computation requiring 8.96 Giga floating point operations per seconds (GFLOPs). Moreover, the detection accuracy and segmentation accuracy of individual trees on the validation set are reported as 0.463 and 0.465, respectively. Compared with Mack RCNN and Mask Scoring RCNN, the proposed method reduces the weight parameters and computational complexity of the model by 82.4%, 83.5% and 96.8%, 92.8%, respectively, while increasing the inference speed by 47.4% and 26.3%. This method offers an efficient and accurate solution for obtaining the structural parameters of individual trees.

Timely monitoring and evaluation of ecological restoration in mining areas is crucial. Based on remote sensing data and deep-learning models, the dynamic changes of bare rock area and vegetation in open-pit mine can be quantitatively monitored and analyzed. Current mining area feature extraction algorithms are limited by single-scale approaches and insufficient information fusion, resulting in low recognition rates. To address this, we proposed an improved Bilateral Segmentation Network (BiSeNetV2) semantic segmentation model (BiSeNetV2 + MSFE + SegHead, BMS), which combines multiscale feature extraction (MSFE) module and segmentation head (SegHead) structures. We utilized BMS model to conduct research on the classification and change monitoring of vegetation areas and mining areas. Our results demonstrated that the accuracy evaluation indicators aAcc, mAcc, and MIoU of the BMS model were better than those of the BiSeNetV2 model, with improvements of 3.5%, 5.5%, and 7.9%, respectively. Meanwhile, compared to the short-term dense concatenate and Twins-PCPVT deep-learning models, the BMS model improved aAcc, mAcc, and MIoU by 3.4%, 8.0%, and 7.3% and 4.4%, 1.1%, and 8.6%, respectively. Accurate and efficient research on ground object classification methods enables quantitative evaluation of mining area environment recovery, providing crucial technical support for ecological monitoring, planning, and governance.

Accurate parameter estimation is essential for modeling the statistical characteristics of ocean clutter. Common parameter estimation methods in generalized Pareto distribution models have limitations, such as restricted parameter ranges, lack of closed-form expressions, and low estimation accuracy. In this study, the particle swarm optimization (PSO) algorithm is used to solve the non-closed-form parameter estimation equations of the generalized Pareto distribution. The goodness-of-fit experiments show that the PSO algorithm effectively solves the non-closed parameter estimation problem and enhances the robustness of fitting the generalized Pareto distribution to heavy-tailed oceanic clutter data. In addition, a new parameter estimation method for the generalized Pareto distribution is proposed in this study. By using the difference between the statistical histogram of the data and the probability density function/cumulative distribution function of the generalized Pareto distribution as the target, an adaptive function with weighted coefficients is constructed to estimate the distribution parameters. A hybrid PSO (HPSO) algorithm is used to search for the best position of the fitness function to achieve the best parameter estimation of the generalized Pareto distribution. Simulation analysis shows that the HPSO algorithm outperforms the PSO algorithm in solving the parameter optimization task of the generalized Pareto distribution. A comparison with other traditional parameter estimation methods for generalized Pareto distribution shows that the HPSOHPSO algorithm exhibits strong parameter estimation performance, is efficient and stable, and is not limited by the parameter range.