Search

For the RRT* algorithm, there are problems such as greater randomness, longer time consumption, more redundant nodes, and inability to perform local obstacle avoidance when encountering unknown obstacles in the path planning process of autonomous vehicles. And the artificial potential field method (APF) applied to autonomous vehicles is prone to problems such as local optimality, unreachable targets, and inapplicability to global scenarios. A fusion algorithm combining the improved RRT* algorithm and the improved artificial potential field method is proposed. First of all, for the RRT* algorithm, the concept of the artificial potential field and probability sampling optimization strategy are introduced, and the adaptive step size is designed according to the road curvature. The path post-processing of the planned global path is carried out to reduce the redundant nodes of the generated path, enhance the purpose of sampling, solve the problem where oscillation may occur when expanding near the target point, reduce the randomness of RRT* node sampling, and improve the efficiency of path generation. Secondly, for the artificial potential field method, by designing obstacle avoidance constraints, adding a road boundary repulsion potential field, and optimizing the repulsion function and safety ellipse, the problem of unreachable targets can be solved, unnecessary steering in the path can be reduced, and the safety of the planned path can be improved. In the face of U-shaped obstacles, virtual gravity points are generated to solve the local minimum problem and improve the passing performance of the obstacles. Finally, the fusion algorithm, which combines the improved RRT* algorithm and the improved artificial potential field method, is designed. The former first plans the global path, extracts the path node as the temporary target point of the latter, guides the vehicle to drive, and avoids local obstacles through the improved artificial potential field method when encountered with unknown obstacles, and then smooths the path planned by the fusion algorithm, making the path satisfy the vehicle kinematic constraints. The simulation results in the different road scenes show that the method proposed in this paper can quickly plan a smooth path that is more stable, more accurate, and suitable for vehicle driving. [ABSTRACT FROM AUTHOR]

Atrial fibrillation (AF) is a common arrhythmia, and out-of-hospital, wearable, long-term electrocardiogram (ECG) monitoring can help with the early detection of AF. The presence of a motion artifact (MA) in ECG can significantly affect the characteristics of the ECG signal and hinder early detection of AF. Studies have shown that (a) using reference signals with a strong correlation with MAs in adaptive filtering (ADF) can eliminate MAs from the ECG, and (b) artificial intelligence (AI) algorithms can recognize AF when there is no presence of MAs. However, no literature has been reported on whether ADF can improve the accuracy of AI for recognizing AF in the presence of MAs. Therefore, this paper investigates the accuracy of AI recognition for AF when ECGs are artificially introduced with MAs and processed by ADF. In this study, 13 types of MA signals with different signal-to-noise ratios ranging from +8 dB to −16 dB were artificially added to the AF ECG dataset. Firstly, the accuracy of AF recognition using AI was obtained for a signal with MAs. Secondly, after removing the MAs by ADF, the signal was further identified using AI to obtain the accuracy of the AF recognition. We found that after undergoing ADF, the accuracy of AI recognition for AF improved under all MA intensities, with a maximum improvement of 60%. [ABSTRACT FROM AUTHOR]

Within research on the cross-view geolocation of UAVs, differences in image sources and interference from similar scenes pose huge challenges. Inspired by multimodal machine learning, in this paper, we design a single-stream pyramid transformer network (SSPT). The backbone of the model uses the self-attention mechanism to enrich its own internal features in the early stage and uses the cross-attention mechanism in the later stage to refine and interact with different features to eliminate irrelevant interference. In addition, in the post-processing part of the model, a header module is designed for upsampling to generate heat maps, and a Gaussian weight window is designed to assign label weights to make the model converge better. Together, these methods improve the positioning accuracy of UAV images in satellite images. Finally, we also use style transfer technology to simulate various environmental changes in order to expand the experimental data, further proving the environmental adaptability and robustness of the method. The final experimental results show that our method yields significant performance improvement: The relative distance score (RDS) of the SSPT-384 model on the benchmark UL14 dataset is significantly improved from 76.25% to 84.40%, while the meter-level accuracy (MA) of 3 m, 5 m, and 20 m is increased by 12%, 12%, and 10%, respectively. For the SSPT-256 model, the RDS has been increased to 82.21%, and the meter-level accuracy (MA) of 3 m, 5 m, and 20 m has increased by 5%, 5%, and 7%, respectively. It still shows strong robustness on the extended thermal infrared (TIR), nighttime, and rainy day datasets. [ABSTRACT FROM AUTHOR]

The research on high-precision and all-scenario localization using the millimeter-wave (mmWave) band is of great urgency. Due to the characteristics of mmWave, blockages make the localization task more complex. This paper proposes a cooperative localization system among user equipment (UEs) assisted by reconfigurable intelligent surfaces (RISs), which considers device-to-device (D2D) communication. RISs are used as anchor points, and position estimation is achieved through signal exchanges between UEs. Firstly, we establish a localization model based on this system and derive the UEs' positioning error bound (PEB) as a performance metric. Then, a UE-RIS joint beamforming design is proposed to optimize channel state information (CSI) with the objective of achieving the minimum PEB. Finally, simulation analysis demonstrates the advantages of the proposed scheme over RIS-assisted base station positioning, achieving centimeter-level accuracy with a 10 dBm lower transmission power. [ABSTRACT FROM AUTHOR]

Robust face clustering enjoys a wide range of applications for gate passes, surveillance systems and security analysis in embedded sensors. Nevertheless, existing algorithms have limitations in finding accurate clusters when data contain noise (e.g., occluded face clustering and recognition). It is known that in subspace clustering, the ℓ 1 - and ℓ 2 -norm regularizers can improve subspace preservation and connectivity, respectively, and the elastic net regularizer (i.e., the mixture of the ℓ 1 - and ℓ 2 -norms) provides a balance between the two properties. However, existing deterministic methods have high per iteration computational complexities, making them inapplicable to large-scale problems. To address this issue, this paper proposes the first accelerated stochastic variance reduction gradient (RASVRG) algorithm for robust subspace clustering. We also introduce a new momentum acceleration technique for the RASVRG algorithm. As a result of the involvement of this momentum, the RASVRG algorithm achieves both the best oracle complexity and the fastest convergence rate, and it reaches higher efficiency in practice for both strongly convex and not strongly convex models. Various experimental results show that the RASVRG algorithm outperformed existing state-of-the-art methods with elastic net and ℓ 1 -norm regularizers in terms of accuracy in most cases. As demonstrated on real-world face datasets with different manually added levels of pixel corruption and occlusion situations, the RASVRG algorithm achieved much better performance in terms of accuracy and robustness. [ABSTRACT FROM AUTHOR]

In this paper, a planning method based on the spatiotemporal variable-step-size A* algorithm is proposed to address the problem of safe trajectory planning for incremental, wheeled, mobile robots in complex motion scenarios with multiple robots. After constructing the known conditions, the spatiotemporal variable-step-size A* algorithm is first used to perform a collision-avoiding initial spatiotemporal trajectory search, and a variable time step is utilized to ensure that the robot completes the search at the target speed. Subsequently, the trajectory is instantiated using B-spline curves in a numerical optimization considering constraints to generate the final smooth trajectory. The results of simulation tests in a field-shaped, complex, dynamic scenario show that the proposed trajectory planning method is more applicable, and the results indicate higher efficiency compared to the traditional method in the incremental robot trajectory planning problem. [ABSTRACT FROM AUTHOR]

With the rapid development of the intelligent driving technology, achieving accurate path planning for unmanned vehicles has become increasingly crucial. However, path planning algorithms face challenges when dealing with complex and ever-changing road conditions. In this paper, aiming at improving the accuracy and robustness of the generated path, a global programming algorithm based on optimization is proposed, while maintaining the efficiency of the traditional A* algorithm. Firstly, turning penalty function and obstacle raster coefficient are integrated into the search cost function to increase the adaptability and directionality of the search path to the map. Secondly, an efficient search strategy is proposed to solve the problem that trajectories will pass through sparse obstacles while reducing spatial complexity. Thirdly, a redundant node elimination strategy based on discrete smoothing optimization effectively reduces the total length of control points and paths, and greatly reduces the difficulty of subsequent trajectory optimization. Finally, the simulation results, based on real map rasterization, highlight the advanced performance of the path planning and the comparison among the baselines and the proposed strategy showcases that the optimized A* algorithm significantly enhances the security and rationality of the planned path. Notably, it reduces the number of traversed nodes by 84%, the total turning angle by 39%, and shortens the overall path length to a certain extent. [ABSTRACT FROM AUTHOR]

Underwater mobile acoustic source target localization encounters several challenges, including the unknown propagation speed of the source signal, uncertainty in the observation platform's position and velocity (i.e., platform systematic errors), and economic costs. This paper proposes a new two-step closed-form localization algorithm that jointly estimates the angle of arrival (AOA), time difference of arrival (TDOA), and frequency difference of arrival (FDOA) to address these challenges. The algorithm initially introduces auxiliary variables to construct pseudo-linear equations to obtain the initial solution. It then exploits the relationship between the unknown and auxiliary variables to derive the exact solution comprising solely the unknown variables. Both theoretical analyses and simulation experiments demonstrate that the proposed method accurately estimates the position, velocity, and speed of the sound source even with an unknown sound speed and platform systematic errors. It achieves asymptotic optimality within a reasonable error range to approach the Cramér–Rao lower bound (CRLB). Furthermore, the algorithm exhibits low complexity, reduces the number of required localization platforms, and decreases the economic costs. Additionally, the simulation experiments validate the effectiveness of the proposed localization method across various scenarios, outperforming other comparative algorithms. [ABSTRACT FROM AUTHOR]

Unmanned Aerial Vehicle (UAV) infrared detection has problems such as weak and small targets, complex backgrounds, and poor real-time detection performance. It is difficult for general target detection algorithms to achieve the requirements of a high detection rate, low missed detection rate, and high real-time performance. In order to solve these problems, this paper proposes an improved small target detection method based on Picodet. First, to address the problem of poor real-time performance, an improved lightweight LCNet network was introduced as the backbone network for feature extraction. Secondly, in order to solve the problems of high false detection rate and missed detection rate due to weak targets, the Squeeze-and-Excitation module was added and the feature pyramid structure was improved. Experimental results obtained on the HIT-UAV public dataset show that the improved detection model's real-time frame rate increased by 31 fps and the average accuracy (MAP) increased by 7%, which proves the effectiveness of this method for UAV infrared small target detection. [ABSTRACT FROM AUTHOR]

Autonomous mobile robots are essential to the industry, and human–robot interactions are becoming more common nowadays. These interactions require that the robots navigate scenarios with static and dynamic obstacles in a safely manner, avoiding collisions. This paper presents a physical implementation of a method for dynamic obstacle avoidance using a long short-term memory (LSTM) neural network that obtains information from the mobile robot's LiDAR for it to be capable of navigating through scenarios with static and dynamic obstacles while avoiding collisions and reaching its goal. The model is implemented using a TurtleBot3 mobile robot within an OptiTrack motion capture (MoCap) system for obtaining its position at any given time. The user operates the robot through these scenarios, recording its LiDAR readings, target point, position inside the MoCap system, and its linear and angular velocities, all of which serve as the input for the LSTM network. The model is trained on data from multiple user-operated trajectories across five different scenarios, outputting the linear and angular velocities for the mobile robot. Physical experiments prove that the model is successful in allowing the mobile robot to reach the target point in each scenario while avoiding the dynamic obstacle, with a validation accuracy of 98.02%. [ABSTRACT FROM AUTHOR]

Sub-Nyquist synthetic aperture radar (SAR) based on pseudo-random time–space modulation has been proposed to increase the swath width while preserving the azimuthal resolution. Due to the sub-Nyquist sampling, the scene can be recovered by an optimization-based algorithm. However, these methods suffer from some issues, e.g., manually tuning difficulty and the pre-definition of optimization parameters, and a low signal–noise ratio (SNR) resistance. To address these issues, a reweighted optimization algorithm, named pseudo-ℒ0-norm optimization algorithm, is proposed for the sub-Nyquist SAR system in this paper. A modified regularization model is first built by applying the scene prior information to nearly acquire the number of nonzero elements based on Bayesian estimation, and then this model is solved by the Cauchy–Newton method. Additionally, an error correction method combined with our proposed pseudo-ℒ0-norm optimization algorithm is also present to eliminate defocusing in the motion-induced model. Finally, experiments with simulated signals and strip-map TerraSAR-X images are carried out to demonstrate the effectiveness and superiority of our proposed algorithm. [ABSTRACT FROM AUTHOR]

Delay-sensitive task offloading in a device-to-device assisted mobile edge computing (D2D-MEC) system with energy harvesting devices is a critical challenge due to the dynamic load level at edge nodes and the variability in harvested energy. In this paper, we propose a joint dynamic task offloading and CPU frequency control scheme for delay-sensitive tasks in a D2D-MEC system, taking into account the intricacies of multi-slot tasks, characterized by diverse processing speeds and data transmission rates. Our methodology involves meticulous modeling of task arrival and service processes using queuing systems, coupled with the strategic utilization of D2D communication to alleviate edge server load and prevent network congestion effectively. Central to our solution is the formulation of average task delay optimization as a challenging nonlinear integer programming problem, requiring intelligent decision making regarding task offloading for each generated task at active mobile devices and CPU frequency adjustments at discrete time slots. To navigate the intricate landscape of the extensive discrete action space, we design an efficient multi-agent DRL learning algorithm named MAOC, which is based on MAPPO, to minimize the average task delay by dynamically determining task-offloading decisions and CPU frequencies. MAOC operates within a centralized training with decentralized execution (CTDE) framework, empowering individual mobile devices to make decisions autonomously based on their unique system states. Experimental results demonstrate its swift convergence and operational efficiency, and it outperforms other baseline algorithms. [ABSTRACT FROM AUTHOR]

High-quality eye-tracking data are crucial in behavioral sciences and medicine. Even with a solid understanding of the literature, selecting the most suitable algorithm for a specific research project poses a challenge. Empowering applied researchers to choose the best-fitting detector for their research needs is the primary contribution of this paper. We developed a framework to systematically assess and compare the effectiveness of 13 state-of-the-art algorithms through a unified application interface. Hence, we more than double the number of algorithms that are currently usable within a single software package and allow researchers to identify the best-suited algorithm for a given scientific setup. Our framework validation on retrospective data underscores its suitability for algorithm selection. Through a detailed and reproducible step-by-step workflow, we hope to contribute towards significantly improved data quality in scientific experiments. [ABSTRACT FROM AUTHOR]

The various applications of bearing-only sensor networks for detection and localization are becoming increasingly widespread and important. The array layout of the bearing-only sensor network seriously impacts the detection performance. This paper proposes a multi-strategy fusion improved adaptive mayfly algorithm (MIAMA) in a bearing-only sensor network to perform layout planning on the geometric configuration of the optimal detection. Firstly, the system model of a bearing-only sensor network was constructed, and the observability of the system was analyzed based on the Cramer–Rao Lower Bound and Fisher Information Matrix. Then, in view of the limitations of the traditional mayfly algorithm, which has a single initial population and no adaptability and poor global search capabilities, multi-strategy fusion improvements were carried out by introducing Tent chaos mapping, the adaptive inertia weight factor, and Random Opposition-based Learning. Finally, three simulation experiments were conducted. Through comparison with the Particle Swarm Optimization (PSO) algorithm, Mayfly Algorithm (MA), and Genetic Algorithm (GA), the effectiveness and superiority of the proposed MIAMA were validated. [ABSTRACT FROM AUTHOR]

Real-time acquisition of location information for agricultural robotic systems is a prerequisite for achieving high-precision intelligent navigation. This paper proposes a data filtering and combined positioning method, and establishes an active screening model. The dynamic and static positioning drift points of the carrier are eliminated or replaced, reducing the complexity of the original Global Navigation Satellite System (GNSS) output data in the positioning system. Compared with the traditional Kalman filter combined positioning method, the proposed active filtering–Kalman filter algorithm can reduce the maximum distance deviation of the carrier along a straight line from 0.145 m to 0.055 m and along a curve from 0.184 m to 0.0640 m. This study focuses on agricultural robot positioning technology, which has an important influence on the development of smart agriculture. [ABSTRACT FROM AUTHOR]

In on-street parking lots, it is very important to obtain the positions and license plate numbers of the vehicles for charging and management. Existing algorithms usually detect vehicles from an input image first, then localize their license plates, and finally recognize the license plate numbers. However, they are of high time and space complexity and cannot work if the vehicles or license plates are obscured. Therefore, this paper proposes an open-space vehicle positioning algorithm based on detection and tracking in video sequences. The work is as follows: (1) To reduce the time and space complexity, parallel detection of vehicles and license plates is carried out. Then, geometric matching is performed to accomplish the correspondences between them. (2) To track vehicles and license plates, this paper improves DeepSORT by combining with integrated voting based on the historical license plate library. (3) To accurately judge the vehicle behavior of entry or exit, a cumulative state detector is designed to increase the fault-tolerance of the proposed algorithm. The experimental results reveal that the proposed algorithm makes improvements in model parameters, inference speed, and tracking accuracy, demonstrating that it can be well applied to open-space vehicle positioning. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new path planning algorithm based on the probabilistic roadmaps method (PRM), in order to effectively solve the autonomous path planning of mobile robots in complex environments with multiple narrow channels. The improved PRM algorithm mainly improves the density and distribution of sampling points in the narrow channel, through a combination of the learning process of the PRM algorithm and the APF algorithm. We also shortened the required time and path length by optimizing the query process. The first key technology to improve the PRM algorithm involves optimizing the number and distribution of free points and collision-free lines in the free workspace. To ensure full visibility of the narrow channel, we extend the obstacles through the diagonal distance of the mobile robot while ignoring the safety distance. Considering the safety distance during movement, we re-classify the all sampling points obtained by the quasi-random sampling principle into three categories: free points, obstacle points, and adjacent points. Next, we transform obstacle points into the free points of the narrow channel by combining the APF algorithm and the characteristics of the narrow channel, increasing the density of sampling points in the narrow space. Then, we include potential energy judgment into the construction process of collision-free lines shortening the required time and reduce collisions with obstacles. Optimizing the query process of the PRM algorithm is the second key technology. To reduce the required time in the query process, we adapt the bidirectional A* algorithm to query these local paths and obtain an effective path to the target point. We also combine the path pruning technology with the potential energy function to obtain a short path without collisions. Finally, the experimental results demonstrate that the new PRM path planning technology can improve the density of free points in narrow spaces and achieve an optimized, collision-free path in complex environments with multiple narrow channels. [ABSTRACT FROM AUTHOR]

Sugarcane stem node identification is the core technology required for the intelligence and mechanization of the sugarcane industry. However, detecting stem nodes quickly and accurately is still a significant challenge. In this paper, in order to solve this problem, a new algorithm combining YOLOv3 and traditional methods of computer vision is proposed, which can improve the identification rate during automated cutting. First, the input image is preprocessed, during which affine transformation is used to correct the posture of the sugarcane and a rotation matrix is established to obtain the region of interest of the sugarcane. Then, a dataset is built to train the YOLOv3 network model and the position of the stem nodes is initially determined using the YOLOv3 model. Finally, the position of the stem nodes is further located accurately. In this step, a new gradient operator is proposed to extract the edge of the image after YOLOv3 recognition. Then, a local threshold determination method is proposed, which is used to binarize the image after edge extraction. Finally, a localization algorithm for stem nodes is designed to accurately determine the number and location of the stem nodes. The experimental results show that the precision rate, recall rate, and harmonic mean of the stem node recognition algorithm in this paper are 99.68%, 100%, and 99.84%, respectively. Compared to the YOLOv3 network, the precision rate and the harmonic mean are improved by 2.28% and 1.13%, respectively. Compared to other methods introduced in this paper, this algorithm has the highest recognition rate. [ABSTRACT FROM AUTHOR]

This paper proposes a deep reinforcement learning (DRL)-based algorithm in the path-tracking controller of an unmanned vehicle to autonomously learn the path-tracking capability of the vehicle by interacting with the CARLA environment. To solve the problem of the high estimation of the Q-value of the DDPG algorithm and slow training speed, the controller adopts the deep deterministic policy gradient algorithm of the double critic network (DCN-DDPG), obtains the trained model through offline learning, and sends control commands to the unmanned vehicle to make the vehicle drive according to the determined route. This method aimed to address the problem of unmanned-vehicle path tracking. This paper proposes a Markov decision process model, including the design of state, action-and-reward value functions, and trained the control strategy in the CARLA simulator Town04 urban scene. The tracking task was completed under various working conditions, and its tracking effect was compared with the original DDPG algorithm, model predictive control (MPC), and pure pursuit. It was verified that the designed control strategy has good environmental adaptability, speed adaptability, and tracking performance. [ABSTRACT FROM AUTHOR]

The traditional pointer instrument recognition scheme is implemented in three steps, which is cumbersome and inefficient. So it is difficult to apply to the industrial production of real-time monitoring. Based on the improvement of the CSL coding method and the setting of the pre-cache mechanism, an intelligent reading recognition technology of the YOLOv5 pointer instrument is proposed in this paper, which realizes the rapid positioning and reading recognition of the pointer instrument. The problem of angle interaction in rotating target detection is eliminated, the complexity of image preprocessing is avoided, and the problems of poor adaptability of Hough detection are solved in this strategy. The experimental results show that compared with the traditional algorithm, the algorithm in this paper can effectively identify the angle of the pointer instrument, has high detection efficiency and strong adaptability, and has broad application prospects. [ABSTRACT FROM AUTHOR]

To intercept the great maneuvering target, combining with the sliding mode and the extended disturbance observer, a new control algorithm for integrated guidance and control (IGC) system is proposed in this paper. Firstly, the paper formulates the Missile–Target problem. Then the paper establishes an uncertain IGC dynamic model where the nonlinearities, the perturbations and the maneuvering of the target are regarded as disturbance. Secondly, a second-order disturbance observer is designed to estimate the disturbance and their derivatives.. After this, combining with the second-order disturbance observer, a modified sliding surface and the corresponding reaching law are designed to obtain the rudder deflection command directly. Thus, the real sense of IGC system is achieved. Next, the paper uses the Lyapunov stability theory to prove the stability of the system. Finally, the paper provides different simulation cases, which have different maneuver modes of the target, to demonstrate the superiority of the proposed method in reducing the response time, increasing the rudder response, and having a high interception probability. [ABSTRACT FROM AUTHOR]

With the advent of the digital information age, new data services such as virtual reality, industrial Internet, and cloud computing have proliferated in recent years. As a result, it increases operator demand for 5G bearer networks by providing features such as high transmission capacity, ultra-long transmission distance, network slicing, and intelligent management and control. Software-defined networking, as a new network architecture, intends to increase network flexibility and agility and can better satisfy the demands of 5G networks for network slicing. Nevertheless, software-defined networking still faces the challenge of network intrusion. We propose an abnormal traffic detection method based on the stacking method and self-attention mechanism, which makes up for the shortcoming of the inability to track long-term dependencies between data samples in ensemble learning. Our method utilizes a self-attention mechanism and a convolutional network to automatically learn long-term associations between traffic samples and provide them to downstream tasks in sample embedding. In addition, we design a novel stacking ensemble method, which computes the sample embedding and the predicted values of the heterogeneous base learner through the fusion module to obtain the final outlier results. This paper conducts experiments on abnormal traffic datasets in the software-defined network environment, calculates precision, recall and F1-score, and compares and analyzes them with other algorithms. The experimental results show that the method designed in this paper achieves 0.9972, 0.9996, and 0.9984 in multiple indicators of precision, recall, and F1-score, respectively, which are better than the comparison methods. [ABSTRACT FROM AUTHOR]

The thermal imaging image of the Sustainable Development Science Satellite (SDGSAT-1) is mainly used for high-resolution observations of the ground width, due to the influence of blind elements and non-uniformity of the detector, and the system is a pendulum sweep imaging mode, resulting in fringed noise in the image. In this paper, a Fringing algorithm based on LRSID (low-rank-based single-image decomposition) algorithm is proposed, which can effectively remove the lateral and vertical fringe noise of the thermal imager and maintain the detail and clarity of the image. First, pretreatment of the obvious light and dark stripes then, based on LLSID algorithm, the vertical direction pinstripes and horizontal stripes are processed; finally, the fringed frequency band of the original image is replaced in the frequency domain with the image frequency domain processed by the LRSID algorithm, and then the Fourier inverse transformation is performed to obtain the final image. Using the method proposed in this paper, the simulated and actual SDGSAT-1 thermal imaging camera remote sensing stripes images are removed, and the visual and quantitative indicators are compared with the processing results of other algorithms, and the results show that the proposed algorithm has the best performance to remove the stripes, which can effectively remove horizontal and vertical fringes at the same time, and retain the detail and clarity of the image. [ABSTRACT FROM AUTHOR]

Multi-UAV systems have been widely used in reconnaissance, disaster relief, communication, and other fields. However, many dynamic events can cause a partial failure of the original mission during the mission execution process, in which case task reassignment should be carried out. How to reassign resources and tasks in multi-dynamic, multi-target, and multi-constraint events becomes a core issue in the enhancement of combat efficiency. This paper establishes a model of multi-UAV cooperative reconnaissance task reassignment that comprehensively considers various dynamic factors such as UAV performance differences, size of target areas, and time window constraints. Then, a two-stage distributed task assignment algorithm (TS-DTA) is presented to achieve multi-task reassignment in dynamic environments. Finally, this paper verifies the effectiveness of the TS-DTA algorithm through simulation experiments and analyzes its performance through comparative experiments. The experimental results show that the TS-DTA algorithm can efficiently solve the task reassignment problem in dynamic environments while effectively reducing the communication burden of UAV formations. [ABSTRACT FROM AUTHOR]

Because of its long running time, complex working environment, and for other reasons, a gear is prone to failure, and early failure is difficult to detect by direct observation; therefore, fault diagnosis of gears is very necessary. Neural network algorithms have been widely used to realize gear fault diagnosis, but the structure of the neural network model is complicated, the training time is long and the model is not easy to converge. To solve the above problems and combine the advantages of the ResNeXt50 model in the extraction of image features, this paper proposes a gearbox fault detection method that integrates the convolutional block attention module (CBAM). Firstly, the CBAM is embedded in the ResNeXt50 network to enhance the extraction of image channels and spatial features. Secondly, the different time–frequency analysis method was compared and analyzed, and the method with the better effect was selected to convert the one-dimensional vibration signal in the open data set of the gearbox into a two-dimensional image, eliminating the influence of the redundant background noise, and took it as the input of the model for training. Finally, the accuracy and the average training time of the model were obtained by entering the test set into the model, and the results were compared with four other classical convolutional neural network models. The results show that the proposed method performs well both in fault identification accuracy and average training time under two working conditions, and it also provides some references for existing gear failure diagnosis research. [ABSTRACT FROM AUTHOR]

Mobile sensors can extend the range of monitoring and overcome static sensors' limitations and are increasingly used in real-life applications. Since there can be significant errors in mobile sensor localization using the Monte Carlo Localization (MCL), this paper improves the food digestion algorithm (FDA). This paper applies the improved algorithm to the mobile sensor localization problem to reduce localization errors and improve localization accuracy. Firstly, this paper proposes three inter-group communication strategies to speed up the convergence of the algorithm based on the topology that exists between groups. Finally, the improved algorithm is applied to the mobile sensor localization problem, reducing the localization error and achieving good localization results. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet of Things (IoT), the frequency of attackers using botnets to control IoT devices in order to perform distributed denial-of-service attacks (DDoS) and other cyber attacks on the internet has significantly increased. In the actual attack process, the small percentage of attack packets in IoT leads to low accuracy of intrusion detection. Based on this problem, the paper proposes an oversampling algorithm, KG-SMOTE, based on Gaussian distribution and K-means clustering, which inserts synthetic samples through Gaussian probability distribution, extends the clustering nodes in minority class samples in the same proportion, increases the density of minority class samples, and improves the amount of minority class sample data in order to provide data support for IoT-based DDoS attack detection. Experiments show that the balanced dataset generated by this method effectively improves the intrusion detection accuracy in each category and effectively solves the data imbalance problem. [ABSTRACT FROM AUTHOR]

Efficient routing is essential for the proper functioning of wireless sensor networks (WSNs). Recent research has focused on optimizing energy and delay for these networks. Nevertheless, there is a dearth of studies that have examined the effects of volatile settings, such as chemical plants, coal mines, nuclear power plants, and battlefields, where connectivity is inconsistent. In such contexts, sensor networks may face security incidents, and environmental factors such as node movement and death can result in dynamic changes to the network topology. A novel design algorithm grounded on Dynamic Minimum Hop Selection (DMHS) was introduced in this paper. The key principle behind DMHS is to use a probabilistic forwarding decision-making process through a distributed route discovery strategy that utilizes dynamically adjusted minimum hop counts of nodes. Simulation results indicate that the life cycle of the DMHS algorithm increases by more than 12% over 700 nodes when compared to the traditional energy-saving algorithm. Furthermore, our algorithm performs better in the average delivery rate of node, and has a 10% to 21% improvement compared to the other algorithms. Overall, the DMHS algorithm represents an important contribution to the development of WSNs that can function robustly in high-risk and unstable environments. [ABSTRACT FROM AUTHOR]

Capsule endoscopy (CE) is a widely used medical imaging tool for the diagnosis of gastrointestinal tract abnormalities like bleeding. However, CE captures a huge number of image frames, constituting a time-consuming and tedious task for medical experts to manually inspect. To address this issue, researchers have focused on computer-aided bleeding detection systems to automatically identify bleeding in real time. This paper presents a systematic review of the available state-of-the-art computer-aided bleeding detection algorithms for capsule endoscopy. The review was carried out by searching five different repositories (Scopus, PubMed, IEEE Xplore, ACM Digital Library, and ScienceDirect) for all original publications on computer-aided bleeding detection published between 2001 and 2023. The Preferred Reporting Items for Systematic Review and Meta-Analyses (PRISMA) methodology was used to perform the review, and 147 full texts of scientific papers were reviewed. The contributions of this paper are: (I) a taxonomy for computer-aided bleeding detection algorithms for capsule endoscopy is identified; (II) the available state-of-the-art computer-aided bleeding detection algorithms, including various color spaces (RGB, HSV, etc.), feature extraction techniques, and classifiers, are discussed; and (III) the most effective algorithms for practical use are identified. Finally, the paper is concluded by providing future direction for computer-aided bleeding detection research. [ABSTRACT FROM AUTHOR]

Spherical robots have fully wrapped shells, which enables them to walk well on complex terrains, such as swamps, grasslands and deserts. At present, path planning algorithms for spherical robots mainly focus on finding the shortest path between the initial position and the target position. In this paper, an improved A* algorithm considering energy consumption is proposed for the path planning of spherical robots. The optimization objective of this algorithm is to minimize both the energy consumption and path length of a spherical robot. A heuristic function constructed with the energy consumption estimation model (ECEM) and the distance estimation model (DEM) is used to determine the path cost of the A* algorithm. ECEM and DCM are established based on the force analysis of the spherical robot and the improved Euclidean distance of the grid map, respectively. The effectiveness of the proposed algorithm is verified by simulation analysis based on a 3D grid map and a spherical robot moving with uniform velocity. The results show that compared with traditional path planning algorithms, the proposed algorithm can minimize the energy consumption and path length of the spherical robot as much as possible. [ABSTRACT FROM AUTHOR]

Long-staple cotton from Xinjiang is renowned for its exceptional quality. However, it is susceptible to contamination with plastic film during mechanical picking. To address the issue of tricky removal of film in seed cotton, a technique based on hyperspectral images and AlexNet-PCA is proposed to identify the colorless and transparent film of the seed cotton. The method consists of black and white correction of hyperspectral images, dimensionality reduction of hyperspectral data, and training and testing of convolutional neural network (CNN) models. The key technique is to find the optimal way to reduce the dimensionality of the hyperspectral data, thus reducing the computational cost. The biggest innovation of the paper is the combination of CNNs and dimensionality reduction methods to achieve high-precision intelligent recognition of transparent plastic films. Experiments with three dimensionality reduction methods and three CNN architectures are conducted to seek the optimal model for plastic film recognition. The results demonstrate that AlexNet-PCA-12 achieves the highest recognition accuracy and cost performance in dimensionality reduction. In the practical application sorting tests, the method proposed in this paper achieved a 97.02% removal rate of plastic film, which provides a modern theoretical model and effective method for high-precision identification of heteropolymers in seed cotton. [ABSTRACT FROM AUTHOR]

The low light conditions, abundant dust, and rocky terrain on the lunar surface pose challenges for scientific research. To effectively perceive the surrounding environment, lunar rovers are equipped with binocular cameras. In this paper, with the aim of accurately detect obstacles on the lunar surface under complex conditions, an Improved Semi-Global Matching (I-SGM) algorithm for the binocular cameras is proposed. The proposed method first carries out a cost calculation based on the improved Census transform and an adaptive window based on a connected component. Then, cost aggregation is performed using cross-based cost aggregation in the AD-Census algorithm and the initial disparity of the image is calculated via the Winner-Takes-All (WTA) strategy. Finally, disparity optimization is performed using left–right consistency detection and disparity padding. Utilizing standard test image pairs provided by the Middleburry website, the results of the test reveal that the algorithm can effectively improve the matching accuracy of the SGM algorithm, while reducing the running time of the program and enhancing noise immunity. Furthermore, when applying the I-SGM algorithm to the simulated lunar environment, the results show that the I-SGM algorithm is applicable in dim conditions on the lunar surface and can better help a lunar rover to detect obstacles during its travel. [ABSTRACT FROM AUTHOR]

Due to the challenges of small detection targets, dense target distribution, and complex backgrounds in aerial images, existing object detection algorithms perform poorly in aerial image detection tasks. To address these issues, this paper proposes an improved algorithm called YOLOv5s-DSD based on YOLOv5s. Specifically, the SPDA-C3 structure is proposed and used to reduce information loss while focusing on useful features, effectively tackling the challenges of small detection targets and complex backgrounds. The novel decoupled head structure, Res-DHead, is introduced, along with an additional small object detection head, further improving the network's performance in detecting small objects. The original NMS is replaced by Soft-NMS-CIOU to address the issue of neighboring box suppression caused by dense object distribution. Finally, extensive ablation experiments and comparative tests are conducted on the VisDrone2019 dataset, and the results demonstrate that YOLOv5s-DSD outperforms current state-of-the-art object detection models in aerial image detection tasks. The proposed improved algorithm achieves a significant improvement compared with the original algorithm, with an increase of 17.4% in mAP@0.5 and 16.4% in mAP@0.5:0.95, validating the superiority of the proposed improvements. [ABSTRACT FROM AUTHOR]

The diverse application vertices of internet-of-things (IoT) including internet of vehicles (IoV), industrial IoT (IIoT) and internet of drones things (IoDT) involve intelligent communication between the massive number of objects around us. This digital transformation strives for seamless data flow, uninterrupted communication capabilities, low latency and ultra-high reliability. The limited capabilities of fifth generation (5G) technology have given way to sixth generation (6G) wireless technology. This paper presents a dynamic cell-free framework for a 6G-enabled IoT network. A number of access points (APs) are distributed over a given geographical area to serve a large number of user nodes. A pilot-based AP selection (PBAS) algorithm is proposed, which offers robust resource control through AP selection based on pilots. Selecting a subset of APs against all APs for each user node results in improved performance. In this paper, the performance of the proposed transmission model is evaluated for the achieved data rate and spectral efficiency using the proposed algorithm. It is shown that the proposed PBAS algorithm improves the spectral efficiency by 22 % at the cell-edge and 1.5 % at the cell-center. A comparison of the different combining techniques used at different user locations is also provided, along with the mathematical formulations. Finally, the proposed model is compared with two other transmission models for performance evaluation. It is observed that the spectral efficiency achieved by an edge node with the proposed scheme is 5.3676 bits/s/Hz, compared to 0.756 bits/s/Hz and 1.0501 bits/s/Hz, attained with transmission schemes 1 and 2, respectively. [ABSTRACT FROM AUTHOR]

Convolutional neural networks have achieved good results in target detection in many application scenarios, but convolutional neural networks still face great challenges when facing scenarios with small target sizes and complex background environments. To solve the problem of low accuracy of infrared weak target detection in complex scenes, and considering the real-time requirements of the detection task, we choose the YOLOv5s target detection algorithm for improvement. We add the Bottleneck Transformer structure and CoordConv to the network to optimize the model parameters and improve the performance of the detection network. Meanwhile, a two-dimensional Gaussian distribution is used to describe the importance of pixel points in the target frame, and the normalized Guassian Wasserstein distance (NWD) is used to measure the similarity between the prediction frame and the true frame to characterize the loss function of weak targets, which will help highlight the targets with flat positional deviation transformation and improve the detection accuracy. Finally, through experimental verification, compared with other mainstream detection algorithms, the improved algorithm in this paper significantly improves the target detection accuracy, with the mAP reaching 96.7 percent, which is 2.2 percentage points higher compared with Yolov5s. [ABSTRACT FROM AUTHOR]

With the development of ocean exploration technology, the exploration of the ocean has become a hot research field involving the use of autonomous underwater vehicles (AUVs). In complex underwater environments, the fast, safe, and smooth arrival of target points is key for AUVs to conduct underwater exploration missions. Most path-planning algorithms combine deep reinforcement learning (DRL) and path-planning algorithms to achieve obstacle avoidance and path shortening. In this paper, we propose a method to improve the local minimum in the artificial potential field (APF) to make AUVs out of the local minimum by constructing a traction force. The improved artificial potential field (IAPF) method is combined with DRL for path planning while optimizing the reward function in the DRL algorithm and using the generated path to optimize the future path. By comparing our results with the experimental data of various algorithms, we found that the proposed method has positive effects and advantages in path planning. It is an efficient and safe path-planning method with obvious potential in underwater navigation devices. [ABSTRACT FROM AUTHOR]

The quality of rolling bearings is vital for the working state and rotation accuracy of the shaft. Timely and accurately acquiring bearing status and early fault diagnosis can effectively prevent losses, making it highly practical. To improve the accuracy of bearing fault diagnosis, this paper proposes a CNN-LSTM bearing fault diagnosis model optimized by hybrid particle swarm optimization (HPSO). The HPSO algorithm has a strong global optimization ability and can effectively solve nonlinear and multivariate optimization problems. It is used to optimize and match the parameters of the CNN-LSTM model and dynamically find the optimal value of the parameters. This model overcomes the problem that the parameters of the CNN-LSTM model depend on empirical settings and cannot be adjusted dynamically. This model is used for bearing fault diagnosis, and the accuracy rate of fault diagnosis classification reaches 99.2%. Compared with the traditional CNN, LSTM, and CNN-LSTM models, the accuracy rates are increased by 6.6%, 9.2%, and 5%, respectively. At the same time, comparing the models with different optimization parameters shows that the model proposed in this paper has the highest accuracy. The experimental results verified the superiority of the HPSO algorithm to optimize model parameters and the feasibility and accuracy of the HPSO-CNN-LSTM model for bearing fault diagnosis. [ABSTRACT FROM AUTHOR]

Real-time fault detection in power distribution networks has become a popular issue in current power systems. However, the low power and computational capabilities of edge devices often fail to meet the requirements of real-time detection. To overcome these challenges, this paper proposes a lightweight algorithm, named Comprehensive-YOLOv5, for identifying defects in distribution networks. The proposed method focuses on achieving rapid localization and accurate identification of three common defects: insulator without loop, cable detachment from the insulator, and cable detachment from the spacer. Based on the You Only Look Once version 5 (YOLOv5) algorithm, this paper adopts GhostNet to reconstruct the original backbone of YOLOv5; introduces Bidirectional Feature Pyramid Network (BiFPN) structure to replace Path Aggregation Network (PANet) for feature fusion, which enhances the feature fusion ability; and replaces Generalized Intersection over Union GIOU with Focal Extended Intersection over Union (Focal-EIOU) to optimize the loss function, which improves the mean average precision and speed of the algorithm. The effectiveness of the improved Comprehensive-YOLOv5 algorithm is verified through a "morphological experiment", while an "algorithm comparison experiment" confirms its superiority over other algorithms. Compared with the original YOLOv5, the Comprehensive-YOLOv5 algorithm improves mean average precision (mAP) from 88.3% to 90.1% and increases Frames per second (FPS) from 20 to 52 frames. This improvement significantly reduces false positives and false negatives in defect detection. Consequently, the proposed algorithm enhances detection speed and improves inspection efficiency, providing a viable solution for real-time detection and deployment at the edge of power distribution networks. [ABSTRACT FROM AUTHOR]

The casting process involves pouring molten metal into a mold cavity. Currently, traditional object detection algorithms exhibit a low accuracy and are rarely used. An object detection model based on deep learning requires a large amount of memory and poses challenges in the deployment and resource allocation for resource limited pouring robots. To address the accurate identification and localization of pouring holes with limited resources, this paper designs a lightweight pouring robot hole detection algorithm named LPO-YOLOv5s, based on YOLOv5s. First, the MobileNetv3 network is introduced as a feature extraction network, to reduce model complexity and the number of parameters. Second, a depthwise separable information fusion module (DSIFM) is designed, and a lightweight operator called CARAFE is employed for feature upsampling, to enhance the feature extraction capability of the network. Finally, a dynamic head (DyHead) is adopted during the network prediction stage, to improve the detection performance. Extensive experiments were conducted on a pouring hole dataset, to evaluate the proposed method. Compared to YOLOv5s, our LPO-YOLOv5s algorithm reduces the parameter size by 45% and decreases computational costs by 55%, while sacrificing only 0.1% of mean average precision (mAP). The model size is only 7.74 MB, fulfilling the deployment requirements for pouring robots. [ABSTRACT FROM AUTHOR]

Smart security based on object detection is one of the important applications of edge computing in IoT. Anchors in object detection refer to points on the feature map, which can be used to generate anchor boxes and serve as training samples. Current object detection models do not consider the aspect ratio of the ground-truth boxes in anchor assignment and are not well-adapted to objects with very different shapes. Therefore, this paper proposes the Lightweight Anchor Dynamic Assignment algorithm (LADA) for object detection. LADA does not change the structure of the original detection model; first, it selects an equal proportional center region based on the aspect ratio of the ground-truth box, then calculates the combined loss of anchors, and finally divides the positive and negative samples more efficiently by dynamic loss threshold without additional models. The algorithm solves the problems of poor adaptability and difficulty in the selection of the best positive samples based on IoU assignment, and the sample assignment for eccentric objects and objects with different aspect ratios was more reasonable. Compared with existing sample assignment algorithms, the LADA algorithm outperforms the MS COCO dataset by 1.66% over the AP of the baseline FCOS, and 0.76% and 0.24% over the AP of the ATSS algorithm and the PAA algorithm, respectively, with the same model structure, which demonstrates the effectiveness of the LADA algorithm. [ABSTRACT FROM AUTHOR]

The paper proposes a topology-free specification of distributed control systems by means of a process-oriented programming paradigm. The proposed approach was characterized, on the one hand, by a topologically independent specification of the control algorithm and, on the other hand, by the possibility of using existing formal verification methods by preserving the semantics of a centralized process-oriented program. The paper discusses the advantages of a topologically independent specification of distributed control systems, outlines the features of control software, argues why the use of a process-oriented approach to the development of the automation of cyber-physical systems is suitable for solving these problems, describes a general scheme for implementing a distributed control system according to a process-oriented specification, and proposes a formal heuristic algorithm for partitioning a sequential process-oriented program into independent clusters. We illustrate our algorithm with bottle-filling and sluice case studies. [ABSTRACT FROM AUTHOR]

Most deep-learning-based object detection algorithms exhibit low speeds and accuracy in gear surface defect detection due to their high computational costs and complex structures. To solve this problem, a lightweight model for gear surface defect detection, namely STMS-YOLOv5, is proposed in this paper. Firstly, the ShuffleNetv2 module is employed as the backbone to reduce the giga floating-point operations per second and the number of parameters. Secondly, transposed convolution upsampling is used to enhance the learning capability of the network. Thirdly, the max efficient channel attention mechanism is embedded in the neck to compensate for the accuracy loss caused by the lightweight backbone. Finally, the SIOU_Loss is adopted as the bounding box regression loss function in the prediction part to speed up the model convergence. Experiments show that STMS-YOLOv5 achieves frames per second of 130.4 and 133.5 on the gear and NEU-DET steel surface defect datasets, respectively. The number of parameters and GFLOPs are reduced by 44.4% and 50.31%, respectively, while the mAP@0.5 reaches 98.6% and 73.5%, respectively. Extensive ablation and comparative experiments validate the effectiveness and generalization capability of the model in industrial defect detection. [ABSTRACT FROM AUTHOR]

FAGV is a kind of heavy equipment in the storage environment. Its path needs to be simple and smooth and should be able to avoid sudden obstacles in the process of driving. According to the environmental characteristics of intelligent storage and the task requirements of FAGV, this paper proposed a hybrid dynamic path planning algorithm for FAGV based on improved A* and improved DWA. The improved A* algorithm can plan the global optimal path more suitable for FAGV. The improved evaluation function of DWA can ensure that the local path of FAGV is closer to the global path. DWA combines the rolling window method for local path planning to avoid sudden unknown static and dynamic obstacles. In addition, this paper verifies the effectiveness of the algorithm through simulation. The simulation results show that the algorithm can avoid obstacles dynamically without being far away from the global optimal path. [ABSTRACT FROM AUTHOR]

This paper presents a real-time object-based 3D change detection method that is built around the concept of semantic object maps. The algorithm is able to maintain an object-oriented metric-semantic map of the environment and can detect object-level changes between consecutive patrol routes. The proposed 3D change detection method exploits the capabilities of the novel ZED 2 stereo camera, which integrates stereo vision and artificial intelligence (AI) to enable the development of spatial AI applications. To design the change detection algorithm and set its parameters, an extensive evaluation of the ZED 2 camera was carried out with respect to depth accuracy and consistency, visual tracking and relocalization accuracy and object detection performance. The outcomes of these findings are reported in the paper. Moreover, the utility of the proposed object-based 3D change detection is shown in real-world indoor and outdoor experiments. [ABSTRACT FROM AUTHOR]

The traditional satellite access selection algorithm, which is used in large-scale satellite networks, has some disadvantages, such as frequent link switching, high interrupt probability, and unable to adapt to a dynamic environment. According to the periodicity of the large-scale satellite network and the prior knowledge provided by acknowledgment packages, a dynamic domain-based adaptive access algorithm (DAA) is proposed in this paper. Firstly, this algorithm divides the large-scale satellite network into different domains according to the minimum elevation angle of the Earth station (ES) and the predictable characteristics of the trajectory of the satellite. Then, the ES selects the access satellites according to the relationship between the traffic volume and the satellites' coverage time. Finally, the ES selects the backup access satellite based on the satellites' coverage time, the traffic volume of the ES, satellite status provided by prior knowledge, and other information. When the access satellite cannot satisfy the communication demand, the ES adaptively switches the earth-satellite link to the backup access satellite. The ES first choice of access satellite does not require interaction with the satellites, reducing the consumption of communication resources. The selection strategy of backup access satellite and the concept of virtual destination address proposed in this paper can reduce the routing overhead after switching. Through theoretical analysis and simulation results in the StarLink constellation, it is proved that this paper improves the coverage time utilization of accessing satellites and reduces the switching probability compared with the traditional access algorithm, which is more suitable for ES to access large-scale satellite networks. [ABSTRACT FROM AUTHOR]

With the increasingly widespread application of UAV intelligence, the need for autonomous navigation and positioning is becoming more and more important. To solve the problem that UAV cannot perform localization in complex scenes, a new multi-source fusion framework factor graph optimization algorithm is used for UAV localization state estimation in this paper, which is based on IMU/GNSS/VO multi-source sensors. Based on the factor graph model and the iSAM incremental inference algorithm, a multi-source fusion model of IMU/GNSS/VO is established, including the IMU pre-integration factor, IMU bias factor, GNSS factor, and VO factor. Mathematical simulations and validations on the EuRoC dataset show that, when the selected sliding window size is 30, the factor graph optimization (FGO) algorithm can not only meet the requirements of real time and accuracy at the same time, but it also achieves a plug-and-play function in the event of local sensor failures. Finally, compared with the traditional federated Kalman algorithm and the adaptive federated Kalman algorithm, the positioning accuracy of the FGO algorithm in this paper is improved by 1.5–2-fold, and can effectively improve autonomous navigation system robustness and flexibility in complex scenarios. Moreover, the multi-source fusion framework in this paper is a general algorithm framework that can satisfy other scenarios and other types of sensor combinations. [ABSTRACT FROM AUTHOR]

It is an urgent problem to know how to quickly and accurately measure the length of irregular curves in complex background images. To solve the problem, we first proposed a quasi-bimodal threshold segmentation (QBTS) algorithm, which transforms the multimodal histogram into a quasi-bimodal histogram to achieve a faster and more accurate segmentation of the target curve. Then, we proposed a single-pixel skeleton length measurement (SPSLM) algorithm based on the 8-neighborhood model, which used the 8-neighborhood feature to measure the length for the first time, and achieved a more accurate measurement of the curve length. Finally, the two algorithms were tested and analyzed in terms of accuracy and speed on the two original datasets of this paper. The experimental results show that the algorithms proposed in this paper can quickly and accurately segment the target curve from the neon design rendering with complex background interference and measure its length. [ABSTRACT FROM AUTHOR]

Quantitatively and accurately monitoring the damage to composites is critical for estimating the remaining life of structures and determining whether maintenance is essential. This paper proposed an active sensing method for damage localization and quantification in composite plates. The probabilistic imaging algorithm and the statistical method were introduced to reduce the impact of composite anisotropy on the accuracy of damage detection. The matching pursuit decomposition (MPD) algorithm was utilized to extract the precise TOF for damage detection. The damage localization was realized by comprehensively evaluating the damage probability evaluation results of all sensing paths in the monitoring area. Meanwhile, the scattering source was recognized on the elliptical trajectory obtained through the TOF of each sensing path to estimate the damage size. Damage size was characterized by the Gaussian kernel probability density distribution of scattering sources. The algorithm was validated by through-thickness hole damages of various locations and sizes in composite plates. The experimental results demonstrated that the localization and quantification absolute error are within 11 mm and 2.2 mm, respectively, with a sensor spacing of 100 mm. The algorithm proposed in this paper can accurately locate and quantify damage in composite plate-like structures. [ABSTRACT FROM AUTHOR]

In the present study, we used a transformer model and a fusion of biosignals to estimate rotational acceleration in elbow and shoulder joints. To achieve our study objectives, we proposed a mechanomyography (MMG) signal isolation technique based on a variational mode decomposition (VMD) algorithm. Our results show that the VMD algorithm delivered excellent performance in MMG signal extraction compared to the commonly used technique of empirical mode decomposition (EMD). In addition, we found that transformer models delivered estimates of joint acceleration that were more precise than those produced by mainstream time series forecasting models. The average R2 values of transformer are 0.967, 0.968, and 0.935, respectively. Finally, we found that using a fusion of signals resulted in more precise estimation performance compared to using MMG signals alone. The differences between the average R2 values are 0.041, 0.053, and 0.043, respectively. Taken together, the VMD isolation method, the transformer algorithm and the signal fusion technique described in this paper can be seen as supplying a robust framework for estimating rotational acceleration in upper-limb joints. Further study is warranted to examine the effectiveness of this framework in other musculoskeletal contexts. [ABSTRACT FROM AUTHOR]

Roads are the fundamental elements of transportation, connecting cities and rural areas, as well as people's lives and work. They play a significant role in various areas such as map updates, economic development, tourism, and disaster management. The automatic extraction of road features from high-resolution remote sensing images has always been a hot and challenging topic in the field of remote sensing, and deep learning network models are widely used to extract roads from remote sensing images in recent years. In light of this, this paper systematically reviews and summarizes the deep-learning-based techniques for automatic road extraction from high-resolution remote sensing images. It reviews the application of deep learning network models in road extraction tasks and classifies these models into fully supervised learning, semi-supervised learning, and weakly supervised learning based on their use of labels. Finally, a summary and outlook of the current development of deep learning techniques in road extraction are provided. [ABSTRACT FROM AUTHOR]