Search

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]

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]

In order to make the grid-connected composite device (GCCD) controller meet the requirements of different operating modes and complex working conditions of power grid, this paper proposes to introduce sliding mode control (SMC) into GCCD controller. Firstly, the mathematical model of MMC converter is established, and the sliding mode controller is designed based on the SMC principle. Then, aiming at the problems of complex controller structure and difficult parameter tuning in multiple modes of the GCCD, this paper proposes a controller parameter optimization method based on improved Month Flame optimization (IMFO) algorithm. This method improves the MFO algorithm by introducing good point set (GPS) initialization and Levy flight strategy, which accelerates the convergence speed of the algorithm while avoiding falling into local optimization, and realizes the optimization of converter controller parameters. Under a variety of standard test functions, the advantages of the proposed IMFO algorithm are verified by comparing it with the traditional algorithm. Finally, in order to realize the automatic tuning of control parameters, the Python–PSCAD joint simulation method is studied and implemented. Taking the comprehensive integral of time and absolute error (CITAE) index as the objective function, the parameters of the sliding mode controller are optimized. The simulation results show that the controller parameters optimized by the IMFO algorithm can make the GCCD have better dynamic performance. [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]

Traditional unidirectional power systems that produce large-scale electricity and supply it using an ultra-high voltage power grid are changing globally to increase efficiency. Current substations' protection relays rely only on internal substation data, where they are located, to detect changes. However, to more accurately detect changes in the system, various data from several external substations, including micro-grids, are required. As such, communication technology regarding data acquisition has become an essential function for next-generation substations. Data aggregators that use the GOOSE protocol to collect data inside substations in real-time have been developed, but data acquisition from external substations is challenging in terms of cost and security, so only internal substation data are used. This paper proposes the acquisition of data from external substations by applying security to R-GOOSE, defined in the IEC 61850 standard, over a public internet network. This paper also develops a data aggregator based on R-GOOSE, showing data acquisition results. [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]

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]

The mobile node location method can find unknown nodes in real time and capture the movement trajectory of unknown nodes in time, which has attracted more and more attention from researchers. Due to their advantages of simplicity and efficiency, intelligent optimization algorithms are receiving increasing attention. Compared with other algorithms, the black hole algorithm has fewer parameters and a simple structure, which is more suitable for node location in wireless sensor networks. To address the problems of weak merit-seeking ability and slow convergence of the black hole algorithm, this paper proposed an opposition-based learning black hole (OBH) algorithm and utilized it to improve the accuracy of the mobile wireless sensor network (MWSN) localization. To verify the performance of the proposed algorithm, this paper tests it on the CEC2013 test function set. The results indicate that among the several algorithms tested, the OBH algorithm performed the best. In this paper, several optimization algorithms are applied to the Monte Carlo localization algorithm, and the experimental results show that the OBH algorithm can achieve the best optimization effect in advance. [ABSTRACT FROM AUTHOR]

In the field of AGV, a path planning algorithm is always a heated area. However, traditional path planning algorithms have many disadvantages. To solve these problems, this paper proposes a fusion algorithm that combines the kinematical constraint A* algorithm and the following dynamic window approach algorithm. The kinematical constraint A* algorithm can plan the global path. Firstly, the node optimization can reduce the number of child nodes. Secondly, improving the heuristic function can increase efficiency of path planning. Thirdly, the secondary redundancy can reduce the number of redundant nodes. Finally, the B spline curve can make the global path conform to the dynamic characteristics of AGV. The following DWA algorithm can be dynamic path planning and allow the AGV to avoidance moving obstacle. The optimization heuristic function of the local path is closer to the global optimal path. The simulation results show that, compared with the fusion algorithm of traditional A* algorithm and traditional DWA algorithm, the fusion algorithm reduces the length of path by 3.6%, time of path by 6.7% and the number of turns of final path by 25%. [ABSTRACT FROM AUTHOR]

Accurately assessing the geometric features of curvilinear structures on images is of paramount importance in many vision-based measurement systems targeting technological fields such as quality control, defect analysis, biomedical, aerial, and satellite imaging. This paper aims at laying the basis for the development of fully automated vision-based measurement systems targeting the measurement of elements that can be treated as curvilinear structures in the resulting image, such as cracks in concrete elements. In particular, the goal is to overcome the limitation of exploiting the well-known Steger's ridge detection algorithm in these applications because of the manual identification of the input parameters characterizing the algorithm, which are preventing its extensive use in the measurement field. This paper proposes an approach to make the selection phase of these input parameters fully automated. The metrological performance of the proposed approach is discussed. The method is demonstrated on both synthesized and experimental data. [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]

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]

In the work reported in this paper, a lost-in-space star pattern identification algorithm for agile spacecraft was studied. Generally, the operation of a star tracker is known to exhibit serious degradation or even failure during fast attitude maneuvers. While tracking methods are widely used solutions to handle the dynamic conditions, they require prior information about the initial orientation. Therefore, the tracking methods may not be adequate for autonomy of attitude and control systems. In this paper a novel autonomous identification method for dynamic conditions is proposed. Additional constraints are taken into account that can significantly decrease the number of stars imaged and the centroid accuracy. A strategy combining two existing classes for star pattern identification is proposed. The new approach is intended to provide a unique way to determine the identity of stars that promises robustness against noise and rapid identification. Moreover, representative algorithms implemented in actual space applications were utilized as counterparts to analyze the performance of the proposed method in various scenarios. Numerical simulations show that the proposed method is not only highly robust against positional noise and false stars, but also guarantees fast run-time, which is appropriate for high-speed applications. [ABSTRACT FROM AUTHOR]

With the proliferation of unmanned aerial vehicles (UAVs) in both commercial and military use, the public is paying increasing attention to UAV identification and regulation. The micro-Doppler characteristics of a UAV can reflect its structure and motion information, which provides an important reference for UAV recognition. The low flight altitude and small radar cross-section (RCS) of UAVs make the cancellation of strong ground clutter become a key problem in extracting the weak micro-Doppler signals. In this paper, a clutter suppression method based on an orthogonal matching pursuit (OMP) algorithm is proposed, which is used to process echo signals obtained by a linear frequency modulated continuous wave (LFMCW) radar. The focus of this method is on the idea of sparse representation, which establishes a complete set of environmental clutter dictionaries to effectively suppress clutter in the received echo signals of a hovering UAV. The processed signals are analyzed in the time–frequency domain. According to the flicker phenomenon of UAV rotor blades and related micro-Doppler characteristics, the feature parameters of unknown UAVs can be estimated. Compared with traditional signal processing methods, the method based on OMP algorithm shows advantages in having a low signal-to-noise ratio (−10 dB). Field experiments indicate that this approach can effectively reduce clutter power (−15 dB) and successfully extract micro-Doppler signals for identifying different UAVs. [ABSTRACT FROM AUTHOR]

Simultaneous localization and mapping (SLAM) algorithms are widely applied in fields such as autonomous driving and target tracking. However, the effect of moving objects on localization and mapping remains a challenge in natural dynamic scenarios. To overcome this challenge, this paper proposes an algorithm for dynamic point cloud detection that fuses laser and visual identification data, the multi-stage moving object identification algorithm (MoTI). The MoTI algorithm consists of two stages: rough processing and precise processing. In the rough processing stage, a statistical method is employed to preliminarily detect dynamic points based on the range image error of the point cloud. In the precise processing stage, the radius search strategy is used to statistically test the nearest neighbor points. Next, visual identification information and point cloud registration results are fused using a method of statistics and information weighting to construct a probability model for identifying whether a point cloud cluster originates from a moving object. The algorithm is integrated into the front-end of the LOAM system, which significantly improves the localization accuracy. The MoTI algorithm is evaluated on an actual indoor dynamic environment and several KITTI datasets, and the results demonstrate its ability to accurately detect dynamic targets in the background and improve the localization accuracy of the robot. [ABSTRACT FROM AUTHOR]

In structural vibration response sensing, mobile sensors offer outstanding benefits as they are not dedicated to a certain structure; they also possess the ability to acquire dense spatial information. Currently, most of the existing literature concerning mobile sensing involves human drivers manually driving through the bridges multiple times. While self-driving automated vehicles could serve for such studies, they might entail substantial costs when applied to structural health monitoring tasks. Therefore, in order to tackle this challenge, we introduce a formation control framework that facilitates automatic multi-agent mobile sensing. Notably, our findings demonstrate that the proposed formation control algorithm can effectively control the behavior of the multi-agent systems for structural response sensing purposes based on user choice. We leverage vibration data collected by these mobile sensors to estimate the full-field vibration response of the structure, utilizing a compressive sensing algorithm in the spatial domain. The task of estimating the full-field response can be represented as a spatiotemporal response matrix completion task, wherein the suite of multi-agent mobile sensors sparsely populates some of the matrix's elements. Subsequently, we deploy the compressive sensing technique to obtain the dense full-field vibration complete response of the structure and estimate the reconstruction accuracy. Results obtained from two different formations on a simply supported bridge are presented in this paper, and the high level of accuracy in reconstruction underscores the efficacy of our proposed framework. This multi-agent mobile sensing approach showcases the significant potential for automated structural response measurement, directly applicable to health monitoring and resilience assessment objectives. [ABSTRACT FROM AUTHOR]

Many animal aggregations display remarkable collective coordinated movements on a large scale, which emerge as a result of distributed local decision-making by individuals. The recent advances in modelling the collective motion of animals through the utilisation of Nearest Neighbour rules, without the need for centralised coordination, resulted in the development of self-deployment algorithms in Mobile Sensor Networks (MSNs) to achieve various types of coverage essential for different applications. However, the energy consumption associated with sensor movement to achieve the desired coverage remains a significant concern for the majority of algorithms reported in the literature. In this paper, the Nearest Neighbour Node Deployment (NNND) algorithm is proposed to efficiently provide blanket coverage across a given area while minimising energy consumption and enhancing fault tolerance. In contrast to other algorithms that sequentially move sensors, NNND leverages the power of parallelism by employing multiple streams of sensor motions, each directed towards a distinct section of the area. The cohesion of each stream is maintained by adaptively choosing a leader for each stream while collision avoidance is also ensured. These properties contribute to minimising the travel distance within each stream, resulting in decreased energy consumption. Additionally, the utilisation of multiple leaders in NNND eliminates the presence of a single point of failure, hence enhancing the fault tolerance of the area coverage. The results of our extensive simulation study demonstrate that NNND not only achieves lower energy consumption but also a higher percentage of k-coverage. [ABSTRACT FROM AUTHOR]

The popularity of video services such as video call or video on-demand has made it impossible for people to live without them in their daily lives. It can be anticipated that the explosive growth of vehicular communication owing to the widespread use of in-vehicle video infotainment applications in the future will result in increasing fragmentation and congestion of the wireless transmission spectrum. Accordingly, effective bandwidth management algorithms are demanded to achieve efficient communication and stable scalability in next-generation vehicular networks. To the best of our current knowledge, a noticeable gap remains in the existing literature regarding the application of the latest advancements in network communication technologies. Specifically, this gap is evident in the lack of exploration regarding how cutting-edge technologies can be effectively employed to optimize bandwidth allocation, especially in the realm of video service applications within the forthcoming vehicular networks. In light of this void, this paper presents a seamless integration of cutting-edge 6G communication technologies, such as terahertz (THz) and visible light communication (VLC), with the existing 5G millimeter-wave and sub-6 GHz base stations. This integration facilitates the creation of a network environment characterized by high transmission rates and extensive coverage. Our primary aim is to ensure the uninterrupted playback of real-time video applications for vehicle users. These video applications encompass video conferencing, live video, and on-demand video services. The outcomes of our simulations convincingly indicate that the proposed strategy adeptly addresses the challenge of bandwidth competition among vehicle users. Moreover, it notably boosts the efficient utilization of bandwidth from less crowded base stations, optimizes the fulfillment of bandwidth prerequisites for various video applications, and elevates the overall video quality experienced by users. Consequently, our findings serve as a successful validation of the practicality and effectiveness of the proposed methodology. [ABSTRACT FROM AUTHOR]

The pursuit of higher recognition accuracy and speed with smaller model sizes has been a major research topic in the detection of surface defects in steel. In this paper, we propose an improved high-speed and high-precision Efficient Fusion Coordination network (EFC-YOLO) without increasing the model's size. Since modifications to enhance feature extraction in shallow networks tend to affect the speed of model inference, in order to simultaneously ensure the accuracy and speed of detection, we add the improved Fusion-Faster module to the backbone network of YOLOv7. Partial Convolution (PConv) serves as the basic operator of the module, which strengthens the feature-extraction ability of shallow networks while maintaining speed. Additionally, we incorporate the Shortcut Coordinate Attention (SCA) mechanism to better capture the location information dependency, considering both lightweight design and accuracy. The de-weighted Bi-directional Feature Pyramid Network (BiFPN) structure used in the neck part of the network improves the original Path Aggregation Network (PANet)-like structure by adding step branches and reducing computations, achieving better feature fusion. In the experiments conducted on the NEU-DET dataset, the final model achieved an 85.9% mAP and decreased the GFLOPs by 60%, effectively balancing the model's size with the accuracy and speed of detection. [ABSTRACT FROM AUTHOR]

As Mobile Communication and Internet Systems (MCIS) have rapidly developed, security issues related to MCIS have become increasingly important. Therefore, the development and research of security technologies for mobile communication and internet systems are actively being conducted. Hash-Based Signature (HBS) uses a hash function to construct a digital signature scheme, where its security is guaranteed by the collision resistance of the hash function used. To provide sufficient security in the post-quantum environment, the length of hash should be satisfied for the security requirement. Modern HBS can be classified into stateful and stateless schemes. Two representative stateful and stateless HBS are eXtended Merkle Signature Scheme(XMSS) and SPHINCS + , respectively. In this paper, we propose two HBS schemes: K-XMSS and K-SPHINCS + , which replace internal hash functions of XMSS and SPHINCS + with Korean cryptography algorithms. K-XMSS is a stateful signature, while K-SPHINCS + is its stateless counterpart. We showcase the reference implementation of K-XMSS and K-SPHINCS + employing Lightweight Secure Hash (LSH) and two hash functions based on block ciphers (i.e., CHAM and LEA) as the internal hash function. In addition, K-XMSS and K-SPHINCS + using Advanced Vector Extensions 2 (AVX2) have been provided, demonstrating that they can be optimized for better performance using advanced implementation techniques than previous approaches. [ABSTRACT FROM AUTHOR]

Currently, most chemical transmission equipment relies on bearings to support rotating shafts and to transmit power. However, bearing defects can lead to a series of failures in the equipment, resulting in reduced production efficiency. To prevent such occurrences, this paper proposes an improved bearing defect detection algorithm based on YOLOv5. Firstly, to mitigate the influence of the similarity between bearing defects and non-defective regions on the detection performance, gamma transformation is introduced in the preprocessing stage of the model to adjust the image's grayscale and contrast. Secondly, to better capture the details and semantic information of the defects, this approach incorporates the ResC2Net model with a residual-like structure during the feature-extraction stage, enabling more nonlinear transformations and channel interaction operations so as to enhance the model's perception and representation capabilities of the defect targets. Additionally, PConv convolution is added in the feature fusion part to increase the network depth and better capture the detailed information of defects while maintaining time complexity. The experimental results demonstrate that the GRP-YOLOv5 model achieves a mAP@0.5 of 93.5%, a mAP@0.5:0.95 of 52.7%, and has a model size of 25 MB. Compared to other experimental models, GRP-YOLOv5 exhibits excellent performance in bearing defect detection accuracy. However, the model's FPS (frames per second) performance is not satisfactory. Despite its small size of 25 MB, the processing speed is relatively slow, which may have some impact on real-time or high-throughput applications. This limitation should be considered in future research and in the optimization efforts to improve the overall performance of the model. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) has transformed our interaction with technology and introduced security challenges. The growing number of IoT attacks poses a significant threat to organizations and individuals. This paper proposes an approach for detecting attacks on IoT networks using ensemble feature selection and deep learning models. Ensemble feature selection combines filter techniques such as variance threshold, mutual information, Chi-square, ANOVA, and L1-based methods. By leveraging the strengths of each technique, the ensemble is formed by the union of selected features. However, this union operation may overlook redundancy and irrelevance, potentially leading to a larger feature set. To address this, a wrapper algorithm called Recursive Feature Elimination (RFE) is applied to refine the feature selection. The impact of the selected feature set on the performance of Deep Learning (DL) models (CNN, RNN, GRU, and LSTM) is evaluated using the IoT-Botnet 2020 dataset, considering detection accuracy, precision, recall, F1-measure, and False Positive Rate (FPR). All DL models achieved the highest detection accuracy, precision, recall, and F1 measure values, ranging from 97.05% to 97.87%, 96.99% to 97.95%, 99.80% to 99.95%, and 98.45% to 98.87%, respectively. [ABSTRACT FROM AUTHOR]

In this paper, we propose a combined filtering method rooted in the application of the Sage–Husa Adaptive Kalman filtering, designed specifically to process wave sensor data. This methodology aims to boost the measurement precision and real-time performance of wave parameters. (1) This study delineates the basic principles of the Kalman filter. (2) We discuss in detail the methodology for analyzing wave parameters from the collected wave acceleration data, and deeply study the key issues that may arise during this process. (3) To evaluate the efficacy of the Kalman filter, we have designed a simulation comparison encompassing various filtering algorithms. The results show that the Sage–Husa Adaptive Kalman Composite filter demonstrates superior performance in processing wave sensor data. (4) Additionally, in Chapter 5, we designed a turntable experiment capable of simulating the sinusoidal motion of waves and carried out a detailed errors analysis associated with the Kalman filter, to facilitate a deep understanding of potential problems that may be encountered in practical application, and their solutions. (5) Finally, the results reveal that the Sage–Husa Adaptive Kalman Composite filter improved the accuracy of effective wave height by 48.72% and the precision of effective wave period by 23.33% compared to traditional bandpass filter results. [ABSTRACT FROM AUTHOR]

The accurate identification of highly similar sheet metal parts remains a challenging issue in sheet metal production. To solve this problem, this paper proposes an effective mean square differences (EMSD) algorithm that can effectively distinguish highly similar parts with high accuracy. First, multi-level downsampling and rotation searching are adopted to construct an image pyramid. Then, non-maximum suppression is utilised to determine the optimal rotation for each layer. In the matching, by re-evaluating the contribution of the difference between the corresponding pixels, the matching weight is determined according to the correlation between the grey value information of the matching pixels, and then the effective matching coefficient is determined. Finally, the proposed effective matching coefficient is adopted to obtain the final matching result. The results illustrate that this algorithm exhibits a strong discriminative ability for highly similar parts, with an accuracy of 97.1%, which is 11.5% higher than that of the traditional methods. It has excellent potential for application and can significantly improve sheet metal production efficiency. [ABSTRACT FROM AUTHOR]

This paper presents a depth-based hybrid method to generate safe flight corridors for a memoryless local navigation planner. It is first proposed to use raw depth images as inputs in the learning-based object-detection engine with no requirement for map fusion. We then employ an object-detection network to directly predict the base of polyhedral safe corridors in a new raw depth image. Furthermore, we apply a verification procedure to eliminate any false predictions so that the resulting collision-free corridors are guaranteed. More importantly, the proposed mechanism helps produce separate safe corridors with minimal overlap that are suitable to be used as space boundaries for path planning. The average intersection of union (IoU) of corridors obtained by the proposed algorithm is less than 2%. To evaluate the effectiveness of our method, we incorporated it into a memoryless planner with a straight-line path-planning algorithm. We then tested the entire system in both synthetic and real-world obstacle-dense environments. The obtained results with very high success rates demonstrate that the proposed approach is highly capable of producing safe corridors for memoryless local planning. [ABSTRACT FROM AUTHOR]

A single unmanned surface combatant (USV) has poor mission execution capability, so the cooperation of multiple unmanned surface ships is widely used. Cooperative hunting is an important aspect of multi USV collaborative research. Therefore, this paper proposed a cooperative hunting method for multi-USV based on the A* algorithm in an environment with obstacles. First, based on the traditional A* algorithm, a path smoothing method based on USV minimum turning radius is proposed. At the same time, the post order traversal recursive algorithm in the binary tree method is used to replace the enumeration algorithm to obtain the optimal path, which improves the efficiency of the A* algorithm. Second, a biomimetic multi USV swarm collaborative hunting method is proposed. Multiple USV clusters simulate the hunting strategy of lions to pre-form on the target's path, so multiple USV clusters do not require manual formation. During the hunting process, the formation of multiple USV groups is adjusted to limit the movement and turning of the target, thereby reducing the range of activity of the target and improving the effectiveness of the algorithm. To verify the effectiveness of the algorithm, two sets of simulation experiments were conducted. The results show that the algorithm has good performance in path planning and target search. [ABSTRACT FROM AUTHOR]

The application of mulching film has significantly contributed to improving agricultural output and benefits, but residual film has caused severe impacts on agricultural production and the environment. In order to realize the accurate recycling of agricultural residual film, the detection of residual film is the first problem to be solved. The difference in color and texture between residual film and bare soil is not obvious, and residual film is of various sizes and morphologies. To solve these problems, the paper proposes a method for detecting residual film in agricultural fields that uses the attention mechanism. First, a two-stage pre-training approach with strengthened memory is proposed to enable the model to better understand the residual film features with limited data. Second, a multi-scale feature fusion module with adaptive weights is proposed to enhance the recognition of small targets of residual film by using attention. Finally, an inter-feature cross-attention mechanism that can realize full interaction between shallow and deep feature information to reduce the useless noise extracted from residual film images is designed. The experimental results on a self-made residual film dataset show that the improved model improves precision, recall, and mAP by 5.39%, 2.02%, and 3.95%, respectively, compared with the original model, and it also outperforms other recent detection models. The method provides strong technical support for accurately identifying farmland residual film and has the potential to be applied to mechanical equipment for the recycling of residual film. [ABSTRACT FROM AUTHOR]

In recent times, the realm of remote sensing has witnessed a remarkable surge in the area of deep learning, specifically in the domain of target recognition within synthetic aperture radar (SAR) images. However, prevailing deep learning models have often placed undue emphasis on network depth and width while disregarding the imperative requirement for a harmonious equilibrium between accuracy and speed. To address this concern, this paper presents FCCD-SAR, a SAR target recognition algorithm based on the lightweight FasterNet network. Initially, a lightweight and SAR-specific feature extraction backbone is meticulously crafted to better align with SAR image data. Subsequently, an agile upsampling operator named CARAFE is introduced, augmenting the extraction of scattering information and fortifying target recognition precision. Moreover, the inclusion of a rapid, lightweight module, denoted as C3-Faster, serves to heighten both recognition accuracy and computational efficiency. Finally, in cognizance of the diverse scales and vast variations exhibited by SAR targets, a detection head employing DyHead's attention mechanism is implemented to adeptly capture feature information across multiple scales, elevating recognition performance on SAR targets. Exhaustive experimentation on the MSTAR dataset unequivocally demonstrates the exceptional prowess of our FCCD-SAR algorithm, boasting a mere 2.72 M parameters and 6.11 G FLOPs, culminating in an awe-inspiring 99.5% mean Average Precision (mAP) and epitomizing its unparalleled proficiency. [ABSTRACT FROM AUTHOR]

The online detection of partial discharge (PD) in gas-insulated switchgear (GIS) is a crucial and powerful tool for maintaining their reliability. However, extracting weak discharge signals from strong disturbances is a significant challenge. The presence of noise can hamper the identification and localization of PD types, making the extraction of pure PD signals the focus of current research. This paper proposes a PRPD-based PD filtering algorithm that analyzes interference using the output information from PRPD and sets threshold parameters for noise reduction processing. This method is mainly used for secondary noise reduction at a later stage, without analyzing the noise source, to achieve effective signal acquisition while retaining the characteristics of the PD signals, thereby improving the system's sensitivity and the signal's purity. [ABSTRACT FROM AUTHOR]

This paper presents a novel routing planning method based on multi-objective optimization to tackle the routing problem in computing power networks. The proposed method aims to improve the performance and efficiency of routing by considering multiple objectives. In this study, we first model the computing power network and formulate the routing problem as a multi-objective optimization problem. To address this problem, we introduce a non-dominated sorting genetic algorithm incorporating a ratio parameter adjustment strategy based on reinforcement learning. Extensive simulations are conducted to evaluate the performance of the proposed routing algorithm. The results demonstrate significant client latency and cost reductions, highlighting the algorithm's effectiveness. By providing a comprehensive solution to the routing problem in computing power networks, this work contributes to the field by offering improved performance and efficiency. The proposed method's ability to optimize multiple objectives sets it apart from existing approaches, making it a valuable contribution to the research community. [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]

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 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]

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]

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]

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]

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]

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]

Light field (LF) image depth estimation is a critical technique for LF-related applications such as 3D reconstruction, target detection, and tracking. The refocusing property of LF images provide rich information for depth estimations; however, it is still challenging in cases of occlusion regions, edge regions, noise interference, etc. The epipolar plane image (EPI) of LF can effectively deal with the depth estimation because of its characteristics of multidirectionality and pixel consistency—in which the LF depth estimations are converted to calculate the EPI slope. This paper proposed an EPI LF depth estimation algorithm based on a directional relationship model and attention mechanism. Unlike the subaperture LF depth estimation method, the proposed method takes EPIs as input images. Specifically, a directional relationship model was used to extract direction features of the horizontal and vertical EPIs, respectively. Then, a multiviewpoint attention mechanism combining channel attention and spatial attention is used to give more weight to the EPI slope information. Subsequently, multiple residual modules are used to eliminate the redundant features that interfere with the EPI slope information—in which a small stride convolution operation is used to avoid losing key EPI slope information. The experimental results revealed that the proposed algorithm outperformed the compared algorithms in terms of accuracy. [ABSTRACT FROM AUTHOR]

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