Search

In this paper, a structural health monitoring (SHM) system is proposed to provide automatic early warning for detecting damage and its location in composite pipelines at an early stage. The study considers a basalt fiber reinforced polymer (BFRP) pipeline with an embedded Fiber Bragg grating (FBG) sensory system and first discusses the shortcomings and challenges with incorporating FBG sensors for accurate detection of damage information in pipelines. The novelty and the main focus of this study is, however, a proposed approach that relies on designing an integrated sensing-diagnostic SHM system that has the capability to detect damage in composite pipelines at an early stage via implementation of an artificial intelligence (AI)-based algorithm combining deep learning and other efficient machine learning methods using an Enhanced Convolutional Neural Network (ECNN) without retraining the model. The proposed architecture replaces the softmax layer by a k-Nearest Neighbor (k-NN) algorithm for inference. Finite element models are developed and calibrated by the results of pipe measurements under damage tests. The models are then used to assess the patterns of the strain distributions of the pipeline under internal pressure loading and under pressure changes due to bursts, and to find the relationship of strains at different locations axially and circumferentially. A prediction algorithm for pipe damage mechanisms using distributed strain patterns is also developed. The ECNN is designed and trained to identify the condition of pipe deterioration so the initiation of damage can be detected. The strain results from the current method and the available experimental results in the literature show excellent agreement. The average error between the ECNN data and FBG sensor data is 0.093%, thus confirming the reliability and accuracy of the proposed method. The proposed ECNN achieves high performance with 93.33 % accuracy (P%), 91.18 % regression rate (R%) and a 90.54 % F1-score (F%). [ABSTRACT FROM AUTHOR]

Traffic sign detection is an important part of environment-aware technology and has great potential in the field of intelligent transportation. In recent years, deep learning has been widely used in the field of traffic sign detection, achieving excellent performance. Due to the complex traffic environment, recognizing and detecting traffic signs is still a challenging project. In this paper, a model with global feature extraction capabilities and a multi-branch lightweight detection head is proposed to increase the detection accuracy of small traffic signs. First, a global feature extraction module is proposed to enhance the ability of extracting features and capturing the correlation within the features through self-attention mechanism. Second, a new, lightweight parallel decoupled detection head is proposed to suppress redundant features and separate the output of the regression task from the classification task. Finally, we employ a series of data enhancements to enrich the context of the dataset and improve the robustness of the network. We conducted a large number of experiments to verify the effectiveness of the proposed algorithm. The accuracy of the proposed algorithm is 86.3%, the recall is 82.1%, the mAP@0.5 is 86.5% and the mAP@0.5:0.95 is 65.6% in TT100K dataset, while the number of frames transmitted per second is stable at 73, which meets the requirement of real-time detection. [ABSTRACT FROM AUTHOR]

The current popular one-shot multi-object tracking (MOT) algorithms are dominated by the joint detection and embedding paradigm, which have high inference speeds and accuracy, but their tracking performance is unstable in crowded scenes. Not only does the detection branch have difficulty in obtaining the accurate object position, but the ambiguous appearance of features extracted by the re-identification (re-ID) branch also leads to identity switches. Focusing on the above problems, this paper proposes a more robust MOT algorithm, named CSMOT, based on FairMOT. First, on the basis of the encoder–decoder network, a coordinate attention module is designed to enhance the information interaction between channels (horizontal and vertical coordinates), which improves its object-detection abilities. Then, an angle-center loss that effectively maximizes intra-class similarity is proposed to optimize the re-ID branch, and the extracted re-ID features are made more discriminative. We further redesign the re-ID feature dimension to balance the detection and re-ID tasks. Finally, a simple and effective data association mechanism is introduced, which associates each detection instead of just the high-score detections during the tracking process. The experimental results show that our one-shot MOT algorithm achieves excellent tracking performance on multiple public datasets and can be effectively applied to crowded scenes. In particular, CSMOT decreases the number of ID switches by 11.8% and 33.8% on the MOT16 and MOT17 test datasets, respectively, compared to the baseline. [ABSTRACT FROM AUTHOR]

The localization of sensor nodes is an important problem in wireless sensor networks. The DV-Hop algorithm is a typical range-free algorithm, but the localization accuracy is not high. To further improve the localization accuracy, this paper designs a DV-Hop algorithm based on multi-objective salp swarm optimization. Firstly, hop counts in the DV-Hop algorithm are subdivided, and the average hop distance is corrected based on the minimum mean-square error criterion and weighting. Secondly, the traditional single-objective optimization model is transformed into a multi-objective optimization model. Then, in the third stage of DV-Hop, the improved multi-objective salp swarm algorithm is used to estimate the node coordinates. Finally, the proposed algorithm is compared with three improved DV-Hop algorithms in two topologies. Compared with DV-Hop, The localization errors of the proposed algorithm are reduced by 50.79% and 56.79% in the two topology environments with different communication radii. The localization errors of different node numbers are decreased by 38.27% and 56.79%. The maximum reductions in localization errors are 38.44% and 56.79% for different anchor node numbers. Based on different regions, the maximum reductions in localization errors are 56.75% and 56.79%. The simulation results show that the accuracy of the proposed algorithm is better than that of DV-Hop, GWO-DV-Hop, SSA-DV-Hop, and ISSA-DV-Hop algorithms. [ABSTRACT FROM AUTHOR]

In this paper, a novel modified auto disturbance rejection control (ADRC) design of a permanent magnet synchronous motor based on the improved memetic algorithm (IMA) is proposed. Firstly, there is an obvious system ripple caused by the defect that the optimal control function used in traditional ADRC cannot be differentiable and smooth at the segment point; aiming at weakening the system ripple effectively, the proposed method constructs a novel differentiable and smooth optimal control function to modify the ADRC design. Furthermore, aiming at improving the integration parameters optimization effect effectively, a novel improved memetic algorithm is proposed for obtaining the optimal parameters of ADRC. Specifically, an IMA with high-quality balance based on an adaptive nonlinear decreasing strategy for the convergence factor, Gaussian mutation mechanism, improved learning mechanism with the high-quality balance between competitive and opposition-based learning (OBL) and an elite set maintenance mechanism based on fusion distance is proposed so that these strategies can improve the optimization precision by a large margin. Finally, the experiment results of the PMSM speed control practical cases show that the ADRC based on IMA has an apparent better optimization effect than that of fuzzy PI, traditional ADRC based on the genetic algorithm and an improved ADRC based on improved moth–flame optimization. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the algorithms for traversal exploration and path coverage of target regions using multiple agents, enabling the efficient deployment of a set of agents to cover a complex region. First, the original multi-agent path planning problem (mCPP) is transformed into several single-agent sub-problems, by dividing the target region into multiple balanced sub-regions, which reduces the explosive combinatorial complexity; subsequently, closed-loop paths are planned in each sub-region by the rapidly exploring random trees (RRT) algorithm to ensure continuous exploration and repeated visits to each node of the target region. On this basis, we also propose two improvements: for the corner case of narrow regions, the use of geodesic distance is proposed to replace the Eulerian distance in Voronoi partitioning, and the iterations for balanced partitioning can be reduced by more than one order of magnitude; the Dijkstra algorithm is introduced to assign a smaller weight to the path cost when the geodesic direction changes, which makes the region division more "cohesive", thus greatly reducing the number of turns in the path and making it more robust. The final optimization algorithm ensures the following characteristics: complete coverage of the target area, wide applicability of multiple area shapes, reasonable distribution of exploration tasks, minimum average waiting time, and sustainable exploration without any preparation phase. [ABSTRACT FROM AUTHOR]

In this paper, a high-accuracy localization problem under a complex non-line-of-sight (NLOS) condition is addressed by a new method that utilizes multiple NLOS paths to improve localization accuracy, as opposed to the traditional method of suppressing them. The spatial multi-path array fusion localization model is presented and analyzed, followed by an angle-of-arrival (AOA) and time-of-arrival (TOA) algorithm based on spatial multi-information fusion that seeks to improve localization accuracy. Multi-path of spatial signals, measurement of the multi-element antenna, and geographic environment information are integrated into the proposed method for localization optimization. Simulation experiments were carried out, and the results revealed that the proposed algorithm is capable of making full use of spatial multi-location information for localization, thus improving the accuracy of localization in a the NLOS environment effectively and increasing the locatable probability of complex environment localization applications. [ABSTRACT FROM AUTHOR]

Researchers around the globe have contributed for many years to the research field of fault-tolerant control; the importance of this field is ever increasing as a consequence of the rising complexity of technical systems, the enlarging importance of electronics and software as well as the widening share of interconnected and cloud solutions. This field was supplemented in recent years by fault-tolerant design. Two main goals of fault-tolerant design can be distinguished. The first main goal is the improvement of the controllability and diagnosability of technical systems through intelligent design. The second goal is the enhancement of the fault-tolerance of technical systems by means of inherently fault-tolerant design characteristics. Inherently fault-tolerant design characteristics are, for instance, redundancy or over-actuation. This paper describes algorithms, methods and tools of fault-tolerant design and an application of the concept to an automated guided vehicle (AGV). This application took place on different levels ranging from conscious requirements management to redundant elements, which were consciously chosen, on the most concrete level of a technical system, i.e., the product geometry. The main scientific contribution of the paper is a methodical framework for fault-tolerant design, as well as certain algorithms and methods within this framework. The underlying motivation is to support engineers in design and control trough product development process transparency and appropriate algorithms and methods. [ABSTRACT FROM AUTHOR]

To improve the detection ability of infrared small targets in complex backgrounds, an improved detection algorithm YOLO-SASE is proposed in this paper. The algorithm is based on the YOLO detection framework and SRGAN network, taking super-resolution reconstructed images as input, combined with the SASE module, SPP module, and multi-level receptive field structure while adjusting the number of detection output layers through exploring feature weight to improve feature utilization efficiency. Compared with the original model, the accuracy and recall rate of the algorithm proposed in this paper were improved by 2% and 3%, respectively, in the experiment, and the stability of the results was significantly improved in the training process. [ABSTRACT FROM AUTHOR]

The filtered-x recursive least square (FxRLS) algorithm is widely used in the active noise control system and has achieved great success in some complex de-noising environments, such as the cabin in vehicles and aircraft. However, its performance is sensitive to some user-defined parameters such as the forgetting factor and initial gain. Once these parameters are not selected properly, the de-noising effect of FxRLS will deteriorate. Moreover, the tracking performance of FxRLS for mutation is still restricted to a certain extent. To solve the above problems, this paper proposes a new proportional FxRLS (PFxRLS) algorithm. The forgetting factor and initial gain sensitivity are successfully reduced without introducing new turning parameters. The de-noising level and tracking performance have also been improved. Moreover, the momentum technique is introduced in PFxRLS to further improve its robustness and de-noising level. To ensure stability, its convergence condition is also discussed in this paper. The effectiveness of the proposed algorithms is illustrated by simulations and experiments with different user-defined parameters and time-varying noise environments. [ABSTRACT FROM AUTHOR]

Given the lack of scale information of the image features detected by the visual SLAM (simultaneous localization and mapping) algorithm, the accumulation of many features lacking depth information will cause scale blur, which will lead to degradation and tracking failure. In this paper, we introduce the lidar point cloud to provide additional depth information for the image features in estimating ego-motion to assist visual SLAM. To enhance the stability of the pose estimation, the front-end of visual SLAM based on nonlinear optimization is improved. The pole error is introduced in the pose estimation between frames, and the residuals are calculated according to whether the feature points have depth information. The residuals of features reconstruct the objective function and iteratively solve the robot's pose. A keyframe-based method is used to optimize the pose locally in reducing the complexity of the optimization problem. The experimental results show that the improved algorithm achieves better results in the KITTI dataset and outdoor scenes. Compared with the pure visual SLAM algorithm, the trajectory error of the mobile robot is reduced by 52.7%. The LV-SLAM algorithm proposed in this paper has good adaptability and robust stability in different environments. [ABSTRACT FROM AUTHOR]

With the introduction of concepts such as ubiquitous mapping, mapping-related technologies are gradually applied in autonomous driving and target recognition. There are many problems in vision measurement and remote sensing, such as difficulty in automatic vehicle discrimination, high missing rates under multiple vehicle targets, and sensitivity to the external environment. This paper proposes an improved RES-YOLO detection algorithm to solve these problems and applies it to the automatic detection of vehicle targets. Specifically, this paper improves the detection effect of the traditional YOLO algorithm by selecting optimized feature networks and constructing adaptive loss functions. The BDD100K data set was used for training and verification. Additionally, the optimized YOLO deep learning vehicle detection model is obtained and compared with recent advanced target recognition algorithms. Experimental results show that the proposed algorithm can automatically identify multiple vehicle targets effectively and can significantly reduce missing and false rates, with the local optimal accuracy of up to 95% and the average accuracy above 86% under large data volume detection. The average accuracy of our algorithm is higher than all five other algorithms including the latest SSD and Faster-RCNN. In average accuracy, the RES-YOLO algorithm for small data volume and large data volume is 1.0% and 1.7% higher than the original YOLO. In addition, the training time is shortened by 7.3% compared with the original algorithm. The network is then tested with five types of local measured vehicle data sets and shows satisfactory recognition accuracy under different interference backgrounds. In short, the method in this paper can complete the task of vehicle target detection under different environmental interferences. [ABSTRACT FROM AUTHOR]

With the gradual maturity of driverless and automatic parking technologies, electric vehicle charging has been gradually developing in the direction of automation. However, the pose calculation of the charging port (CP) is an important part of realizing automatic charging, and it represents a problem that needs to be solved urgently. To address this problem, this paper proposes a set of efficient and accurate methods for determining the pose of an electric vehicle CP, which mainly includes the search and aiming phases. In the search phase, the feature circle algorithm is used to fit the ellipse information to obtain the pixel coordinates of the feature point. In the aiming phase, contour matching and logarithmic evaluation indicators are used in the cluster template matching algorithm (CTMA) proposed in this paper to obtain the matching position. Based on the image deformation rate and zoom rates, a matching template is established to realize the fast and accurate matching of textureless circular features and complex light fields. The EPnP algorithm is employed to obtain the pose information, and an AUBO-i5 robot is used to complete the charging gun insertion. The results show that the average CP positioning errors (x, y, z, Rx, Ry, and Rz) of the proposed algorithm are 0.65 mm, 0.84 mm, 1.24 mm, 1.11 degrees, 0.95 degrees, and 0.55 degrees. Further, the efficiency of the positioning method is improved by 510.4% and the comprehensive plug-in success rate is 95%. Therefore, the proposed CTMA in this paper can efficiently and accurately identify the CP while meeting the actual plug-in requirements. [ABSTRACT FROM AUTHOR]

With the exponential growth of data, solving classification or regression tasks by mining time series data has become a research hotspot. Commonly used methods include machine learning, artificial neural networks, and so on. However, these methods only extract the continuous or discrete features of sequences, which have the drawbacks of low information utilization, poor robustness, and computational complexity. To solve these problems, this paper innovatively uses Wasserstein distance instead of Kullback–Leibler divergence and uses it to construct an autoencoder to learn discrete features of time series. Then, a hidden Markov model is used to learn the continuous features of the sequence. Finally, stacking is used to ensemble the two models to obtain the final model. This paper experimentally verifies that the ensemble model has lower computational complexity and is close to state-of-the-art classification accuracy. [ABSTRACT FROM AUTHOR]

As an important component of autonomous intelligent systems, the research on autonomous positioning algorithms used by UAVs is of great significance. In order to resolve the problem whereby the GNSS signal is interrupted, and the visual sensor lacks sufficient feature points in complex scenes, which leads to difficulties in autonomous positioning, this paper proposes a new robust adaptive positioning algorithm that ensures the robustness and accuracy of autonomous navigation and positioning in UAVs. On the basis of the combined navigation model of vision/inertial navigation and satellite/inertial navigation, based on ESKF, a multi-source fusion model based on a federated Kalman filter is here established. Furthermore, a robust adaptive localization algorithm is proposed, which uses robust equivalent weights to estimate the sub-filters, and then uses the sub-filter state covariance to adaptively assign information sharing coefficients. After simulation experiments and dataset verification, the results show that the robust adaptive algorithm can effectively limit the impact of gross errors in observations and mathematical model deviations and can automatically update the information sharing coefficient online according to the sub-filter equivalent state covariance. Compared with the classical federated Kalman algorithm and the adaptive federated Kalman algorithm, our algorithm can meet the real-time requirements of navigation, and the accuracy of position, velocity, and attitude measurement is improved by 2–3 times. The robust adaptive localization algorithm proposed in this paper can effectively improve the reliability and accuracy of autonomous navigation systems in complex scenes. Moreover, the algorithm is general—it is not intended for a specific scene or a specific sensor combination– and is applicable to individual scenes with varied sensor combinations. [ABSTRACT FROM AUTHOR]

This paper deals with the challenging problem of scheduling users' tasks, while taking into consideration users' quality of service (QoS) requirements, with the objective of reducing the energy consumption of physical machines. This paper presents a model to analyze the current state of the running tasks according to the results of the QoS prediction assigned by an ARIMA prediction model optimized with Kalman filter. Then, we calculate a scheduling policy with a combined particle swarm optimization (PSO) and gravitational search algorithm (GSA) algorithms according to the QoS status analysis. Experimental results show that the proposed HPSO algorithm reduces resources consumption 16.51% more than the original hybrid algorithm, and the violation of service-level agreement (SLA) is 0.053% less when the optimized prediction model is used. [ABSTRACT FROM AUTHOR]

Internal erosion is the most important failure mechanism of earth and rockfill dams. Since this type of erosion develops internally and silently, methodologies of data acquisition and processing for dam monitoring are crucial to guarantee a safe operation during the lifespan of these structures. In this context, artificial intelligence techniques show up as tools that can simplify the analysis and verification process not of the internal erosion itself, but of the effects that this pathology causes in the response of the dam to external stimuli. Therefore, within the scope of this paper, a methodological framework for monitoring internal erosion in the body of earth and rockfill dams will be proposed. For that, artificial intelligence methods, especially deep neural autoencoders, will be used to treat the acoustic data collected by geophones installed on a dam. The sensor data is processed to identify patterns and anomalies as well as to classify the dam's structural health status. In short, the acoustic dataset is preprocessed to reduce its dimensionality. In this process, for each second of acquired data, three parameters are calculated (Hjorth parameters). For each parameter, the data from all the available sensors are used to calibrate an autoencoder. Then, the reconstruction error of each autoencoder is used to monitor how far from the original (normal) state the acoustic signature of the dam is. The time series of reconstruction errors are combined with a cumulative sum (CUSUM) algorithm, which indicates changes in the sequential data collected. Additionally, the outputs of the CUSUM algorithms are treated by a fuzzy logic framework to predict the status of the structure. A scale model is built and monitored to check the effectiveness of the methodology hereby developed, showing that the existence of anomalies is promptly detected by the algorithm. The framework introduced in the present paper aims to detect internal erosion inside dams by combining different techniques in a novel context and methodological workflow. Therefore, this paper seeks to close gaps in prior studies, which mostly treated just parts of the data acquisition–processing workflow. [ABSTRACT FROM AUTHOR]

Quality inspection in the industrial production field is experiencing a strong technological development that benefits from the combination of vision-based techniques with artificial intelligence algorithms. This paper initially addresses the problem of defect identification for circularly symmetric mechanical components, characterized by the presence of periodic elements. In the specific case of knurled washers, we compare the performances of a standard algorithm for the analysis of grey-scale image with a Deep Learning (DL) approach. The standard algorithm is based on the extraction of pseudo-signals derived from the conversion of the grey scale image of concentric annuli. In the DL approach, the component inspection is shifted from the entire sample to specific areas repeated along the object profile where the defect may occur. The standard algorithm provides better results in terms of accuracy and computational time with respect to the DL approach. Nevertheless, DL reaches accuracy higher than 99% when performance is evaluated targeting the identification of damaged teeth. The possibility of extending the methods and the results to other circularly symmetrical components is analyzed and discussed. [ABSTRACT FROM AUTHOR]

For a network of robots working in a specific environment, relative localization among robots is the basis for accomplishing various upper-level tasks. To avoid the latency and fragility of long-range or multi-hop communication, distributed relative localization algorithms, in which robots take local measurements and calculate localizations and poses relative to their neighbors distributively, are highly desired. Distributed relative localization has the advantages of a low communication burden and better system robustness but encounters challenges in the distributed algorithm design, communication protocol design, local network organization, etc. This paper presents a detailed survey of the key methodologies designed for distributed relative localization for robot networks. We classify the distributed localization algorithms regarding to the types of measurements, i.e., distance-based, bearing-based, and multiple-measurement-fusion-based. The detailed design methodologies, advantages, drawbacks, and application scenarios of different distributed localization algorithms are introduced and summarized. Then, the research works that support distributed localization, including local network organization, communication efficiency, and the robustness of distributed localization algorithms, are surveyed. Finally, popular simulation platforms are summarized and compared in order to facilitate future research and experiments on distributed relative localization algorithms. [ABSTRACT FROM AUTHOR]

The Internet-of-Things (IoT) massive access is a significant scenario for sixth-generation (6G) communications. However, low-power IoT devices easily suffer from remote interference caused by the atmospheric duct under the 6G time-division duplex (TDD) mode. It causes distant downlink wireless signals to propagate beyond the designed protection distance and interfere with local uplink signals, leading to a large outage probability. In this paper, a remote interference discrimination testbed is originally proposed to detect interference, which supports the comparison of different types of algorithms on the testbed. Specifically, 5,520,000 TDD network-side data collected by real sensors are used to validate the interference discrimination capabilities of nine promising AI algorithms. Moreover, a consistent comparison of the testbed shows that the ensemble algorithm achieves an average accuracy of 12% higher than the single model algorithm. [ABSTRACT FROM AUTHOR]

MicroRNAs (miRNA) are small, non-coding regulatory molecules whose effective alteration might result in abnormal gene manifestation in the downstream pathway of their target. miRNA gene variants can impact miRNA transcription, maturation, or target selectivity, impairing their usefulness in plant growth and stress responses. Simple Sequence Repeat (SSR) based on miRNA is a newly introduced functional marker that has recently been used in plant breeding. MicroRNA and long non-coding RNA (lncRNA) are two examples of non-coding RNA (ncRNA) that play a vital role in controlling the biological processes of animals and plants. According to recent studies, the major objective for decoding their functional activities is predicting the relationship between lncRNA and miRNA. Traditional feature-based classification systems' prediction accuracy and reliability are frequently harmed because of the small data size, human factors' limits, and huge quantity of noise. This paper proposes an optimized deep learning model built with Independently Recurrent Neural Networks (IndRNNs) and Convolutional Neural Networks (CNNs) to predict the interaction in plants between lncRNA and miRNA. The deep learning ensemble model automatically investigates the function characteristics of genetic sequences. The proposed model's main advantage is the enhanced accuracy in plant miRNA–IncRNA prediction due to optimal hyperparameter tuning, which is performed by the artificial Gorilla Troops Algorithm and the proposed intelligent preying algorithm. IndRNN is adapted to derive the representation of learned sequence dependencies and sequence features by overcoming the inaccuracies of natural factors in traditional feature architecture. Working with large-scale data, the suggested model outperforms the current deep learning model and shallow machine learning, notably for extended sequences, according to the findings of the experiments, where we obtained an accuracy of 97.7% in the proposed method. [ABSTRACT FROM AUTHOR]

Environment landmarks are generally employed by visual SLAM (vSLAM) methods in the form of keypoints. However, these landmarks are unstable over time because they belong to areas that tend to change, e.g., shadows or moving objects. To solve this, some other authors have proposed the combination of keypoints and artificial markers distributed in the environment so as to facilitate the tracking process in the long run. Artificial markers are special elements (similar to beacons) that can be permanently placed in the environment to facilitate tracking. In any case, these systems keep a set of keypoints that is not likely to be reused, thus unnecessarily increasing the computing time required for tracking. This paper proposes a novel visual SLAM approach that efficiently combines keypoints and artificial markers, allowing for a substantial reduction in the computing time and memory required without noticeably degrading the tracking accuracy. In the first stage, our system creates a map of the environment using both keypoints and artificial markers, but once the map is created, the keypoints are removed and only the markers are kept. Thus, our map stores only long-lasting features of the environment (i.e., the markers). Then, for localization purposes, our algorithm uses the marker information along with temporary keypoints created just in the time of tracking, which are removed after a while. Since our algorithm keeps only a small subset of recent keypoints, it is faster than the state-of-the-art vSLAM approaches. The experimental results show that our proposed sSLAM compares favorably with ORB-SLAM2, ORB-SLAM3, OpenVSLAM and UcoSLAM in terms of speed, without statistically significant differences in accuracy. [ABSTRACT FROM AUTHOR]

Efficient trajectory generation in complex dynamic environments remains an open problem in the operation of an unmanned surface vehicle (USV). The perception of a USV is usually interfered by the swing of the hull and the ambient weather, making it challenging to plan optimal USV trajectories. In this paper, a cooperative trajectory planning algorithm for a coupled USV-UAV system is proposed to ensure that a USV can execute a safe and smooth path as it autonomously advances through multi-obstacle maps. Specifically, the unmanned aerial vehicle (UAV) plays the role of a flight sensor, providing real-time global map and obstacle information with a lightweight semantic segmentation network and 3D projection transformation. An initial obstacle avoidance trajectory is generated by a graph-based search method. Concerning the unique under-actuated kinematic characteristics of the USV, a numerical optimization method based on hull dynamic constraints is introduced to make the trajectory easier to be tracked for motion control. Finally, a motion control method based on NMPC with the lowest energy consumption constraint during execution is proposed. Experimental results verify the effectiveness of the whole system, and the generated trajectory is locally optimal for USV with considerable tracking accuracy. [ABSTRACT FROM AUTHOR]

A multi-swarm-evolutionary structure based on the parasitic relationship in the biosphere is proposed in this paper and, according to the conception, the Para-PSO-ABC algorithm (ParaPA), combined with merits of the modified particle swarm optimization (MPSO) and artificial bee colony algorithm (ABC), is conducted with the multimodal routing strategy to enhance the safety and the cost issue for the mobile robot path planning problem. The evolution is divided into three stages, where the first is the independent evolutionary stage, with the same evolution strategies for each swarm. The second is the fusion stage, in which individuals are evolved hierarchically in the parasitism structure. Finally, in the interaction stage, a multi-swarm-elite strategy is used to filter the information through a predefined cross function among swarms. Meanwhile, the segment obstacle-avoiding strategy is proposed to accelerate the searching speed with two fitness functions. The best path is selected according to the performance on the safety and consumption issues. The introduced algorithm is examined with different obstacle allocations and simulated in the real routing environment compared with some typical algorithms. The results verify the productiveness of the parasitism-relation-based structure and the stage-based evolution strategy in path planning. [ABSTRACT FROM AUTHOR]

Diffraction algorithms with adjustable magnification are dominant in holographic projection and imaging. However, the algorithms are limited by the Nyquist sampling conditions, and simulation results with inappropriate parameters sometimes appear with aliasing. At present, many diffraction algorithms have been proposed and improved, but there is a need for an overall analysis of their sampling conditions. In this paper, some classical diffraction algorithms with adjustable magnification are summarized, and their sampling conditions in the case of plane wave or spherical wave illumination are analyzed and compared, which helps to select the appropriate diffraction algorithm according to the specific parameter conditions of the simulation to avoid aliasing. [ABSTRACT FROM AUTHOR]

Defocus is an important factor that causes image quality degradation of optoelectronic tracking equipment in the shooting range. In this paper, an improved blind/referenceless image spatial quality evaluator (BRISQUE) algorithm is formulated by using the image characteristic extraction technology to obtain a characteristic vector (CV). The CV consists of 36 characteristic values that can effectively reflect the defocusing condition of the corresponding image. The image is evaluated and scored subjectively by the human eyes. The subjective evaluation scores and CVs constitute a set of training data samples for the defocusing evaluation model. An image database that contains sufficiently many training samples is constructed. The training model is trained to obtain the support vector machine (SVM) model by using the regression function of the SVM. In the experiments, the BRISQUE algorithm is used to obtain the image feature vector. The method of establishing the image definition evaluation model via SVM is feasible and yields higher subjective and objective consistency. [ABSTRACT FROM AUTHOR]

Breast cancer is the most common and the fifth deadliest cancer worldwide. In more advanced stages of cancer, cancer cells metastasize through lymphatic and blood vessels. Currently there is no satisfactory neoadjuvant (i.e., preoperative) diagnosis to assess whether cancer has spread to neighboring Axillary Lymph Nodes (ALN). This paper addresses the use of radar Microwave Imaging (MWI) to detect and determine whether ALNs have been metastasized, presenting an analysis of the performance of different artifact removal and beamformer algorithms in distinct anatomical scenarios. We assess distinct axillary region models and the effect of varying the shape of the skin, muscle and subcutaneous adipose tissue layers on single ALN detection. We also study multiple ALN detection and contrast between healthy and metastasized ALNs. We propose a new beamformer algorithm denominated Channel-Ranked Delay-Multiply-And-Sum (CR-DMAS), which allows the successful detection of ALNs in order to achieve better Signal-to-Clutter Ratio, e.g., with the muscle layer up to 3.07 dB, a Signal-to-Mean Ratio of up to 20.78 dB and a Location Error of 1.58 mm. In multiple target detection, CR-DMAS outperformed other well established beamformers used in the context of breast MWI. Overall, this work provides new insights into the performance of algorithms in axillary MWI. [ABSTRACT FROM AUTHOR]

Safety helmet wearing plays a major role in protecting the safety of workers in industry and construction, so a real-time helmet wearing detection technology is very necessary. This paper proposes an improved YOLOv4 algorithm to achieve real-time and efficient safety helmet wearing detection. The improved YOLOv4 algorithm adopts a lightweight network PP-LCNet as the backbone network and uses deepwise separable convolution to decrease the model parameters. Besides, the coordinate attention mechanism module is embedded in the three output feature layers of the backbone network to enhance the feature information, and an improved feature fusion structure is designed to fuse the target information. In terms of the loss function, we use a new SIoU loss function that fuses directional information to increase detection precision. The experimental findings demonstrate that the improved YOLOv4 algorithm achieves an accuracy of 92.98%, a model size of 41.88 M, and a detection speed of 43.23 pictures/s. Compared with the original YOLOv4, the accuracy increases by 0.52%, the model size decreases by about 83%, and the detection speed increases by 88%. Compared with other existing methods, it performs better in terms of precision and speed. [ABSTRACT FROM AUTHOR]

The accuracy of insulators and their defect identification by UAVs (unmanned aerial vehicles) in transmission-line inspection needs to be further improved, and the model size of the detection algorithm is significantly reduced to make it more suitable for edge-end deployment. In this paper, the algorithm uses a lightweight GhostNet module to reconstruct the backbone feature extraction network of the YOLOv4 model and employs depthwise separable convolution in the feature fusion layer. The model is lighter on the premise of ensuring the effect of image information extraction. Meanwhile, the ECA-Net channel attention mechanism is embedded into the feature extraction layer and PANet (Path Aggregation Network) to improve the recognition accuracy of the model for small targets. The experimental results show that the size of the improved model is reduced from 244 MB to 42 MB, which is only 17.3% of the original model. At the same time, the mAp of the improved model is 0.77% higher than that of the original model, reaching 95.4%. Moreover, the mAP compared with YOLOv5-s and YOLOX-s, respectively, is improved by 1.98% and 1.29%. Finally, the improved model is deployed into Jetson Xavier NX and run at a speed of 8.8 FPS, which is 4.3 FPS faster than the original model. [ABSTRACT FROM AUTHOR]

With progressive technological advancements, the time for electric vehicles (EVs) and unmanned aerial vehicles (UAVs) has finally arrived for the masses. However, intelligent transportation systems need to develop appropriate protocols that enable swift predictive communication among these battery-powered devices. In this paper, we highlight the challenges in message routing in a unified paradigm of electric and flying vehicles (EnFVs). We innovate over the existing routing scheme by considering multi-objective EnFVs message routing using a novel modified genetics algorithm. The proposed scheme identifies all possible solutions, outlines the Pareto-front, and considers the optimal solution for the best route. Moreover, the reliability, data rate, and residual energy of vehicles are considered to achieve high communication gains. An exhaustive evaluation of the proposed and three existing schemes using a New York City real geographical trace shows that the proposed scheme outperforms existing solutions and achieves a 90 % + packet delivery ratio, longer connectivity time, shortest average hop distance, and efficient energy consumption. [ABSTRACT FROM AUTHOR]

The paper suggests a new approach to calibration of a micromechanical inertial measurement unit. The data are collected on a simple rotating turntable with horizontal (or close to) rotation axis. For such a turntable, an electric screwdriver with fairly low rotation rate can be used. The algorithm is based on the Fourier transform applied to the rotation experimental data, implemented as FFT. The frequencies and amplitudes of the spectral peaks are calculated and collected in a small set of data, and calibration is done explicitly with these data. Calibration of an accelerometer triad and choosing the IMU coordinate frame are reduced to approximating the collected data with an ellipsoid in three dimensions. With rotation frequency calculated as the peak frequency of accelerometer readings, calibration of the gyros is a straightforward linear least square problem. The algorithm is purely algebraic, requires no iterations and no initial guess on the parameters, and thus encounters no convergence problems. The algorithm was tested both with simulated and experimental data, with some promising results. [ABSTRACT FROM AUTHOR]

Single image dehazing has been a challenge in the field of image restoration and computer vision. Many model-based and non-model-based dehazing methods have been reported. This study focuses on a model-based algorithm. A popular model-based method is dark channel prior (DCP) which has attracted a lot of attention because of its simplicity and effectiveness. In DCP-based methods, the model parameters should be appropriately estimated for better performance. Previously, we found that appropriate scaling factors of model parameters helped dehazing performance and proposed an improved DCP (IDCP) method that uses heuristic scaling factors for the model parameters (atmospheric light and initial transmittance). With the IDCP, this paper presents an approach to find optimal scaling factors using the whale optimization algorithm (WOA) and haze level information. The WOA uses ground truth images as a reference in a fitness function to search the optimal scaling factors in the IDCP. The IDCP with the WOA was termed IDCP/WOA. It was observed that the performance of IDCP/WOA was significantly affected by hazy ground truth images. Thus, according to the haze level information, a hazy image discriminator was developed to exclude hazy ground truth images from the dataset used in the IDCP/WOA. To avoid using ground truth images in the application stage, hazy image clustering was presented to group hazy images and their corresponding optimal scaling factors obtained by the IDCP/WOA. Then, the average scaling factors for each haze level were found. The resulting dehazing algorithm was called optimized IDCP (OIDCP). Three datasets commonly used in the image dehazing field, the RESIDE, O-HAZE, and KeDeMa datasets, were used to justify the proposed OIDCP. Then a comparison was made between the OIDCP and five recent haze removal methods. On the RESIDE dataset, the OIDCP achieved a PSNR of 26.23 dB, which was better than IDCP by 0.81 dB, DCP by 8.03 dB, RRO by 5.28, AOD by 5.6 dB, and GCAN by 1.27 dB. On the O-HAZE dataset, the OIDCP had a PSNR of 19.53 dB, which was better than IDCP by 0.06 dB, DCP by 4.39 dB, RRO by 0.97 dB, AOD by 1.41 dB, and GCAN by 0.34 dB. On the KeDeMa dataset, the OIDCP obtained the best overall performance and gave dehazed images with stable visual quality. This suggests that the results of this study may benefit model-based dehazing algorithms. [ABSTRACT FROM AUTHOR]

Aiming at the current lane line detection algorithm in complex traffic scenes, such as lane lines being blocked by shadows, blurred roads, and road sparseness, which lead to low lane line detection accuracy and poor real-time detection speed, this paper proposes a lane line detection algorithm based on instance segmentation. Firstly, the improved lightweight network RepVgg-A0 is used to encode road images, which expands the receptive field of the network; secondly, a multi-size asymmetric shuffling convolution model is proposed for the characteristics of sparse and slender lane lines, which enhances the ability to extract lane line features; an adaptive upsampling model is further proposed as a decoder, which upsamples the feature map to the original resolution for pixel-level classification and detection, and adds the lane line prediction branch to output the confidence of the lane line; and finally, the instance segmentation-based lane line detection algorithm is successfully deployed on the embedded platform Jetson Nano, and half-precision acceleration is performed using NVDIA's TensorRT framework. The experimental results show that the Acc value of the lane line detection algorithm based on instance segmentation is 96.7%, and the FPS is 77.5 fps/s. The detection speed deployed on the embedded platform Jetson Nano reaches 27 fps/s. [ABSTRACT FROM AUTHOR]

In view of the fact that the aerial images of UAVs are usually taken from a top-down perspective, there are large changes in spatial resolution and small targets to be detected, and the detection method of natural scenes is not effective in detecting under the arbitrary arrangement of remote sensing image direction, which is difficult to apply to the detection demand scenario of road technology status assessment, this paper proposes a lightweight network architecture algorithm based on MobileNetv3-YOLOv5s (MR-YOLO). First, the MobileNetv3 structure is introduced to replace part of the backbone network of YOLOv5s for feature extraction so as to reduce the network model size and computation and improve the detection speed of the target; meanwhile, the CSPNet cross-stage local network is introduced to ensure the accuracy while reducing the computation. The focal loss function is improved to improve the localization accuracy while increasing the speed of the bounding box regression. Finally, by improving the YOLOv5 target detection network from the prior frame design and the bounding box regression formula, the rotation angle method is added to make it suitable for the detection demand scenario of road technology status assessment. After a large number of algorithm comparisons and data ablation experiments, the feasibility of the algorithm was verified on the Xinjiang Altay highway dataset, and the accuracy of the MR-YOLO algorithm was as high as 91.1%, the average accuracy was as high as 92.4%, and the detection speed reached 96.8 FPS. Compared with YOLOv5s, the p-value and mAP values of the proposed algorithm were effectively improved. It can be seen that the proposed algorithm improves the detection accuracy and detection speed while greatly reducing the number of model parameters and computation. [ABSTRACT FROM AUTHOR]

Self-collision detection is fundamental to the safe operation of multi-manipulator systems, especially when cooperating in highly dynamic working environments. Existing methods still face the problem that detection efficiency and accuracy cannot be achieved at the same time. In this paper, we introduce artificial intelligence technology into the control system. Based on the Gilbert-Johnson-Keerthi (GJK) algorithm, we generated a dataset and trained a deep neural network (DLNet) to improve the detection efficiency. By combining DLNet and the GJK algorithm, we propose a two-level self-collision detection algorithm (DLGJK algorithm) to solve real-time self-collision detection problems in a dual-manipulator system with fast-continuous and high-precision properties. First, the proposed algorithm uses DLNet to determine whether the current working state of the system has a risk of self-collision; since most of the working states in a system workspace do not have a self-collision risk, DLNet can effectively reduce the number of unnecessary detections and improve the detection efficiency. Then, for the working states with a risk of self-collision, we modeled precise colliders and applied the GJK algorithm for fine self-collision detection, which achieved detection accuracy. The experimental results showed that compared to that with the global use of the GJK algorithm for self-collision detection, the DLGJK algorithm can reduce the time expectation of a single detection in a system workspace by 97.7%. In the path planning of the manipulators, it could effectively reduce the number of unnecessary detections, improve the detection efficiency, and reduce system overhead. The proposed algorithm also has good scalability for a multi-manipulator system that can be split into dual-manipulator systems. [ABSTRACT FROM AUTHOR]

In the dim-small target detection field, background suppression is a key technique for stably extracting the target. In order to effectively suppress the background to enhance the target, this paper presents a novel background modeling algorithm, which constructs base functions for each pixel based on the local region background and models the background of each pixel, named single pixel background modeling (SPB). In SPB, the low-rank blocks of the local backgrounds are first obtained to construct the background base functions of the center pixel. Then, the background of the center pixel is optimally estimated by the background bases. Experiments demonstrate that in the case of extremely low signal-to-noise ratio (SNR < 1.5 dB) and complex motion state of targets, SPB can stably and effectively separate the target from the strongly undulant sky background. The difference image obtained via SPB background modeling has the characters: the non-target residual could be white noise, and the target is significantly enhanced. Compared with the other typical five algorithms, SPB remarkably outperforms other algorithms to detect the target of a low signal-to-noise ratio. [ABSTRACT FROM AUTHOR]

The Chinese Remainder Theorem (CRT) based frequency estimation has been widely studied during the past two decades. It enables one to estimate frequencies by sub-Nyquist sampling rates, which reduces the cost of hardware in a sensor network. Several studies have been done on the complex waveform; however, few works studied its applications in the real waveform case. Different from the complex waveform, existing CRT methods cannot be straightforwardly applied to handle a real waveform's spectrum due to the spurious peaks. To tackle the ambiguity problem, in this paper, we propose the first polynomial-time closed-form Robust CRT (RCRT) for the single-tone real waveform, which can be considered as a special case of RCRT for arbitrary two numbers. The time complexity of the proposed algorithm is O (L) , where L is the number of samplers. Furthermore, our algorithm also matches the optimal error-tolerance bound. [ABSTRACT FROM AUTHOR]

This paper introduces a simple but powerful segmentation algorithm for 3D meshes. Our algorithm consists of two stages: over-segmentation and region fusion. In the first stage, adaptive space partition is applied to perform over-segmentation, which is very efficient. In the second stage, we define a new intra-region difference, inter-region difference, and fusion condition with the help of various shape features and propose an iterative region fusion method. As the region fusion process is feature aware, our algorithm can deal with complex 3D meshes robustly. Massive qualitative and quantitative experiments also validate the advantages of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a sliding mode control (SMC)-based path-tracking algorithm for autonomous vehicles by considering model-free adaptive feedback actions. In autonomous vehicles, safe path tracking requires adaptive and robust control algorithms because driving environment and vehicle conditions vary in real time. In this study, the SMC was adopted as a robust control method to adjust the switching gain, taking into account the sliding surface and unknown uncertainty to make the control error zero. The sliding surface can be designed mathematically, but it is difficult to express the unknown uncertainty mathematically. Information of priori bounded uncertainties is needed to obtain closed-loop stability of the control system, and the unknown uncertainty can vary with changes in internal and external factors. In the literature, ongoing efforts have been made to overcome the limitation of losing control stability due to unknown uncertainty. This study proposes an integrated method of adaptive feedback control (AFC) and SMC that can adjust a bounded uncertainty. Some illustrative and representative examples, such as autonomous driving scenarios, are also provided to show the main properties of the designed integrated controller. The examples show superior control performance, and it is expected that the integrated controller could be widely used for the path-tracking algorithms of autonomous vehicles. [ABSTRACT FROM AUTHOR]

This paper proposes a new method for predicting rotation error based on improved grey wolf–optimized support vector regression (IGWO-SVR), because the existing rotation error research methods cannot meet the production beat and product quality requirements of enterprises, because of the disadvantages of its being time-consuming and having poor calculation accuracy. First, the grey wolf algorithm is improved based on the optimal Latin hypercube sampling initialization, nonlinear convergence factor, and dynamic weights to improve its accuracy in optimizing the parameters of the support vector regression (SVR) model. Then, the IGWO-SVR prediction model between the manufacturing error of critical parts and the rotation error is established with the RV-40E reducer as a case. The results show that the improved grey wolf algorithm shows better parameter optimization performance, and the IGWO-SVR method shows better prediction performance than the existing back propagation (BP) neural network and BP neural network optimized by the sparrow search algorithm rotation error prediction methods, as well as the SVR models optimized by particle swarm algorithm and grey wolf algorithm. The mean squared error of IGWO-SVR model is 0.026, the running time is 7.843 s, and the maximum relative error is 13.5%, which can meet the requirements of production beat and product quality. Therefore, the IGWO-SVR method can be well applied to the rotate vector (RV) reducer parts-matching model to improve product quality and reduce rework rate and cost. [ABSTRACT FROM AUTHOR]

The failure of insulators may seriously threaten the safe operation of the power system, where the state detection of high-voltage insulators is a must for the normal and safe operation of the power system. Based on the data of insulators in aerial images, this work explored an enhanced particle swarm algorithm to optimize the parameters of the support vector machine. A support vector machine model was therefore established for the identification of the normal and defective states of the insulators. This methodology works with the structure minimization principle of SVM and the characteristics of particle swarm fast optimization. First, the aerial insulator image was segmented as a target by way of the seed region growth based on double-layer cascade morphological improvements, and then, HOG features plus GLCM features were extracted as sample data. Finally, an ameliorated PSO-SVM classifier was designed to realize insulator state identification. Comparisons were made between PSO-SVM and conventional machine learning algorithms, SVM and Random Forest, and an optimization algorithm, Gray Wolf Optimization Support Vector Machine (GWO-SVM), and advanced neural network CNN. The experimental results showed that the performance of the algorithm proposed in this paper touched the top level, where the recognition accuracy rate was 92.11%, the precision rate 90%, the recall rate 94.74%, and the F1-score 92.31%. [ABSTRACT FROM AUTHOR]

This article addresses the problem of estimating the spectral correlation function (SCF), which provides quantitative characterization in the frequency domain of wide-sense cyclostationary properties of random processes which are considered to be the theoretical models of observed time series or discrete-time signals. The theoretical framework behind the SCF estimation is briefly reviewed so that an important difference between the width of the resolution cell in bifrequency plane and the step between the centers of neighboring cells is highlighted. The outline of the proposed double-number fast Fourier transform algorithm (2N-FFT) is described in the paper as a sequence of steps directly leading to a digital signal processing technique. The 2N-FFT algorithm is derived from the time-smoothing approach to cyclic periodogram estimation where the spectral interpolation based on doubling the FFT base is employed. This guarantees that no cyclic frequency is left out of the coverage grid so that at least one resolution element intersects it. A numerical simulation involving two processes, a harmonic amplitude modulated by stationary noise and a binary-pulse amplitude-modulated train, demonstrated that their cyclic frequencies are estimated with a high accuracy, reaching the size of step between resolution cells. In addition, the SCF components estimated by the proposed algorithm are shown to be similar to the curves provided by the theoretical models of the observed processes. The comparison between the proposed algorithm and the well-known FFT accumulation method in terms of computational complexity and required memory size reveals the cases where the 2N-FFT algorithm offers a reasonable trade-off. [ABSTRACT FROM AUTHOR]

This paper proposes a data valuation algorithm for inertial measurement unit-based human activity recognition (IMU-based HAR) data based on meta reinforcement learning. Unlike previous studies that received feature-level input, the algorithm in this study added a feature extraction structure to the data valuation algorithm, and it can receive raw-level inputs and achieve excellent performance. As IMU-based HAR data are multivariate time-series data, the proposed algorithm incorporates an architecture capable of extracting both local and global features by inserting a transformer encoder after the one-dimensional convolutional neural network (1D-CNN) backbone in the data value estimator. In addition, the 1D-CNN-based stacking ensemble structure, which exhibits excellent efficiency and performance on IMU-based HAR data, is used as a predictor to supervise model training. The Berg balance scale (BBS) IMU-based HAR dataset and the public datasets, UCI-HAR, WISDM, and PAMAP2, are used for performance evaluation in this study. The valuation performance of the proposed algorithm is observed to be excellent on IMU-based HAR data. The rate of discovering corrupted data is higher than 96% on all datasets. In addition, classification performance is confirmed to be improved by the suppression of discovery of low-value data. [ABSTRACT FROM AUTHOR]

Indoor 3D positioning is useful in multistory buildings, such as shopping malls, libraries, and airports. This study focuses on indoor 3D positioning using wireless access points (AP) in an environment without adding additional hardware facilities in large-scale complex places. The integration of a deep learning algorithm into indoor 3D positioning is studied, and a 3D dynamic positioning model based on temporal fingerprints is proposed. In contrast to the traditional positioning models with a single input, the proposed method uses a sliding time window to build a temporal fingerprint chip as the input of the positioning model to provide abundant information for positioning. Temporal information can be used to distinguish locations with similar fingerprint vectors and to improve the accuracy and robustness of positioning. Moreover, deep learning has been applied for the automatic extraction of spatiotemporal features. A temporal convolutional network (TCN) feature extractor is proposed in this paper, which adopts a causal convolution mechanism, dilated convolution mechanism, and residual connection mechanism and is not limited by the size of the convolution kernel. It is capable of learning hidden information and spatiotemporal relationships from the input features and the extracted spatiotemporal features are connected with a deep neural network (DNN) regressor to fit the complex nonlinear mapping relationship between the features and position coordinates to estimate the 3D position coordinates of the target. Finally, an open-source public dataset was used to verify the performance of the localization algorithm. Experimental results demonstrated the effectiveness of the proposed positioning model and a comparison between the proposed model and existing models proved that the proposed model can provide more accurate three-dimensional position coordinates. [ABSTRACT FROM AUTHOR]

Most of the traditional image feature point extraction and matching methods are based on a series of light properties of images. These light properties easily conflict with the distinguishability of the image features. The traditional light imaging methods focus only on a fixed depth of the target scene, and subjects at other depths are often easily blurred. This makes the traditional image feature point extraction and matching methods suffer from a low accuracy and a poor robustness. Therefore, in this paper, a light field camera is used as a sensor to acquire image data and to generate a full-focus image with the help of the rich depth information inherent in the original image of the light field. The traditional ORB feature point extraction and matching algorithm is enhanced with the goal of improving the number and accuracy of the feature point extraction for the light field full-focus images. The results show that the improved ORB algorithm extracts not only most of the features in the target scene but also covers the edge part of the image to a greater extent and produces extracted feature points which are evenly distributed for the light field full-focus image. Moreover, the extracted feature points are not repeated in a large number in a certain part of the image, eliminating the aggregation phenomenon that exists in traditional ORB algorithms. [ABSTRACT FROM AUTHOR]

With the aging of the human body and the reduction in its physiological capacities, falls have become a huge threat to individuals' physical and mental health, leading to serious bodily damage to the elderly and financial pressure on their families. As a result, it is vital to design a fall detection algorithm that monitors the state of human activity. This work designs a human fall detection algorithm based on hierarchical decision making. First, this work proposes a dimensionality reduction approach based on feature importance analysis (FIA), which optimizes the feature space via feature importance. This procedure reduces the dimension of features greatly and reduces the time spent by the model in the training phase. Second, this work proposes a hierarchical decision-making algorithm with an XGBoost model. The algorithm is divided into three levels. The first level uses the threshold approach to make a preliminary assessment of the data and only transfers the fall type data to the next level. The second level is an XGBoost-based classification algorithm to analyze again the type of data which remained from the first level. The third level employs a comparison method to determine the direction of the falling. Finally, the fall detection algorithm proposed in this paper has an accuracy of 98.19%, a sensitivity of 97.50%, and a specificity of 98.63%. The classification accuracy of the fall direction reaches 93.44%, and the algorithm can efficiently determine the fall direction. [ABSTRACT FROM AUTHOR]

The human visual system (HVS) mechanism has been successfully introduced into the field of infrared small target detection. However, most of the current detection algorithms based on the mechanism of the human visual system ignore the continuous direction information and are easily disturbed by highlight noise and object edges. In this paper, a multi-scale strengthened directional difference (MSDD) algorithm is proposed. It is mainly divided into two parts: local directional intensity measure (LDIM) and local directional fluctuation measure (LDFM). In LDIM, an improved window is used to suppress most edge clutter, highlights, and holes and enhance true targets. In LDFM, the characteristics of the target area, the background area, and the connection between the target and the background are considered, which further highlights the true target signal and suppresses the corner clutter. Then, the MSDD saliency map is obtained by fusing the LDIM map and the LDFM map. Finally, an adaptive threshold segmentation method is employed to capture true targets. The experiments show that the proposed method achieves better detection performance in complex backgrounds than several classical and widely used methods. [ABSTRACT FROM AUTHOR]

In this paper, possibilities for network traffic protection in future hybrid passive optical networks are presented, and reasons for realizing and utilizing advanced network traffic protection schemes for various network traffic classes in these networks are analyzed. Next, principles of the Prediction-based Fair Wavelength and Bandwidth Allocation (PFWBA) algorithm are introduced in detail, focusing on the Prediction-based Fair Excessive Bandwidth Reallocation (PFEBR) algorithm with the Early Dynamic Bandwidth Allocation (E-DBA) mechanism and subsequent Dynamic Wavelength Allocation (DWA) scheme. For analyzing various wavelength allocation possibilities in Hybrid Passive Optical Networks (HPON) networks, a simulation program with the enhancement of the PFWBA algorithm is realized. Finally, a comparison of different methods of the wavelength allocation in conjunction with specific network traffic classes is executed for future HPON networks with considered protection schemes. Subsequently, three methods are presented from the viewpoint of HPON network traffic protection possibilities, including a new approach for the wavelength allocation based on network traffic protection assumptions. [ABSTRACT FROM AUTHOR]

Multi-UAV (multiple unmanned aerial vehicles) flying in three-dimensional (3D) mountain environments suffer from low stability, long-planned path, and low dynamic obstacle avoidance efficiency. Spurred by these constraints, this paper proposes a multi-UAV path planning algorithm that consists of a bioinspired neural network and improved Harris hawks optimization with a periodic energy decline regulation mechanism (BINN-HHO) to solve the multi-UAV path planning problem in a 3D space. Specifically, in the procession of global path planning, an energy cycle decline mechanism is introduced into HHO and embed it into the energy function, which balances the algorithm's multi-round dynamic iteration between global exploration and local search. Additionally, when the onboard sensors detect a dynamic obstacle during the flight, the improved BINN algorithm conducts a local path replanning for dynamic obstacle avoidance. Once the dynamic obstacles in the sensor detection area disappear, the local path planning is completed, and the UAV returns to the trajectory determined by the global planning. The simulation results show that the proposed Harris hawks algorithm has apparent superiorities in path planning and dynamic obstacle avoidance efficiency compared with the basic Harris hawks optimization, particle swarm optimization (PSO), and the sparrow search algorithm (SSA). [ABSTRACT FROM AUTHOR]

Monitoring a patient's vital signs is considered one of the most challenging problems in telehealth systems, especially when patients reside in remote locations. Companies now use IoT devices such as wearable devices to participate in telehealth systems. However, the steady adoption of wearables can result in a significant increase in the volume of data being collected and transmitted. As these devices run on limited battery power, they can run out of power quickly due to the high processing requirements of the device for data collection and transmission. Given the importance of medical data, it is imperative that all transmitted data adhere to strict integrity and availability requirements. Reducing the volume of healthcare data and the frequency of transmission can improve a device's battery life via an inference algorithm. Furthermore, this approach creates issues for improving transmission metrics related to accuracy and efficiency, which are traded-off against each other, with increasing accuracy reducing efficiency. This paper demonstrates that machine learning (ML) can be used to overcome the trade-off problem. The damped least-squares algorithm (DLSA) is used to enhance both metrics by taking fewer samples for transmission whilst maintaining accuracy. The algorithm is tested with a standard heart rate dataset to compare the metrics. The results showed that the DLSA provides the best performance, with an efficiency of 3.33 times for reduced sample data size and an accuracy of 95.6%, with similar accuracies observed in seven different sampling cases adopted for testing that demonstrate improved efficiency. This proposed method significantly improve both metrics using ML without sacrificing one metric over the other compared to existing methods with high efficiency. [ABSTRACT FROM AUTHOR]