Search

Under the condition of low signal-to-noise ratio, the target detection performance of radar decreases, which seriously affects the tracking and recognition for the long-range small targets. To solve it, this paper proposes a target detection algorithm using convolutional neural network to process graphically expressed range time series signals. First, the two-dimensional echo signal was processed graphically. Second, the graphical echo signal was detected by the improved convolutional neural network. The simulation results under the condition of low signal-to-noise ratio show that, compared with the multi-pulse accumulation detection method, the detection method based on convolutional neural network proposed in this paper has a higher target detection probability, which reflects the effectiveness of the method proposed in this paper. [ABSTRACT FROM AUTHOR]

Chip pad inspection is of great practical importance for chip alignment inspection and correction. It is one of the key technologies for automated chip inspection in semiconductor manufacturing. When applying deep learning methods for chip pad inspection, the main problem to be solved is how to ensure the accuracy of small target pad detection and, at the same time, achieve a lightweight inspection model. The attention mechanism is widely used to improve the accuracy of small target detection by finding the attention region of the network. However, conventional attention mechanisms capture feature information locally, which makes it difficult to effectively improve the detection efficiency of small targets from complex backgrounds in target detection tasks. In this paper, an OCAM (Object Convolution Attention Module) attention module is proposed to build long-range dependencies between channel features and position features by constructing feature contextual relationships to enhance the correlation between features. By adding the OCAM attention module to the feature extraction layer of the YOLOv5 network, the detection performance of chip pads is effectively improved. In addition, a design guideline for the attention layer is proposed in the paper. The attention layer is adjusted by network scaling to avoid network characterization bottlenecks, balance network parameters, and network detection performance, and reduce the hardware device requirements for the improved YOLOv5 network in practical scenarios. Extensive experiments on chip pad datasets, VOC datasets, and COCO datasets show that the approach in this paper is more general and superior to several state-of-the-art methods. [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]

At present, PPF-based point cloud recognition algorithms can perform better matching than competitors and be verified in the case of severe occlusion and stacking. However, including certain superfluous feature point pairs in the global model description would significantly lower the algorithm's efficiency. As a result, this paper delves into the Point Pair Feature (PPF) algorithm and proposes a 6D pose estimation method based on Keypoint Pair Feature (K-PPF) voting. The K-PPF algorithm is based on the PPF algorithm and proposes an improved algorithm for the sampling point part. The sample points are retrieved using a combination of curvature-adaptive and grid ISS, and the angle-adaptive judgment is performed on the sampling points to extract the keypoints, therefore improving the point pair feature difference and matching accuracy. To verify the effectiveness of the method, we analyze the experimental results in scenes with different occlusion and complexity levels under the evaluation metrics of ADD-S, Recall, Precision, and Overlap rate. The results show that the algorithm in this paper reduces redundant point pairs and improves recognition efficiency and robustness compared with PPF. Compared with FPFH, CSHOT, SHOT and SI algorithms, this paper improves the recall rate by more than 12.5%. [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]

In the field of metallurgy, the timely and accurate detection of surface defects on metallic materials is a crucial quality control task. However, current defect detection approaches face challenges with large model parameters and low detection rates. To address these issues, this paper proposes a lightweight recognition model for surface damage on steel strips, named LSD-YOLOv5. First, we design a shallow feature enhancement module to replace the first Conv structure in the backbone network. Second, the Coordinate Attention mechanism is introduced into the MobileNetV2 bottleneck structure to maintain the lightweight nature of the model. Then, we propose a smaller bidirectional feature pyramid network (BiFPN-S) and combine it with Concat operation for efficient bidirectional cross-scale connectivity and weighted feature fusion. Finally, the Soft-DIoU-NMS algorithm is employed to enhance the recognition efficiency in scenarios where targets overlap. Compared with the original YOLOv5s, the LSD-YOLOv5 model achieves a reduction of 61.5% in model parameters and a 28.7% improvement in detection speed, while improving recognition accuracy by 2.4%. This demonstrates that the model achieves an optimal balance between detection accuracy and speed, while maintaining a lightweight structure. [ABSTRACT FROM AUTHOR]

Underwater sensor networks play a crucial role in collecting valuable data to monitor offshore aquaculture infrastructures. The number of deployed devices not only impacts the bandwidth for a highly constrained communication environment, but also the cost of the sensor network. On the other hand, industrial and literature current meters work as raw data loggers, and most of the calculations to determine the fundamental frequencies are performed offline on a desktop computer or in the cloud. Belonging to the edge computing research area, this paper presents an algorithm to extract the fundamental frequencies of water currents in an underwater sensor network deployed in offshore aquaculture infrastructures. The target sensor node is based on a commercial ultra-low-power microcontroller. The proposed fundamental frequency identification algorithm only requires the use of an integer arithmetic unit. Our approach exploits the mathematical properties of the finite impulse response (FIR) filtering in the integer domain. The design and implementation of the presented algorithm are discussed in detail in terms of FIR tuning/coefficient selection, memory usage and variable domain for its mathematical formulation aimed at reducing the computational effort required. The approach is validated using a shallow water current model and real-world raw data from an offshore aquaculture infrastructure. The extracted frequencies have a maximum error below a 4%. [ABSTRACT FROM AUTHOR]

The presence of sinkholes has been widely studied due to their potential risk to infrastructure and to the lives of inhabitants and rescuers in urban disaster areas, which is generally addressed in geotechnics and geophysics. In recent years, robotics has gained importance for the inspection and assessment of areas of potential risk for sinkhole formation, as well as for environmental exploration and post-disaster assistance. From the mobile robotics approach, this paper proposes RUDE-AL (Roped UGV DEployment ALgorithm), a methodology for deploying a Mobile Cable-Driven Parallel Robot (MCDPR) composed of four mobile robots and a cable-driven parallel robot (CDPR) for sinkhole exploration tasks and assistance to potential trapped victims. The deployment of the fleet is organized with node-edge formation during the mission's first stage, positioning itself around the area of interest and acting as anchors for the subsequent release of the cable robot. One of the relevant issues considered in this work is the selection of target points for mobile robots (anchors) considering the constraints of a roped fleet, avoiding the collision of the cables with positive obstacles through a fitting function that maximizes the area covered of the zone to explore and minimizes the cost of the route distance performed by the fleet using genetic algorithms, generating feasible target routes for each mobile robot with a configurable balance between the parameters of the fitness function. The main results show a robust method whose adjustment function is affected by the number of positive obstacles near the area of interest and the shape characteristics of the sinkhole. [ABSTRACT FROM AUTHOR]

In an effort to overcome the problem that the traditional stochastic resonance system cannot adjust the structural parameters adaptively in bearing fault-signal detection, this article proposes an adaptive-parameter bearing fault-detection method. First of all, the four strategies of Sobol sequence initialization, exponential convergence factor, adaptive position update, and Cauchy–Gaussian hybrid variation are used to improve the basic grey wolf optimization algorithm, which effectively improves the optimization performance of the algorithm. Then, based on the multistable stochastic resonance model, the structure parameters of the multistable stochastic resonance are optimized through improving the grey wolf algorithm, so as to enhance the fault signal and realize the effective detection of the bearing fault signal. Finally, the proposed bearing fault-detection method is used to analyze and diagnose two open-source bearing data sets, and comparative experiments are conducted with the optimization results of other improved algorithms. Meanwhile, the method proposed in this paper is used to diagnose the fault of the bearing in the lifting device of a single-crystal furnace. The experimental results show that the fault frequency of the inner ring of the first bearing data set diagnosed using the proposed method was 158 Hz, and the fault frequency of the outer ring of the second bearing data set diagnosed using the proposed method was 162 Hz. The fault-diagnosis results of the two bearings were equal to the results derived from the theory. Compared with the optimization results of other improved algorithms, the proposed method has a faster convergence speed and a higher output signal-to-noise ratio. At the same time, the fault frequency of the bearing of the lifting device of the single-crystal furnace was effectively diagnosed as 35 Hz, and the bearing fault signal was effectively detected. [ABSTRACT FROM AUTHOR]

In passive localization techniques, as the scale of the array of the sensors used increases, the source distribution may be a coexistence of near-field (NF) and far-field (FF) sources. Most of the existing algorithms dedicated to the localization of mixed-field sources are based on a simplified model, which has model errors and cannot make good use of non-circular properties when non-circular signals are present in the sources. In this paper, we present a mixed-field circular and non-circular source localization algorithm based on exact spatial propagation geometry. First, we make an initial estimate of the source parameters using exact spatial geometry relations. The MUSIC algorithm is then used in combination with the non-circular properties of the signal to achieve an accurate estimate. The algorithm does not lose performance due to model mismatch and is able to make good use of the non-circular properties of the sources to improve the estimation accuracy. The simulation results show that the proposed algorithm can effectively distinguish between sources and that the algorithm performs satisfactorily. [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]

Pig counting is an important task in pig sales and breeding supervision. Currently, manual counting is low-efficiency and high-cost and presents challenges in terms of statistical analysis. In response to the difficulties faced in pig part feature detection, the loss of tracking due to rapid movement, and the large counting deviation in pig video tracking and counting research, this paper proposes an improved pig counting algorithm (Mobile Pig Counting Algorithm with YOLOv5xpig and DeepSORTPig (MPC-YD)) based on YOLOv5 + DeepSORT model. The algorithm improves the detection rate of pig body parts by adding two different sizes of SPP networks and using SoftPool instead of MaxPool operations in YOLOv5x. In addition, the algorithm includes a pig reidentification network, a pig-tracking method based on spatial state correction, and a pig counting method based on frame number judgment on the DeepSORT algorithm to improve pig tracking accuracy. Experimental analysis shows that the MPC-YD algorithm achieves an average precision of 99.24% in pig object detection and an accuracy of 85.32% in multitarget pig tracking. In the aisle environment of the slaughterhouse, the MPC-YD algorithm achieves a correlation coefficient (R2) of 98.14% in pig counting from video, and it achieves stable pig counting in a breeding environment. The algorithm has a wide range of application prospects. [ABSTRACT FROM AUTHOR]

The non-axisymmetric exciting guided wave can detect the thinning section of the elbow, and the time domain energy value of the signal collected at the outer arch position of the receiving end displays a downward trend as the remaining thickness of the erosion area decreases. To address the difficulty in detecting the erosion degree of the elbow with high accuracy, this paper uses the linear frequency modulation (LFM) signal to excite a non-axisymmetric guided wave that propagates in the 90° elbow and collects signals through four PZT receivers. To predict the erosion degree, the corresponding relationship between the energy value of the four signals after fractional Fourier filtering and the degree of elbow erosion is established through the particle swarm optimization (PSO)–least squares support vector machine (LSSVM) algorithm. The results show that the method proposed has an average accuracy rate of 98.1864%, 94.7167%, 99.119%, and 99.9593% for predicting the erosion degree of four elbow samples, and 94.0039%. and 81.2976% for two new erosion degrees, which are higher than the nonlinear regression model, LSSVM algorithm, and BP neural network algorithm. This study has guiding significance for real-time monitoring of elbow erosion. [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]

In this paper, we present two systolic array algorithms for efficient Very-Large-Scale Integration (VLSI) implementations of the 1-D Modified Discrete Sine Transform (MDST) using the systolic array architectural paradigm. The new algorithms decompose the computation of the MDST into modular and regular computational structures called pseudo-circular correlation and pseudo-cycle convolution. The two computational structures for pseudo-circular correlation and pseudo-cycle convolution both have the same form. This feature can be exploited to significantly reduce the hardware complexity since the two computational structures can be computed on the same linear systolic array. Moreover, the second algorithm can be used to further reduce the hardware complexity by replacing the general multipliers from the first one with multipliers with a constant that have a significantly reduced complexity. The resulting VLSI architectures have all the advantages of a cycle convolution and circular correlation based systolic implementations, such as high-speed using concurrency, an efficient use of the VLSI technology due to its local and regular interconnection topology, and low I/O cost. Moreover, in both architectures, a cost-effective application of an obfuscation technique can be achieved with low overheads. [ABSTRACT FROM AUTHOR]

In this paper, a multi-focus image fusion algorithm via the distance-weighted regional energy and structure tensor in non-subsampled contourlet transform domain is introduced. The distance-weighted regional energy-based fusion rule was used to deal with low-frequency components, and the structure tensor-based fusion rule was used to process high-frequency components; fused sub-bands were integrated with the inverse non-subsampled contourlet transform, and a fused multi-focus image was generated. We conducted a series of simulations and experiments on the multi-focus image public dataset Lytro; the experimental results of 20 sets of data show that our algorithm has significant advantages compared to advanced algorithms and that it can produce clearer and more informative multi-focus fusion images. [ABSTRACT FROM AUTHOR]

Cloud computing plays an important role in every IT sector. Many tech giants such as Google, Microsoft, and Facebook as deploying their data centres around the world to provide computation and storage services. The customers either submit their job directly or they take the help of the brokers for the submission of the jobs to the cloud centres. The preliminary aim is to reduce the overall power consumption which was ignored in the early days of cloud development. This was due to the performance expectations from cloud servers as they were supposed to provide all the services through their services layers IaaS, PaaS, and SaaS. As time passed and researchers came up with new terminologies and algorithmic architecture for the reduction of power consumption and sustainability, other algorithmic anarchies were also introduced, such as statistical oriented learning and bioinspired algorithms. In this paper, an indepth focus has been done on multiple approaches for migration among virtual machines and find out various issues among existing approaches. The proposed work utilizes elastic scheduling inspired by the smart elastic scheduling algorithm (SESA) to develop a more energy-efficient VM allocation and migration algorithm. The proposed work uses cosine similarity and bandwidth utilization as additional utilities to improve the current performance in terms of QoS. The proposed work is evaluated for overall power consumption and service level agreement violation (SLA-V) and is compared with related state of art techniques. A proposed algorithm is also presented in order to solve problems found during the survey. [ABSTRACT FROM AUTHOR]

Traditional path planning is mainly utilized for path planning in discrete action space, which results in incomplete ship navigation power propulsion strategies during the path search process. Moreover, reinforcement learning experiences low success rates due to its unbalanced sample collection and unreasonable design of reward function. In this paper, an environment framework is designed, which is constructed using the Box2D physics engine and employs a reward function, with the distance between the agent and arrival point as the main, and the potential field superimposed by boundary control, obstacles, and arrival point as the supplement. We also employ the state-of-the-art PPO (Proximal Policy Optimization) algorithm as a baseline for global path planning to address the issue of incomplete ship navigation power propulsion strategy. Additionally, a Beta policy-based distributed sample collection PPO algorithm is proposed to overcome the problem of unbalanced sample collection in path planning by dividing sub-regions to achieve distributed sample collection. The experimental results show the following: (1) The distributed sample collection training policy exhibits stronger robustness in the PPO algorithm; (2) The introduced Beta policy for action sampling results in a higher path planning success rate and reward accumulation than the Gaussian policy at the same training time; (3) When planning a path of the same length, the proposed Beta policy-based distributed sample collection PPO algorithm generates a smoother path than traditional path planning algorithms, such as A*, IDA*, and Dijkstra. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach for network slicing in 5G backhaul networks, targeting services with low or very low latency requirements. We propose a modified A* algorithm that incorporates network quality of service parameters into a composite metric. The algorithm's efficiency outperforms that of Dijkstra's algorithm using a precalculated heuristic function and a real-time monitoring strategy for congestion management. We integrate the algorithm into an SDN module called a path computation element, which computes the optimal path for the network slices. Experimental results show that the proposed algorithm significantly reduces processing time compared to Dijkstra's algorithm, particularly in complex topologies, with an order of magnitude improvement. The algorithm successfully adjusts paths in real-time to meet low latency requirements, preventing packet delay from exceeding the established threshold. The end-to-end measurements using the Speedtest client validate the algorithm's performance in differentiating traffic with and without delay requirements. These results demonstrate the efficacy of our approach in achieving ultra-reliable low-latency communication (URLLC) in 5G backhaul networks. [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]

With the progress of science and technology, artificial intelligence is widely used in various disciplines and has produced amazing results. The research of the target detection algorithm has significantly improved the performance and role of unmanned aerial vehicles (UAVs), and plays an irreplaceable role in preventing forest fires, evacuating crowded people, surveying and rescuing explorers. At this stage, the target detection algorithm deployed in UAVs has been applied to production and life, but making the detection accuracy higher and better adaptability is still the motivation for researchers to continue to study. In aerial images, due to the high shooting height, small size, low resolution and few features, it is difficult to be detected by conventional target detection algorithms. In this paper, the UN-YOLOv5s algorithm can solve the difficult problem of small target detection excellently. The more accurate small target detection (MASD) mechanism is used to greatly improve the detection accuracy of small and medium targets, The multi-scale feature fusion (MCF) path is combined to fuse the semantic information and location information of the image to improve the expression ability of the novel model. The new convolution SimAM residual (CSR) module is introduced to make the network more stable and focused. On the VisDrone dataset, the mean average precision (mAP) of UAV necessity you only look once v5s(UN-YOLOv5s) is 8.4% higher than that of the original algorithm. Compared with the same version, YOLOv5l, the mAP is increased by 2.2%, and the Giga Floating-point Operations Per Second (GFLOPs) is reduced by 65.3%. Compared with the same series of YOLOv3, the mAP is increased by 1.8%, and GFLOPs is reduced by 75.8%. Compared with the same series of YOLOv8s, the detection accuracy of the mAP is improved by 1.1%. [ABSTRACT FROM AUTHOR]

This paper presents a state-of-the-art estimation technique by cross-combining a number n of filters for high-precision, reliable and robust vehicle sideslip angle state estimation, over a full range of vehicle operations irrespective of the driving mission and disruptions that may occur in the system. A machine-learning algorithm based on decision trees connects several filters together to switch between them according to the driving context, ensuring the best possible state estimate for relatively small and large sideslip angle values. In conjunction with the above-mentioned aspects, a seamless transition between different vehicle models is attained by observing the key parameters characterizing the lateral motion of the vehicle. The tests conducted using a prototype vehicle on a snow-covered track confirm the effectiveness and reliability of the proposed approach. [ABSTRACT FROM AUTHOR]

In response to the real-time imaging detection requirements of structural defects in the R region of rib-stiffened wing skin, a defect detection algorithm based on phased-array ultrasonic imaging for wing skin with stiffener is proposed. We select the full-matrix–full-focusing algorithm with the best imaging quality as the prototype for the required detection algorithm. To address the problem of poor real-time performance of the algorithm, a sparsity-based full-focusing algorithm with symmetry redundancy imaging mode is proposed. To address noise artifacts, an adaptive beamforming method and an equal-acoustic-path echo dynamic removal scheme are proposed to adaptively suppress noise artifacts. Finally, within 0.5 s of imaging time, the algorithm achieves a detection sensitivity of 1 mm and a resolution of 0.5 mm within a single-frame imaging range of 30 mm × 30 mm. The defect detection algorithm proposed in this paper combines phased-array ultrasonic technology and post-processing imaging technology to improve the real-time performance and noise artifact suppression of ultrasound imaging algorithms based on engineering applications. Compared with traditional single-element ultrasonic detection technology, phased-array detection technology based on post-processing algorithms has better defect detection and imaging characterization performance and is suitable for R-region structural detection scenarios. [ABSTRACT FROM AUTHOR]

Addressing the challenges of low detection precision and excessive parameter volume presented by the high resolution, significant scale variations, and complex backgrounds in UAV aerial imagery, this paper introduces MFP-YOLO, a lightweight detection algorithm based on YOLOv5s. Initially, a multipath inverse residual module is designed, and an attention mechanism is incorporated to manage the issues associated with significant scale variations and abundant interference from complex backgrounds. Then, parallel deconvolutional spatial pyramid pooling is employed to extract scale-specific information, enhancing multi-scale target detection. Furthermore, the Focal-EIoU loss function is utilized to augment the model's focus on high-quality samples, consequently improving training stability and detection accuracy. Finally, a lightweight decoupled head replaces the original model's detection head, accelerating network convergence speed and enhancing detection precision. Experimental results demonstrate that MFP-YOLO improved the mAP50 on the VisDrone 2019 validation and test sets by 12.9% and 8.0%, respectively, compared to the original YOLOv5s. At the same time, the model's parameter volume and weight size were reduced by 79.2% and 73.7%, respectively, indicating that MFP-YOLO outperforms other mainstream algorithms in UAV aerial imagery detection tasks. [ABSTRACT FROM AUTHOR]

Tungsten heavy alloys (WHAs) are an extremely hard-to-machine material extensively used in demanding applications such as missile liners, aerospace, and optical molds. However, the machining of WHAs remains a challenging task as a result of their high density and elastic stiffness which lead to the deterioration of the machined surface roughness. This paper proposes a brand-new multi-objective dung beetle algorithm. It does not take the cutting parameters (i.e., cutting speed, feed rate, and depth of cut) as the optimization objects but directly optimizes cutting forces and vibration signals monitored using a multi-sensor (i.e., dynamometer and accelerometer). The cutting parameters in the WHA turning process are analyzed through the use of the response surface method (RSM) and the improved dung beetle optimization algorithm. Experimental verification shows that the algorithm has better convergence speed and optimization ability compared with similar algorithms. The optimized forces and vibration are reduced by 9.7% and 46.47%, respectively, and the surface roughness Ra of the machined surface is reduced by 18.2%. The proposed modeling and optimization algorithms are anticipated to be powerful to provide the basis for the parameter optimization in the cutting of WHAs. [ABSTRACT FROM AUTHOR]

Since light propagation in water bodies is subject to absorption and scattering effects, underwater images using only conventional intensity cameras will suffer from low brightness, blurred images, and loss of details. In this paper, a deep fusion network is applied to underwater polarization images; that is, the underwater polarization images are fused with intensity images using the deep learning method. To construct a training dataset, we establish an experimental setup to obtain underwater polarization images and perform appropriate transformations to expand the dataset. Next, an end-to-end learning framework based on unsupervised learning and guided by an attention mechanism is constructed for fusing polarization and light intensity images. The loss function and weight parameters are elaborated. The produced dataset is used to train the network under different loss weight parameters, and the fused images are evaluated based on different image evaluation metrics. The results show that the fused underwater images are more detailed. Compared with light intensity images, the information entropy and standard deviation of the proposed method increase by 24.48% and 139%. The image processing results are better than other fusion-based methods. In addition, the improved U-net network structure is used to extract features for image segmentation. The results show that the target segmentation based on the proposed method is feasible under turbid water. The proposed method does not require manual adjustment of weight parameters, has faster operation speed, and has strong robustness and self-adaptability, which is important for research in vision fields, such as ocean detection and underwater target recognition. [ABSTRACT FROM AUTHOR]

Finding reliable and efficient routes is a persistent problem in megacities. To address this problem, several algorithms have been proposed. However, there are still areas of research that require attention. Many traffic-related problems can be resolved with the help of smart cities that incorporate the Internet of Vehicles (IoV). On the other hand, due to rapid increases in the population and automobiles, traffic congestion has become a serious concern. This paper presents a heterogeneous algorithm called ant-colony optimization with pheromone termite (ACO-PT), which combines two state-of-the-art algorithms, pheromone termite (PT) and ant-colony optimization (ACO), to address efficient routing to improve energy efficiency, increase throughput, and shorten end-to-end latency. The ACO-PT algorithm seeks to provide an effective shortest path from a source to a destination for drivers in urban areas. Vehicle congestion is a severe issue in urban areas. To address this issue, a congestion-avoidance module is added to handle potential overcrowding. Automatic vehicle detection has also been a challenging issue in vehicle management. To address this issue, an automatic-vehicle-detection (AVD) module is employed with ACO-PT. The effectiveness of the proposed ACO-PT algorithm is demonstrated experimentally using network simulator-3 (NS-3) and Simulation of Urban Mobility (SUMO). Our proposed algorithm is compared with three cutting-edge algorithms. The results demonstrate that the proposed ACO-PT algorithm is superior to earlier algorithms in terms of energy usage, end-to-end delay, and throughput. [ABSTRACT FROM AUTHOR]

In the complex environment of orchards, in view of low fruit recognition accuracy, poor real-time and robustness of traditional recognition algorithms, this paper propose an improved fruit recognition algorithm based on deep learning. Firstly, the residual module was assembled with the cross stage parity network (CSP Net) to optimize recognition performance and reduce the computing burden of the network. Secondly, the spatial pyramid pool (SPP) module is integrated into the recognition network of the YOLOv5 to blend the local and global features of the fruit, thus improving the recall rate of the minimum fruit target. Meanwhile, the NMS algorithm was replaced by the Soft NMS algorithm to enhance the ability of identifying overlapped fruits. Finally, a joint loss function was constructed based on focal and CIoU loss to optimize the algorithm, and the recognition accuracy was significantly improved. The test results show that the MAP value of the improved model after dataset training reaches 96.3% in the test set, which is 3.8% higher than the original model. F1 value reaches 91.8%, which is 3.8% higher than the original model. The average detection speed under GPU reaches 27.8 frames/s, which is 5.6 frames/s higher than the original model. Compared with current advanced detection methods such as Faster RCNN and RetinaNet, among others, the test results show that this method has excellent detection accuracy, good robustness and real-time performance, and has important reference value for solving the problem of accurate recognition of fruit in complex environment. [ABSTRACT FROM AUTHOR]

Wide-range application scenarios, such as industrial, medical, rescue, etc., are in various demand for human spatial positioning technology. However, the existing MEMS-based sensor positioning methods have many problems, such as large accuracy errors, poor real-time performance and a single scene. We focused on improving the accuracy of IMU-based both feet localization and path tracing, and analyzed three traditional methods. In this paper, a planar spatial human positioning method based on high-resolution pressure insoles and IMU sensors was improved, and a real-time position compensation method for walking modes was proposed. To validate the improved method, we added two high-resolution pressure insoles to our self-developed motion capture system with a wireless sensor network (WSN) system consisting of 12 IMUs. By multi-sensor data fusion, we implemented dynamic recognition and automatic matching of compensation values for five walking modes, with real-time spatial-position calculation of the touchdown foot, enhancing the 3D accuracy of its practical positioning. Finally, we compared the proposed algorithm with three old methods by statistical analysis of multiple sets of experimental data. The experimental results show that this method has higher positioning accuracy in real-time indoor positioning and path-tracking tasks. The methodology can have more extensive and effective applications in the future. [ABSTRACT FROM AUTHOR]

Due to subjectivity in refereeing, the results of race walking are often questioned. To overcome this limitation, artificial-intelligence-based technologies have demonstrated their potential. The paper aims at presenting WARNING, an inertial-based wearable sensor integrated with a support vector machine algorithm to automatically identify race-walking faults. Two WARNING sensors were used to gather the 3D linear acceleration related to the shanks of ten expert race-walkers. Participants were asked to perform a race circuit following three race-walking conditions: legal, illegal with loss-of-contact and illegal with knee-bent. Thirteen machine learning algorithms, belonging to the decision tree, support vector machine and k-nearest neighbor categories, were evaluated. An inter-athlete training procedure was applied. Algorithm performance was evaluated in terms of overall accuracy, F1 score and G-index, as well as by computing the prediction speed. The quadratic support vector was confirmed to be the best-performing classifier, achieving an accuracy above 90% with a prediction speed of 29,000 observations/s when considering data from both shanks. A significant reduction of the performance was assessed when considering only one lower limb side. The outcomes allow us to affirm the potential of WARNING to be used as a referee assistant in race-walking competitions and during training sessions. [ABSTRACT FROM AUTHOR]

In RSSI-based indoor visible light positioning systems, when only RSSI is used for trilateral positioning, the receiver height needs to be known to calculate distance. Meanwhile, the positioning accuracy is greatly affected by multi-path effect interference, with the influence of the multi-path effect varying across different areas of the room. If only one single processing is used for positioning, the positioning error in the edge area will increase sharply. In order to address these problems, this paper proposes a new positioning scheme, which uses artificial intelligence algorithms for point classification. Firstly, height estimation is performed according to the received power data structure from different LEDs, which effectively extends the traditional RSSI trilateral positioning from 2D to 3D. The location points in the room are then divided into three categories: ordinary points, edge points and blind points, and corresponding models are used to process different types of points, respectively, to reduce the influence of the multi-path effect. Next, processed received power data are used in the trilateral positioning method for calculating the location point coordinates, and to reduce the room edge corner positioning error, so as to reduce the indoor average positioning error. Finally, a complete system is built in an experimental simulation to verify the effectiveness of the proposed schemes, which are shown to achieve centimeter-level positioning accuracy. [ABSTRACT FROM AUTHOR]

This paper considers the problem of estimating the parameters of a frequency-hopping signal under non-cooperative conditions. To make the estimation of different parameters independently of each other, a compressed domain frequency-hopping signal parameter estimation algorithm based on the improved atomic dictionary is proposed. By segmenting and compressive sampling the received signal, the center frequency of each signal segment is estimated using the maximum dot product. The signal segments are processed with central frequency variation using the improved atomic dictionary to accurately estimate the hopping time. We highlight that one superiority of the proposed algorithm is that high-resolution center frequency estimation can be directly obtained without reconstructing the frequency-hopping signal. Additionally, another superiority of the proposed algorithm is that hopping time estimation has nothing to do with center frequency estimation. Numerical results show that the proposed algorithm can achieve superior performance compared with the competing method. [ABSTRACT FROM AUTHOR]

The use of Riemannian geometry decoding algorithms in classifying electroencephalography-based motor-imagery brain–computer interfaces (BCIs) trials is relatively new and promises to outperform the current state-of-the-art methods by overcoming the noise and nonstationarity of electroencephalography signals. However, the related literature shows high classification accuracy on only relatively small BCI datasets. The aim of this paper is to provide a study of the performance of a novel implementation of the Riemannian geometry decoding algorithm using large BCI datasets. In this study, we apply several Riemannian geometry decoding algorithms on a large offline dataset using four adaptation strategies: baseline, rebias, supervised, and unsupervised. Each of these adaptation strategies is applied in motor execution and motor imagery for both scenarios 64 electrodes and 29 electrodes. The dataset is composed of four-class bilateral and unilateral motor imagery and motor execution of 109 subjects. We run several classification experiments and the results show that the best classification accuracy is obtained for the scenario where the baseline minimum distance to Riemannian mean has been used. The mean accuracy values up to 81.5% for motor execution, and up to 76.4% for motor imagery. The accurate classification of EEG trials helps to realize successful BCI applications that allow effective control of devices. [ABSTRACT FROM AUTHOR]

The counting of surgical instruments is an important task to ensure surgical safety and patient health. However, due to the uncertainty of manual operations, there is a risk of missing or miscounting instruments. Applying computer vision technology to the instrument counting process can not only improve efficiency, but also reduce medical disputes and promote the development of medical informatization. However, during the counting process, surgical instruments may be densely arranged or obstruct each other, and they may be affected by different lighting environments, all of which can affect the accuracy of instrument recognition. In addition, similar instruments may have only minor differences in appearance and shape, which increases the difficulty of identification. To address these issues, this paper improves the YOLOv7x object detection algorithm and applies it to the surgical instrument detection task. First, the RepLK Block module is introduced into the YOLOv7x backbone network, which can increase the effective receptive field and guide the network to learn more shape features. Second, the ODConv structure is introduced into the neck module of the network, which can significantly enhance the feature extraction ability of the basic convolution operation of the CNN and capture more rich contextual information. At the same time, we created the OSI26 data set, which contains 452 images and 26 surgical instruments, for model training and evaluation. The experimental results show that our improved algorithm exhibits higher accuracy and robustness in surgical instrument detection tasks, with F1, AP, AP50, and AP75 reaching 94.7%, 91.5%, 99.1%, and 98.2%, respectively, which are 4.6%, 3.1%, 3.6%, and 3.9% higher than the baseline. Compared to other mainstream object detection algorithms, our method has significant advantages. These results demonstrate that our method can more accurately identify surgical instruments, thereby improving surgical safety and patient health. [ABSTRACT FROM AUTHOR]

Path coverage attracts many interests in some scenarios, such as object tracing in sensor networks. However, the problem of how to conserve the constrained energy of sensors is rarely considered in existing research. This paper studies two problems in the energy conservation of sensor networks that have not been addressed before. The first problem is called the least movement of nodes on path coverage. It first proves the problem as NP-hard, and then uses curve disjunction to separate each path into some discrete points, and ultimately moves nodes to new positions under some heuristic regulations. The utilized curve disjunction technique makes the proposed mechanism unrestricted by the linear path. The second problem is called the largest lifetime on path coverage. It first separates all nodes into independent partitions by utilizing the method of largest weighted bipartite matching, and then schedules these partitions to cover all paths in the network by turns. We eventually analyze the energy cost of the two proposed mechanisms, and evaluate the effects of some parameters on performance through extensive experiments, respectively. [ABSTRACT FROM AUTHOR]

The presence of manufacture error in large mirrors introduces high-order aberrations, which can severely influence the intensity distribution of point spread function. Therefore, high-resolution phase diversity wavefront sensing is usually needed. However, high-resolution phase diversity wavefront sensing is restricted with the problem of low efficiency and stagnation. This paper proposes a fast high-resolution phase diversity method with limited memory Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) algorithm, which can accurately detect aberrations in the presence of high-order aberrations. An analytical gradient of the objective function for phase-diversity is integrated into the framework of the L-BFGS nonlinear optimization algorithm. L-BFGS algorithm is specifically suitable for high-resolution wavefront sensing where a large phase matrix is optimized. The performance of phase diversity with L-BFGS is compared to other iterative method through simulations and a real experiment. This work contributes to fast high-resolution image-based wavefront sensing with a high robustness. [ABSTRACT FROM AUTHOR]

Due to the development of wireless network technology, various applications relying on good network quality are widely used on mobile devices. Taking the commonly used video streaming service as an example, a network with high throughput and low packet loss rate can meet the service requirements. When the moving distance of the mobile device is greater than the signal coverage of the AP, it will trigger the handover process to connect to another AP, and cause the network to disconnect and reconnect instantaneously. However, frequently triggering the handover procedure will cause a significant drop in network performance and affect the operation of application services. In order to solve this problem, this paper proposes the OHA and OHAQR. The OHA considers whether the signal quality is good or bad, and uses the corresponding HM method to solve the problem of frequent handover procedures. The OHAQR integrates the QoS requirements of the throughput and packet loss rate into the OHA with the Q-handover score, to provide high-performance handover services with QoS. Our experimental results show that the OHA and OHAQR have 13 and 15 handovers in a high-density scenario, respectively, and are better than the other two methods. The actual throughput and packet loss rate of the OHAQR are 123 Mbps and 5%, respectively, and the network performance is better than that of other methods. The proposed method shows excellent performance in ensuring the network QoS requirements and reducing the number of handover procedures. [ABSTRACT FROM AUTHOR]

In this paper, we discuss a practice of potential cosmic ray detection using off-the-shelves CMOS cameras. We discuss and presents the limitations of up-to-date hardware and software approaches to this task. We also present a hardware solution that we made for long-term testing of algorithms for potential cosmic ray detection. We have also proposed, implemented and tested a novel algorithm that enables real-time processing of image frames acquired by CMOS cameras in order to detect tracks of potential particles. We have compared our results with already published results and obtained acceptable results overcoming some limitation of already existing algorithms. Both source codes and data are available to download. [ABSTRACT FROM AUTHOR]

Real-time hybrid testing (RTH) is a test method for dynamic loading performance evaluation of structures, which is divided into digital simulation and physical testing, but the integration of the two may lead to problems such as time lag, large errors, and slow response time. The electro-hydraulic servo displacement system, as the transmission system of the physical test structure, directly affects the operational performance of RTH. Improving the performance of the electro-hydraulic servo displacement control system has become the key to solving the problem of RTH. In this paper, the FF-PSO-PID algorithm is proposed to control the electro-hydraulic servo system in real-time hybrid testing (RTH), which uses the PSO algorithm to operate the optimized PID parameters and the feed-forward compensation algorithm to compensate the displacement. First, the mathematical model of the electro-hydraulic displacement servo system in RTH is presented and the actual parameters are determined. Then, the objective evaluation function of the PSO algorithm is proposed to optimize the PID parameters in the context of RTH operation, and a displacement feed-forward compensation algorithm is added for theoretical study. To verify the effectiveness of the method, joint simulations were performed in Matlab/Simulink to compare and test FF-PSO-PID, PSO-PID, and conventional PID (PID) under different input signals. The results show that the proposed FF-PSO-PID algorithm effectively improves the accuracy and response speed of the electro-hydraulic servo displacement system and solves the problems of RTH time lag, large error, and slow response. [ABSTRACT FROM AUTHOR]

Single-pixel imaging (SPI) uses a single-pixel detector instead of a detector array with a lot of pixels in traditional imaging techniques to realize two-dimensional or even multi-dimensional imaging. For SPI using compressed sensing, the target to be imaged is illuminated by a series of patterns with spatial resolution, and then the reflected or transmitted intensity is compressively sampled by the single-pixel detector to reconstruct the target image while breaking the limitation of the Nyquist sampling theorem. Recently, in the area of signal processing using compressed sensing, many measurement matrices as well as reconstruction algorithms have been proposed. It is necessary to explore the application of these methods in SPI. Therefore, this paper reviews the concept of compressive sensing SPI and summarizes the main measurement matrices and reconstruction algorithms in compressive sensing. Further, the performance of their applications in SPI through simulations and experiments is explored in detail, and then their advantages and disadvantages are summarized. Finally, the prospect of compressive sensing with SPI is discussed. [ABSTRACT FROM AUTHOR]

This paper presents novel current sensorless maximum-power point-tracking (MPPT) algorithms based on compensators/controllers and a single-input voltage sensor. The proposed MPPTs eliminate the expensive and noisy current sensor, which can significantly reduce the system cost and retain the advantages of the widely used MPPT algorithms, such as Incremental Conductance (IC) and Perturb and Observe (P&O) algorithms. Additionally, it is verified that the proposed algorithms, especially the proposed Current Sensorless V based on PI, can reach outstanding tracking factors (TFs) such as the IC and P&O based on PI algorithms. In this sense, the insertion of controllers inside the MPPT gives them adaptive characteristics, and the experimental TFs are in the remarkable range of more than 99%, with an average yield of 99.51% and a peak of 99.80%. [ABSTRACT FROM AUTHOR]

An efficient and more accurate millimeter-wave imaging algorithm, applied to a close-range monostatic personnel screening system, with consideration of dual path propagation loss, is presented in this paper. The algorithm is developed in accordance with a more rigorous physical model for the monostatic system. The physical model treats incident waves and scattered waves as spherical waves with a more rigorous amplitude term as per electromagnetic theory. As a result, the proposed method can achieve a better focusing effect for multiple targets in different range planes. Since the mathematical methods in classical algorithms, such as spherical wave decomposition and Weyl identity, cannot handle the corresponding mathematical model, the proposed algorithm is derived through the method of stationary phase (MSP). The algorithm has been validated by numerical simulations and laboratory experiments. Good performance in terms of computational efficiency and accuracy has been observed. The synthetic reconstruction results show that the proposed algorithm has significant advantages compared with the classical algorithms, and the reconstruction by using full-wave data generated by FEKO further verifies the validity of the proposed algorithm. Finally, the proposed algorithm performs as expected over real data acquired by our laboratory prototype. [ABSTRACT FROM AUTHOR]

Intrusion detection systems (IDS) play a crucial role in securing networks and identifying malicious activity. This is a critical problem in cyber security. In recent years, metaheuristic optimization algorithms and deep learning techniques have been applied to IDS to improve their accuracy and efficiency. Generally, optimization algorithms can be used to boost the performance of IDS models. Deep learning methods, such as convolutional neural networks, have also been used to improve the ability of IDS to detect and classify intrusions. In this paper, we propose a new IDS model based on the combination of deep learning and optimization methods. First, a feature extraction method based on CNNs is developed. Then, a new feature selection method is used based on a modified version of Growth Optimizer (GO), called MGO. We use the Whale Optimization Algorithm (WOA) to boost the search process of the GO. Extensive evaluation and comparisons have been conducted to assess the quality of the suggested method using public datasets of cloud and Internet of Things (IoT) environments. The applied techniques have shown promising results in identifying previously unknown attacks with high accuracy rates. The MGO performed better than several previous methods in all experimental comparisons. [ABSTRACT FROM AUTHOR]

Modal-free optimization algorithms do not require specific mathematical models, and they, along with their other benefits, have great application potential in adaptive optics. In this study, two different algorithms, the single-dimensional perturbation descent algorithm (SDPD) and the second-order stochastic parallel gradient descent algorithm (2SPGD), are proposed for wavefront sensorless adaptive optics, and a theoretical analysis of the algorithms' convergence rates is presented. The results demonstrate that the single-dimensional perturbation descent algorithm outperforms the stochastic parallel gradient descent (SPGD) and 2SPGD algorithms in terms of convergence speed. Then, a 32-unit deformable mirror is constructed as the wavefront corrector, and the SPGD, single-dimensional perturbation descent, and 2SPSA algorithms are used in an adaptive optics numerical simulation model of the wavefront controller. Similarly, a 39-unit deformable mirror is constructed as the wavefront controller, and the SPGD and single-dimensional perturbation descent algorithms are used in an adaptive optics experimental verification device of the wavefront controller. The outcomes demonstrate that the convergence speed of the algorithm developed in this paper is more than twice as fast as that of the SPGD and 2SPGD algorithms, and the convergence accuracy of the algorithm is 4% better than that of the SPGD algorithm. [ABSTRACT FROM AUTHOR]

Structural health monitoring (SHM) systems are used to analyze the health of infrastructures such as bridges, using data from various types of sensors. While SHM systems consist of various stages, feature extraction and pattern recognition steps are the most important. Consequently, signal processing techniques in the feature extraction stage and machine learning algorithms in the pattern recognition stage play an effective role in analyzing the health of bridges. In other words, there exists a plethora of signal processing techniques and machine learning algorithms, and the selection of the appropriate technique/algorithm is guided by the limitations of each technique/algorithm. The selection also depends on the requirements of SHM in terms of damage identification level and operating conditions. This has provided the motivation to conduct a Systematic literature review (SLR) of feature extraction techniques and pattern recognition algorithms for the structural health monitoring of bridges. The existing literature reviews describe the current trends in the field with different focus aspects. However, a systematic literature review that presents an in-depth comparative study of different applications of machine learning algorithms in the field of SHM of bridges does not exist. Furthermore, there is a lack of analytical studies that investigate the SHM systems in terms of several design considerations including feature extraction techniques, analytical approaches (classification/ regression), operational functionality levels (diagnosis/prognosis) and system implementation techniques (data-driven/model-based). Consequently, this paper identifies 45 recent research practices (during 2016–2023), pertaining to feature extraction techniques and pattern recognition algorithms in SHM for bridges through an SLR process. First, the identified research studies are classified into three different categories: supervised learning algorithms, neural networks and a combination of both. Subsequently, an in-depth analysis of various machine learning algorithms is performed in each category. Moreover, the analysis of selected research studies (total = 45) in terms of feature extraction techniques is made, and 25 different techniques are identified. Furthermore, this article also explores other design considerations like analytical approaches in the pattern recognition process, operational functionality and system implementation. It is expected that the outcomes of this research may facilitate the researchers and practitioners of the domain during the selection of appropriate feature extraction techniques, machine learning algorithms and other design considerations according to the SHM system requirements. [ABSTRACT FROM AUTHOR]

Accurate recognition of the flowering stage is a prerequisite for flower yield estimation. In order to improve the recognition accuracy based on the complex image background, such as flowers partially covered by leaves and flowers with insignificant differences in various fluorescence, this paper proposed an improved CR-YOLOv5s to recognize flower buds and blooms for chrysanthemums by emphasizing feature representation through an attention mechanism. The coordinate attention mechanism module has been introduced to the backbone of the YOLOv5s so that the network can pay more attention to chrysanthemum flowers, thereby improving detection accuracy and robustness. Specifically, we replaced the convolution blocks in the backbone network of YOLOv5s with the convolution blocks from the RepVGG block structure to improve the feature representation ability of YOLOv5s through a multi-branch structure, further improving the accuracy and robustness of detection. The results showed that the average accuracy of the improved CR-YOLOv5s was as high as 93.9%, which is 4.5% better than that of normal YOLOv5s. This research provides the basis for the automatic picking and grading of flowers, as well as a decision-making basis for estimating flower yield. [ABSTRACT FROM AUTHOR]

When performing robotic automatic sorting and assembly operations of multi-category hardware, there are some problems with the existing convolutional neural network visual recognition algorithms, such as large computing power consumption, low recognition efficiency, and a high rate of missed detection and false detection. A novel efficient convolutional neural algorithm for multi-category aliasing hardware recognition is proposed in this paper. On the basis of SSD, the novel algorithm uses Resnet-50 instead of VGG16 as the backbone feature extraction network, and it integrates ECA-Net and Improved Spatial Attention Block (ISAB): two attention mechanisms to improve the ability of learning and extract target features. Then, we pass the weighted features to extra feature layers to build an improved SSD algorithm. At last, in order to compare the performance difference between the novel algorithm and the existing algorithms, three kinds of hardware with different sizes are chosen to constitute an aliasing scene that can simulate an industrial site, and some comparative experiments have been completed finally. The experimental results show that the novel algorithm has an mAP of 98.20% and FPS of 78, which are better than Faster R-CNN, YOLOv4, YOLOXs, EfficientDet-D1, and original SSD in terms of comprehensive performance. The novel algorithm proposed in this paper can improve the efficiency of robotic sorting and assembly of multi-category hardware. [ABSTRACT FROM AUTHOR]

To address the problem of expensive computation in traditional two-dimensional (2D) direction of arrival (DOA) estimation, in this paper, we propose a 2D DOA estimation method based on a reduced dimension and root-finding MUSIC algorithm for nested planar arrays (NPAs). Specifically, the algorithm proposed in this paper transforms the problem based on 2D spectral peak search into two one-dimensional estimation problems by reducing the dimension, and then transforms the one-dimensional estimation problem into a problem of polynomial root finding. Finally the parameters are paired to realize the 2D DOA estimation. The proposed algorithm not only performs two root finding operations directly according to the 2D spectral function transformation, avoiding the performance degradation caused by intermediate operations, but can also fully exploit the enlarged array aperture offered by NPAs with reduced computational complexity and no need for virtualization. The superiorities of the proposed algorithm in terms of estimation accuracy and complexity are verified by simulations. [ABSTRACT FROM AUTHOR]