Search

As blockchain technology advances, cross-chain interoperability has become a crucial requirement for achieving seamless interaction among multiple chains. To solve this problem, this paper proposes a scholarly approach to the development of a cross-chain-secure transmission technique, incorporating the Trusted Platform Module (TPM) and the SM algorithm, which is based on trusted roots. This research paper elaborates on the design and implementation of the cross-chain-secure transmission technique based on TPM and the SM algorithm, emphasizing the academic rigor necessary for addressing the security requirements of cross-chain interactions. The research shows that compared with the previous method, the throughput of production capacity is not significantly different from that before and after adding the network delay, and the success rate of preventing attacks is increased by 46.9% by simulating related attacks. After multiple rounds of experiments, the effectiveness and feasibility of this technology in protecting cross-chain communication data are verified. [ABSTRACT FROM AUTHOR]

Underwater acoustic channels often have to face the interference of impulsive noise, which is usually modeled by α-stable distribution in simulation experiments. To solve the problem of underwater acoustic channel estimation under impulsive noise, this paper proposes a convex combination–variable-step-size least mean p-norm algorithm. The algorithm incorporates a convex combination into the variable-step-size least mean p-norm algorithm and uses the convex combination of different convergence domains provided by changing the parameters of the Gaussian function to further improve the effect after convergence. The simulation results of channel estimation show that the convex combination–variable-step-size least mean p-norm algorithm provides a more stable, robust, and universal solution than the variable-step-size least mean p-norm algorithm. [ABSTRACT FROM AUTHOR]

Cracks are one of the main types of tunnel-lining defects. At present, there are no particularly good methods for identifying tunnel-lining cracks. The methods that are used are associated with problems such as poor robustness, low detection efficiency, and inconsistency in defect identification. Vision-based crack identification algorithms that use images of tunnel-lining cracks are also affected by problems such as weak features, irregular shapes, random development, and small proportions. In light of this, we propose in this paper a neural network that integrates U-net and FPN (feature pyramid network) pyramid structure characteristics. Because of its ability to output deep feature information, an SK (selective kernel) attention mechanism was integrated to increase the weight of effective feature regions and improve the detection accuracy of feature maps. An RPN (region proposal network) regional detection network was used for multi-scale regional screening, and non-maximum suppression was used to eliminate repeated anchor frames between different regions. The continuity of cracks was determined using adaptive regional expansion. The region segmentation network was also combined with multi-scale feature maps. Finally, the segmentation results for regions of fine features could be mapped to the whole image to identify cracks, thereby solving the problem that arises when textural features of cracks are weak and cannot be accurately identified. For testing purposes, photos of tunnel-lining crack defects were used. The algorithm described in this paper was able to combine deep and shallow features to identify more abundant crack features, and the recognition accuracy of the crack classification network reached 98.51%. With respect to crack segmentation, the algorithm's segmentation accuracy reached 94.55%, and its single processing time reached 60.76 ms, indicating more accurate and efficient segmentation performance, compared with FCNs (fully convolutional networks) and classical U-net networks. [ABSTRACT FROM AUTHOR]

Co-resident attacks are serious security threats in multi-tenant public cloud platforms. They are often implemented by building side channels between virtual machines (VMs) hosted on the same cloud server. Traditional defense methods are troubled by the deployment cost. The existing tenant classification methods can hardly cope with the real dataset that is quite large and extremely unevenly distributed, and may have problems in the processing speed considering the computation complexity of the DBSCAN algorithm. In this paper, we propose a novel co-resident attack defense strategy which solve these problems through an improved and efficient multi-level clustering algorithm and semi-supervised classification method. We propose a novel multi-level clustering algorithm which can efficiently reduce the complexity, since only a few parameter adjustments are required. Built on the proposed clustering algorithm, a semi-supervised classification model is designed. The experimental results of the classification effect and training speed show that our model achieves F-scores of over 85% and is significantly faster than traditional SVM classification methods. Based on the classification of unlabeled tenants into different security groups, the cloud service provider may modify the VM placement policy to achieve physical isolation among different groups, reducing the co-residency probability between attackers and target tenants. Experiments are conducted on a large-scale dataset collected from Azure Cloud Platform. The results show that the proposed model achieves 97.86% accuracy and an average 96.06% F-score, proving the effectiveness and feasibility of the proposed defense strategy. [ABSTRACT FROM AUTHOR]

The study of influence maximizing in temporal social networks (IMT) is an important aspect of influence maximization (IM) research. Currently, two main types of algorithms can solve the IMT problem: greedy-based algorithms and heuristic-based algorithms. However, the greedy-based algorithm is too time-consuming to be used in practice, and most existing heuristic methods do not consider the attributes of nodes, resulting in these methods being unable to solve the IMT problem. Therefore, this paper proposes a mixed k-shell (MKS) algorithm, which considers nodes' local and global attributes to characterize their influence and select seed nodes. At the local level, we consider the degree centrality of nodes, and at the global level, we propose the temporal k-shell decomposition (TKS) algorithm. Ultimately, the influence of a node is determined by combining the influence of itself and its neighbors. Experiments on four real temporal social networks show that MKS performs better in effectiveness than other heuristic baselines and can maintain a balance between effectiveness and efficiency, providing a useful solution for solving the IMT problem. [ABSTRACT FROM AUTHOR]

Traditional camera sensors rely on human eyes for observation. However, human eyes are prone to fatigue when observing objects of different sizes for a long time in complex scenes, and human cognition is limited, which often leads to judgment errors and greatly reduces efficiency. Object recognition technology is an important technology used to judge the object's category on a camera sensor. In order to solve this problem, a small-size object detection algorithm for special scenarios was proposed in this paper. The advantage of this algorithm is that it not only has higher precision for small-size object detection but also can ensure that the detection accuracy for each size is not lower than that of the existing algorithm. There are three main innovations in this paper, as follows: (1) A new downsampling method which could better preserve the context feature information is proposed. (2) The feature fusion network is improved to effectively combine shallow information and deep information. (3) A new network structure is proposed to effectively improve the detection accuracy of the model. From the point of view of detection accuracy, it is better than YOLOX, YOLOR, YOLOv3, scaled YOLOv5, YOLOv7-Tiny, and YOLOv8. Three authoritative public datasets are used in these experiments: (a) In the Visdron dataset (small-size objects), the map, precision, and recall ratios of DC-YOLOv8 are 2.5%, 1.9%, and 2.1% higher than those of YOLOv8s, respectively. (b) On the Tinyperson dataset (minimal-size objects), the map, precision, and recall ratios of DC-YOLOv8 are 1%, 0.2%, and 1.2% higher than those of YOLOv8s, respectively. (c) On the PASCAL VOC2007 dataset (normal-size objects), the map, precision, and recall ratios of DC-YOLOv8 are 0.5%, 0.3%, and 0.4% higher than those of YOLOv8s, respectively. [ABSTRACT FROM AUTHOR]

With the wave of artificial intelligence and deep learning sweeping the world, there are many algorithms based on deep learning for image defog research. However, there is still serious color distortion, contrast reduction, incomplete fog removal, and other problems. To solve these problems, this paper proposes an improved image defogging network based on the traditional cycle-consistent adversarial network. We add the self-attention module and atrous convolution multi-scale feature fusion module on the basis of the traditional CycleGAN network to enhance the feature extraction capability of the network. The perceptual loss function is introduced into the loss function of the model to enhance the texture sense of the generated image. Finally, by comparing several typical defogging algorithms, the superiority of the defogging model proposed in this paper is proved qualitatively and quantitatively. Among them, on the indoor synthetic data set, the Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index Measurement (SSIM) of the network designed by us can reach 23.22 and 0.8809, respectively. On the outdoor synthetic data set, the PSNR and SSIM of our designed network can be as high as 25.72 and 0.8859, respectively. On the real data set, the PSNR and SSIM of our designed network can reach 21.02 and 0.8166, respectively. It is proved that the defogging network in this paper has good practicability and universality. [ABSTRACT FROM AUTHOR]

In recent years, unmanned aerial vehicle (UAV) image target tracking technology, which obtains motion parameters of moving targets and achieves a behavioral understanding of moving targets by identifying, detecting and tracking moving targets in UAV images, has been widely used in urban safety fields such as accident rescue, traffic monitoring and personnel detection. Due to the problems of complex backgrounds, small scale and a high density of targets, as well as mutual occlusion among targets in UAV images, this leads to inaccurate results of single object tracking (SOT). To solve the problem of tracking target loss caused by inaccurate tracking results, this paper proposes a strong interference motion target tracking method based on the target consistency algorithm for SOT based on an interframe fusion and trajectory confidence mechanism, fusing previous frames for the tracking trajectory correction of current frames, learning again from previous frames to update the model and adjusting the tracking trajectory according to the tracking duration. The experimental results can show that the accuracy of the proposed method in this paper is improved by 6.3% and the accuracy is improved by 2.6% compared with the benchmark method, which is more suitable for applications in the case of background clutter, camera motion and viewpoint change. [ABSTRACT FROM AUTHOR]

This paper proposes a weakly supervised cross-domain person re-identification (Re-ID) method based on small sample data. In order to reduce the cost of data collection and annotation, the model design focuses on extracting and abstracting the information contained in the data under limited conditions. In this paper, we focus on the problems of strong data dependence, weak cross-domain capability and low accuracy in Re-ID in weakly supervised scenarios. Our contributions are as follows: first, we implement a joint training framework with the help of small sample learning and cross-domain migration for Re-ID. Second, with the help of residual compensation and fusion attention module, the RCFA module is designed, and the model framework is built on this basis to improve the cross-domain ability of the model. Third, to solve the problem of low accuracy caused by insufficient data coverage of small samples, a fusion of shallow features and deep features is designed to enable the model to weighted fusion of shallow detail information and deep semantic information. Finally, by selecting different camera images in Market1501 dataset and DukeMTMC-reID dataset as small samples, respectively, and introducing another dataset data for joint training, we demonstrate the feasibility of this joint training framework, which can perform weakly supervised cross-domain Re-ID based on small sample data. [ABSTRACT FROM AUTHOR]

This paper proposes a tag position perception method for scenarios such as package retrieval in unmanned warehouses and book management in libraries. This method can accurately predict the distribution of tag space positions in real–time during RFID robot inventory. Firstly, the signal strength (RSSI) and speed of identification (SoI) are used as features. The grey wolf optimization multi–layer perceptron neural network model (GWO–MLP) is employed to predict the distance of tag groups. Secondly, a tag orientation prediction algorithm is designed to estimate the orientation of the tag groups. Finally, the periodicity of the phase is determined by the characteristic of RSSI attenuation as the tag–to–antenna distance increases, solving the problem of position ambiguity caused by phase periodicity. The experiment has shown that this method achieves a high accuracy rate of 96.67% and 97% in predicting the distance and orientation of tag groups, respectively. The average error in distance perception for the single tag is less than 3 cm, enabling precise perception of RFID tag positions. This method facilitates more efficient operation management and accurate item traceability. [ABSTRACT FROM AUTHOR]

In order to solve the problem of large model computing power consumption, this paper proposes a novel model compression algorithm. Firstly, this paper proposes an interpretable weight allocation method for the loss between a student network (a network model with poor performance), a teacher network (a network model with better performance) and real label. Then, different from the previous simple pruning and fine-tuning, this paper performs knowledge distillation on the pruned model, and quantifies the residual weights of the distilled model. The above operations can further reduce the model size and calculation cost while maintaining the model accuracy. The experimental results show that the weight allocation method proposed in this paper can allocate a relatively appropriate weight to the teacher network and real tags. On the cifar-10 dataset, the pruning method combining knowledge distillation and quantization can reduce the memory size of resnet32 network model from 3726 KB to 1842 KB, and the accuracy can be kept at 93.28%, higher than the original model. Compared with similar pruning algorithms, the model accuracy and operation speed are greatly improved. [ABSTRACT FROM AUTHOR]

In order to solve the problem of defect detection and to contour accurate segmentation of periodic texture fabric images, a fabric defect detection method based on saliency region and similarity location is proposed. Firstly, the image to be detected was processed by color space conversion, Gaussian filtering, and contrast enhancement, and a frequency-tuned (FT) salient region detection algorithm was used to estimate a saliency map of the enhanced image. The fabric image was divided into image blocks of the same size with overlapping areas through a sliding window, and then the statistical parameters of each image block were calculated. The outliers in the statistical parameters were filtered out using inter-quartile range (IQR). Through the positioning and processing of image defects, abnormal elimination was carried out, and the defect outline was finally obtained. The experimental results show that the method proposed in this paper has better performance in terms of qualitative characterization of Acc, Precision, Recall, and F1 score. [ABSTRACT FROM AUTHOR]

Due to the shortage of wireless resources and the emergence of a large number of users, determining how to guarantee the quality-of-service (QoS) requirements of users and make more users work in the same spectrum has become an urgent research topic. In this paper, we study a multi-user MIMO (MU-MIMO) cellular network system model in which cellular users (CUs) share the same spectrum resource with multiple device-to-device (D2D) pairs. To maximize the number of admitted D2D pairs sharing the same spectrum with the CUs, a joint power allocation and channel gain (JPACG) algorithm is proposed. The optimization problem is divided into two steps to be solved. First, the power allocation of CUs without D2D pairs admitted is solved. Then, the optimization problem is transformed into minimizing the interference to CUs when CUs are treated as primary users. The admittance order of D2D pairs is determined by the transmission power and channel gain. The proposed algorithm uses a convex optimization algorithm to solve the problem of power allocation joint interference channel gain in order to maximize the number of admitted D2D pairs under the constraints of the signal-to-interference-plus-noise ratio (SINR) threshold and maximum transmission power. In addition, the effect of the number of admitted D2D pairs on the total sum rate of all users is also analyzed. The simulation results show that the proposed JPACG algorithm can achieve better performance in admitting D2D pairs. [ABSTRACT FROM AUTHOR]

A simplified bubble model and its solver optimization method are proposed to solve the problem of poor realistic simulation and complex solutions for bubble-motion behavior in water. Firstly, the internal velocity of the bubble was avoided, and the bubble model was established by only considering the net flux of the inlet and outlet bubbles, which reduced the computational complexity. The bubble constraint was then introduced into the motion equation of water, and the mixed Euler–Lagrangian method was used to solve it. FLIP particles tracked the bubble position, velocity, and deformation, and the mesh updated the vector field. At the same time, the viscosity term was simplified. Finally, it was combined with implicit incompressible SPH particles to achieve the purpose of volume correction. The experimental results show that the method in this paper can present a simulation effect of bubbles in water with rich detail and a realistic sense, whether compared with actual pictures or with existing methods. [ABSTRACT FROM AUTHOR]

Foreground detection is the main way to identify regions of interest. The detection effectiveness determines the accuracy of subsequent behavior analysis. In order to enhance the detection effect and optimize the problems of low accuracy, this paper proposes an improved Vibe algorithm combining the frame difference method and adaptive thresholding. First, we adopt a shallow convolutional layer of VGG16 to extract the lower-level features of the image. Features images with high correlation are fused into a new image. Second, adaptive factors based on the spatio-temporal domain are introduced to divide the foreground and background. Finally, we construct an inter-frame average speed value to measure the moving speed of the foreground, which solves the mismatch problem between background change rate and model update rate. Experimental results show that our algorithm can effectively solve the drawback of the traditional method and prevent the background model from being contaminated. It suppresses the generation of ghosting, significantly improves detection accuracy, and reduces the false detection rate. [ABSTRACT FROM AUTHOR]

In this paper, a control strategy of a cell-based multi-agent system is proposed to solve the problem of inconsistency of series lithium-ion battery packs. The bidirectional Cuk converter is utilized as an equalizing circuit serving for balancing adjacent cells in a pack. A SOC-based consensus control with a time-triggered mechanism (TTM) is proposed. In order to reduce the actuator updates, the control method is ameliorated by altering TTM to an event-triggered mechanism (ETM). Adjustable balancing currents are designed in both TTM and ETM methods for the acceleration of the equalization process. The cases in dynamic environments under externally imposed charging/discharging currents by adopting TTM and ETM methods are investigated in detail. By comparison, the simulations and hardware-in-the-loop (HIL) experiments with a Typhoon real-time simulator are illustrated to show that, both in standby or external charging/discharging conditions, the proposed ETM algorithms are superior to TTM's in terms of equalization time and adaptability to the external environment. [ABSTRACT FROM AUTHOR]

Legalized routing is an essential part of PCB automatic routing. It solves the problem of wiring conflicts and obtains routing results that comply with the constraints of design rules. Traditional legalized routing problems mostly use trial backtracking methods, but with increasing design complexity and design rules, avoiding wiring conflicts between networks has become increasingly challenging. This paper proposes a legalized routing algorithm based on linear programming to obtain the optimal wiring trajectory under specified topological constraints. First, the corresponding routing model was established based on numerous routing rules, and a routing grid diagram was found using obstacles as grid points. Secondly, a global routing algorithm was used to obtain the estimated wiring path, and integer linear programming was used to realize the mathematical modeling of the legalized routing problem. Finally, a multi-line simultaneous routing strategy was used to design and implement a detailed routing algorithm, optimizing the routing results. We use C++ to complete the coding work and thoroughly test the PCB use cases of different sizes. The experimental results show that our algorithm still maintains a 100% routing success rate, good time performance, and excellent routing quality with large-scale use cases compared with the trial backtracking method. [ABSTRACT FROM AUTHOR]

With the rapid development of virtual reality (VR) technology, this paper proposes an access point (AP) correlation method based on VR user behavior awareness to address the problem of how current AP correlation methods only focus on the performance improvements of ordinary users and ignore the impact of VR user behavior on service quality. This paper analyzes the AP association method under the coverage scenario of a multi-access point (multi-AP) scenario environment and controls the performance improvement of VR user APs or APs under the access controller (AC) by association. Firstly, the VR network application scenario and system model were constructed, and secondly, the user behavior was sensed by analyzing the viewing habits of users. Then, the VR user association problem based on VR user behavior perception was transformed into a "many-to-many" matching problem between VR user devices and APs, and the generalized multidimensional multiple choice knapsack (GMMKP) model was established to solve the problem using the backpack problem theory; the suboptimal solution algorithm was selected to obtain the best VR user AP association strategy. The experimental results show by simulation that the proposed algorithm in this paper performed better in terms of the AP load balancing and average network download latency compared to the comparison algorithms. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of traditional fault identification methods in fault information acquisition, In the scenario of hybrid HVDC transmission system, a new fault identification method is proposed by using wavelet packet energy spectrum and convolutional neural network (CNN), which effectively solves the problem of complex fault feature extraction of hybrid HVDC transmission system. This method effectively improves the accuracy of fault identification. Firstly, tThe frequency-domain characteristics of the fault transient signal are extracted by wavelet packet transform, and the feature differences are reflected in the form of energy spectrum. Secondly, according to the extracted energy feature information, the order of fault line and fault type is identified by CNN. Finally, through example verification and algorithm comparison, it is concluded that, the mentioned model has a strong ability to identify faults, and has strong anti-noise interference and tolerance to transition resistance. [ABSTRACT FROM AUTHOR]

Traditional anti-jamming techniques such as frequency hopping (FH) and direction-sequence spread spectrum (DSSS) are easily targeted by jammers. Inspired by the significant advantages of reconfigurable intelligent surfaces (RIS), and in order to overcome "double fading", controllable multiple active RISs are proposed to explore anti-jamming communication in this paper. To verify the feasibility of active RIS, the anti-jamming performance of active RIS is analyzed through theoretical derivation and simulation and compared with passive RIS. Furthermore, to solve the optimization problem of active RIS, a controllable multi-active RIS assisted anti-jamming algorithm based on BCD is proposed. Theoretical analysis and simulation results show that in small-scale deployment scenarios of RIS, the anti-jamming performance of active RIS is better than that of passive RIS, and the complexity and optimization performance of the proposed algorithm are better than those of semidefinite relaxation (SDR) algorithms. [ABSTRACT FROM AUTHOR]

Aiming to solve the problems of large-scale changes, the dense occlusion of ship targets, and a low detection accuracy caused by challenges in the localization and identification of small targets, this paper proposes a ship target-detection algorithm based on the improved YOLOv5s model. First, in the neck part, a weighted bidirectional feature pyramid network is used from top to bottom and from bottom to top to solve the problem of a large target scale variation. Second, the CNeB2 module is designed to enhance the correlation of coded spatial space, reduce interference from redundant information, and enhance the model's ability to distinguish dense targets. Finally, the Separated and Enhancement Attention Module attention mechanism is introduced to enhance the proposed model's ability to identify and locate small targets. The proposed model is verified by extensive experiments on the sea trial dataset. The experimental results show that compared to the YOLOv5 algorithm, the accuracy, recall rate, and mean average precision of the proposed algorithm are increased by 1.3%, 1.2%, and 2%, respectively; meanwhile, the average precision value of the proposed algorithm for the dense occlusion category is increased by 4.5%. In addition, the average precision value of the proposed algorithm for the small target category is increased by 5% compared to the original YOLOv5 algorithm. Moreover, the detection speed of the proposed algorithm is 66.23 f/s, which can meet the requirements for detection speed and ensure high detection accuracy and, thus, realize high-speed and high-precision ship detection. [ABSTRACT FROM AUTHOR]

The proliferation of the Internet of Things (IoT) and widespread use of devices with sensing, computing, and communication capabilities have motivated intelligent applications empowered by artificial intelligence. Classical artificial intelligence algorithms require centralized data collection and processing, which are challenging in realistic intelligent IoT applications due to growing data privacy concerns and distributed datasets. Federated Learning (FL) has emerged as a privacy-preserving distributed learning framework, which enables IoT devices to train global models through sharing model parameters. However, inefficiency due to frequent parameter transmissions significantly reduces FL performance. Existing acceleration algorithms consist of two main types including local update and parameter compression, which considers the trade-offs between communication and computation/precision, respectively. Jointly considering these two trade-offs and adaptively balancing their impacts on convergence have remained unresolved. To solve the problem, this paper proposes a novel efficient adaptive federated optimization (FedEAFO) algorithm to improve the efficiency of FL, which minimizes the learning error via jointly considering two variables including local update and parameter compression. The FedEAFO enables FL to adaptively adjust two variables and balance trade-offs among computation, communication, and precision. The experiment results illustrate that compared with state-of-the-art algorithms, the FedEAFO can achieve higher accuracies faster. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) has become increasingly popular, and its communication requirements have grown beyond what traditional ground networks can handle. The space–air–ground (SAG) integrated network has been proposed as a potential solution, where unmanned aerial vehicles (UAVs) collect data from IoT devices and transmit them to satellites. However, the limited energy of UAVs is one of the key factors restricting communication performance, so it is necessary to consider communication energy efficiency (EE). In addition, the improvement of EE will bring about the decline of spectral efficiency (SE). Therefore we consider the tradeoff between EE and SE. Considering a SAG-IoT network, the focus of the paper is to optimize sub-channel selection, power control, and UAV position deployment to maximize EE and SE of the network, which is a multi-objective optimization (MOO) problem. On this premise, we try to improve the data throughput between IoT devices and UAVs. To solve this MOO problem, we use the ϵ -constraint to convert it into a single-objective optimization problem. We then employ various optimization algorithms such as the Dinkelbach algorithm, successive convex approximation algorithm, Lagrange dual algorithm, and block coordinate descent algorithm to solve the mixed integer non-convex problem. Simulation results show that the proposed algorithm converges to at least one sub-optimal solution. [ABSTRACT FROM AUTHOR]

The accuracy for target tracking using a conventional interacting multiple-model algorithm (IMM) is limited. In this paper, a new variable structure of interacting multiple-model (VSIMM) algorithm aided by center scaling (VSIMM-CS) is proposed to solve this problem. The novel VSIMM-CS has two main steps. Firstly, we estimate the approximate location of the true model. This is aided by the expected-mode augmentation algorithm (EMA), and a new method—namely, the expected model optimization method—is proposed to further enhance the accuracy of EMA. Secondly, we change the original model set to ensure the current true model as the symmetry center of the current model set, and the model set is scaled down by a certain percentage. Considering the symmetry and linearity of the system, the errors produced by symmetrical models can be well offset. Furthermore, narrowing the distance between the true model and the default model is another effective method to reduce the error. The second step is based on two theories: symmetric model set optimization method and proportional reduction optimization method. All proposed theories aim to minimize errors as much as possible, and simulation results highlight the correctness and effectiveness of the proposed methods. [ABSTRACT FROM AUTHOR]

The robustness of the traditional A* algorithm of path planning is poor due to its excessive number of traversal nodes, slow search speed, and large turning angle. Aiming to solve the above problems, a multi-scenario adaptive A* algorithm based on extended neighborhood priority search is proposed. Firstly, this algorithm designs the heuristic function that can adapt to various scene changes by quantifying the scene map information, and the search weight is adjusted adaptively to enhance the robustness and adaptability of the algorithm. Secondly, the search strategy based on extended neighborhood priority is adopted to improve the orientation of the algorithm, and the redundant node removal strategy is used to smooth the path to reduce the number of traversed nodes and the turning angle. Finally, simulation tests are conducted in several representative map environments. The test results show that the proposed algorithm is superior to the traditional A* algorithm due to its stronger robustness and significantly improved performance metrics, with an 84.95% reduction in the number of traversal nodes, an 83.84% reduction in the number of path nodes, a 62.28% reduction in turning points on the path, a 77.38% reduction in the total turning angle, and a 58.47% reduction in the search time. [ABSTRACT FROM AUTHOR]

In quantum computing, calculations are achieved using quantum mechanics. Typically, two main phenomena of quantum mechanics (i.e., superposition and entanglement) allow quantum computing to solve some problems more efficiently than classical algorithms. The most well-known advantage of quantum computing is the speedup of some of the calculations, which have been performed before by classical applications. Scientists and engineers are attempting to use quantum computing in different fields of science, e.g., drug discovery, chemistry, computer science, etc. However, there are few attempts to use quantum computing in power and energy applications. This paper tries to highlight this gap by discussing one of the most famous quantum computing algorithms (i.e., Grover's algorithm) and discussing the potential applications of this algorithm in power and energy systems, which can serve as one of the starting points for using Grover's algorithm in power and energy systems. [ABSTRACT FROM AUTHOR]

The globalization of the integrated circuit (IC) industry has raised concerns about hardware Trojans (HT), and there is an urgent need for efficient HT-detection methods of gate-level netlists. Machine learning (ML) is a powerful tool for this purpose. A Trojan-detection framework is proposed in this paper to solve the data imbalance and low accuracy problems of existing ML-based HT-detection algorithms. To solve the problem of data imbalance, we propose the node-filtering algorithm, which extracts structure templates from HT circuits and removes most normal nodes based on them. To enhance the identification of unknown HT payload, we propose the load-expansion algorithm, which expands the identified HT nodes based on their fanout features. We evaluate the framework using different ML algorithms. The results show that the framework significantly improves the Trojan-detection rate of the original algorithms, and achieves a 10% improvement in true positive rate compared to the original algorithms. [ABSTRACT FROM AUTHOR]

Although the NSGA-III algorithm is able to find the global optimal solution and has a good effect on the workshop scheduling optimization, the limitations in population diversity, convergence ability and local optimal solutions make it not applicable to certain situations. Thus, an improved NSGA-III workshop scheduling optimization algorithm is proposed in this work. It aims to address these limitations of the NSGA-III algorithm in processing workshop scheduling optimization. To solve the problem of individual elimination in the traditional NSGA-III algorithm, chaotic mapping is introduced in the improved NSGA-III algorithm to generate new offspring individuals and add the selected winning individuals to the offspring population as the parent population for the next iteration. The proposed algorithm was applied to a pressure sensor calibration workshop. A comparison with the traditional NSGA-III algorithm was conducted through a simulation analysis. The results show that the proposed algorithm can obtain a better convergence performance, improve the optimization ability and avoid falling into local optimal solutions. [ABSTRACT FROM AUTHOR]

Small object detection is one of the challenging tasks in computer vision. Most of the existing small object detection models cannot fully extract the characteristics of small objects within an image, due to the small coverage area, low resolution and unclear detailed information of small objects in the image; hence, the effect of these models is not ideal. To solve this problem, a simple and efficient reinforce feature pyramid network R-FPN is proposed for the YOLOv5 algorithm. The learnable weight is introduced to show the importance of different input features, make full use of the useful information of different feature layers and strengthen the extraction of small object features. At the same time, a channel space mixed attention CSMA module is proposed to extract the detailed information of small objects combined with spaces and channels, suppress other useless information and further improve the accuracy of small object detection. The experimental results show that the proposed method improves the average accuracy AP, AP50 and AR100 of the original algorithm by 2.11%, 2.86% and 1.94%, respectively, and the detection effect is better than the existing small object detection algorithms, which proves the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Path planning is one of the key technologies for unmanned driving of underground intelligent vehicles. Due to the complexity of the drift environment and the vehicle structure, some improvements should be made to adapt to underground mining conditions. This paper proposes a path planning method based on an improved RRT* (Rapidly-Exploring Random Tree Star) algorithm for solving the problem of path planning for underground intelligent vehicles based on articulated structure and drift environment conditions. The kinematics of underground intelligent vehicles are realized by vectorized map and dynamic constraints. The RRT* algorithm is selected for improvement, including dynamic step size, steering angle constraints, and optimal tree reconnection. The simulation case study proves the effectiveness of the algorithm, with a lower path length, lower node count, and 100% steering angle efficiency. [ABSTRACT FROM AUTHOR]

In this study, a tyre defect detection model is improved and optimized under the YOLOv5 framework, aiming at radial tyre defects with characteristics such as an elongated shape and various target sizes and defect types. The DySneakConv module is introduced to replace the first BotteneckCSP in the Backbone network. The deformation offset of the DySneakConv module is used to make the convolutional energy freely adapt to the structure to improve the recognition rate of tyre defects with elongated features; the AIFI module is introduced to replace the fourth BotteneckCSP, and the self-attention mechanism and the processing of large-scale features are used to improve the recognition rate of tyre defects with elongated features using the AIFI module. This latter module has a self-attention mechanism and the ability to handle large-scale features to solve the problems of diverse tyre defects and different sizes. Secondly, the CARAFE up-sampling operator is introduced to replace the up-sampling operator in the Neck network. The up-sampling kernel prediction module in the CARAFE operator is used to increase the receptive field and allow the feature reorganization module to capture more semantic information to overcome the information loss problem of the up-sampling operator. Finally, based on the improved YOLOv5 detection algorithm, the Channel-wise Knowledge Distillation algorithm lightens the model, reducing its computational requirements and size while ensuring detection accuracy. Experimental studies were conducted on a dataset containing four types of tyre defects. Experimental results for the training set show that the improved algorithm improves the mAP0.5 by 4.6 pp, reduces the model size by 25.6 MB, reduces the computational complexity of the model by 31.3 GFLOPs, and reduces the number of parameters by 12.7 × 106 compared to the original YOLOv5m algorithm. Experimental results for the test set show that the improved algorithm improves the mAP0.5 by 2.6 pp compared to the original YOLOv5m algorithm. This suggests that the improved algorithm is more suitable for tyre defect detection than the original YOLOv5. [ABSTRACT FROM AUTHOR]

This paper presents an adaptive protection scheme (APS) for solving the coordination problem that deals with coordination directional overcurrent relays (DOCRs) and distance relays second zone time, in relation to coordination with DOCRs. The coordination problem becomes more complex with the impact of renewable energy sources (RES) when added to the distribution grid. This leads to a change in the grid topology, caused by the on/off states of the distribution generators (DG). The frequency of topological changes in distribution grids poses a challenge to the power system's protection components. The change in the state of DGs leads to malfunction in reliability and miscoordination between protection relays, since that causes a direct effect to the short circuit currents. This paper used the school-based optimization (SBO) algorithm, which simulates the educational process, in order to deal with coordination problems. That algorithm is modified (MSBO) by modified both learning and teaching processes. The IEEE 8-bus test system and IEEE 14-bus distribution network are used to validate the proposed coordination system's effectiveness when dealing with the coordination process between distance and DOCRs, at both the near- and far-end in the typical topological grid and with DGs in working order. [ABSTRACT FROM AUTHOR]

The aim of this work is to obtain multi-objective linear programming algorithms that can be used to solve the global problem of multi-object safety control processes in order to minimize the risk of collisions. In multi-objective linear optimization models, satisfactory trade-off assesses and resolves the conflict between different control objectives. A comparison of single-, bi-, and tri-objective linear programming algorithms allows us to adapt the appropriate optimization method to the conditions of the control process. An important outcome of the present research is the demonstration of the greater effectiveness of bi- and tri-objective optimization compared to single-objective optimization, reflecting the compromises taken into account when choosing between objects and achieving a minimum risk of collision when passing them. [ABSTRACT FROM AUTHOR]

In the process of the integrated scheduling of multi-variety and small-batch complex products, the process structure and attribute characteristics are often ignored, which affects the overall scheduling effect. Aiming at solving this problem, a heuristic integrated scheduling algorithm (HIS-IDA) based on the improved Dijkstra algorithm is proposed. The algorithm takes the processing time of the process itself as the path value of the preceding and the following adjacent processes. Firstly, the improved Dijkstra algorithm prioritized the scheduling of the process sequence with long longitudinal paths and realized the "longitudinal optimization" of the integrated scheduling. Secondly, the layer priority strategy is used to shorten the interval time of process processing and realize the "horizontal optimization" of integrated scheduling. On the basis of "vertical and horizontal optimization", the idle time of the equipment is further reduced by using the process priority strategy of the leaf node, and the "idle optimization" of the integrated scheduling is realized, so as to optimize the overall effect of the integrated scheduling. The effectiveness and superiority of the algorithm are proved using comparison analysis. [ABSTRACT FROM AUTHOR]

In recent years, cross-platform co-simulation has become an important development direction of the real-time simulation of power systems. Model segmentation is at the core of the realization of cross-platform joint simulation and parallel real-time simulation of these systems. In essence, it is based on the deep application of a system-decoupling algorithm. In order to solve problems that a single interface cannot, it considers the data interaction of large- and small-step systems at the same time This paper proposes an improved joint-simulation strategy based on the model-segmentation method for the cross-platform joint-simulation technology of a large-scale, flexible direct-power grid sent by the wind farms of RT-lab and Hypersim. Firstly, by studying several common interface algorithms in the current project, the adaptability of different interface algorithms is analyzed. Secondly, the problem of high-frequency oscillation caused by the inductance-decoupling algorithm is improved, and an improved segmentation-model algorithm is proposed. Finally, according to the adaptability, each interface algorithm is applied to the wind-power-based, flexible direct-transmission, dual-platform simulation model that was built for this study. The simulation results verify the feasibility of the improved interface in system decoupling and platform interfacing, and indicate the significantly improved accuracy and stability of the system. [ABSTRACT FROM AUTHOR]

Various types of service applications increase the amount of computing in vehicular networks. The lack of computing resources of the vehicle itself will hinder the improvement of network performance. Mobile edge computing (MEC) technology is an effective computing method that is used to solve this problem at the edge of network for multiple mobile users. In this paper, we propose the multi-user task offloading strategy based on game theory to reduce the computational complexity and improve system performance. The task offloading decision making as a multi-user task offloading game is formulated to demonstrate how to achieve the Nash equilibrium (NE). Additionally, a task offloading algorithm is designed to achieve a NE, which represents an optimal or sub-optimal system overhead. In addition, the vehicular communication simulation frameworks Veins, SUMO model and OMNeT++ are adopted to run the proposed task offloading strategy. Numerical results show that the system overhead of the proposed task offloading strategy can degrade about 24.19 % and 33.76 % , respectively, in different scenarios. [ABSTRACT FROM AUTHOR]

Channel estimation is crucial in millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems, especially with a few training sequences. To solve the problem of uplink channel estimation in mmWave massive MIMO systems, a PARAFAC-based algorithm is proposed for joint estimation of multiuser channels. The orthogonal frequency divisional multiplexing (OFDM) technique is exploited to combat the frequency selective fading channels. In this paper, the received signal at the base station (BS) is formulated as a third-order parallel factor (PARAFAC) tensor, and then a low-complexity algorithm is designed for fast estimation of the factor matrices related to channel parameters, thus leading to joint estimation of multiuser channel parameters via one-dimensional search. Moreover, the Cramér–Rao Bound (CRB) results for multiuser channel parameters are derived for evaluation. Theorical analysis and numerical results reveal that the algorithm performs well with a few training sequences. Compared with existing algorithms, the proposed algorithm has clear advantages both in estimation accuracy and computational complexity. [ABSTRACT FROM AUTHOR]

The optimal power flow (OPF) is a vital tool for optimizing the control parameters of a power system by considering the desired objective functions subject to system constraints. Metaheuristic algorithms have been proven to be well-suited for solving complex optimization problems. The whale optimization algorithm (WOA) is one of the well-regarded metaheuristics that is widely used to solve different optimization problems. Despite the use of WOA in different fields of application as OPF, its effectiveness is decreased as the dimension size of the test system is increased. Therefore, in this paper, an effective whale optimization algorithm for solving optimal power flow problems (EWOA-OPF) is proposed. The main goal of this enhancement is to improve the exploration ability and maintain a proper balance between the exploration and exploitation of the canonical WOA. In the proposed algorithm, the movement strategy of whales is enhanced by introducing two new movement strategies: (1) encircling the prey using Levy motion and (2) searching for prey using Brownian motion that cooperate with canonical bubble-net attacking. To validate the proposed EWOA-OPF algorithm, a comparison among six well-known optimization algorithms is established to solve the OPF problem. All algorithms are used to optimize single- and multi-objective functions of the OPF under the system constraints. Standard IEEE 6-bus, IEEE 14-bus, IEEE 30-bus, and IEEE 118-bus test systems are used to evaluate the proposed EWOA-OPF and comparative algorithms for solving the OPF problem in diverse power system scale sizes. The comparison of results proves that the EWOA-OPF is able to solve single- and multi-objective OPF problems with better solutions than other comparative algorithms. [ABSTRACT FROM AUTHOR]

Multi-task optimization (MTO) is related to the problem of simultaneous optimization of multiple optimization problems, for the purpose of solving these problems better in terms of optimization accuracy or time cost. To handle MTO problems, there emerges many evolutionary MTO (EMTO) algorithms, which possess distinguished strategies or frameworks in the aspect of handling the knowledge transfer between different optimization problems (tasks). In this paper, we explore the possibility of developing a more efficient EMTO solver based on differential evolution by introducing the strategies of a self-adaptive multi-task particle swarm optimization (SaMTPSO) algorithm, and by developing a new knowledge incorporation strategy. Then, we try to apply the proposed algorithm to solve the weapon–target assignment problem, which has never been explored in the field of EMTO before. Experiments were conducted on a popular MTO test benchmark and a WTA-MTO test set. Experimental results show that knowledge transfer in the proposed algorithm is effective and efficient, and EMTO is promising in solving WTA problems. [ABSTRACT FROM AUTHOR]

The thyristor is the key device for the converter of the ultra-high-voltage DC (UHVDC) project to realize AC–DC conversion. The reliability of thyristors is directly related to the safe operation of the UHVDC transmission system. Due to the complex operating environment of the thyristor, there are many interrelated parameters that may affect the aging state of thyristors. To extract useful information from the massive high-dimensional data and further obtain the aging state of thyristors, a supervised tensor domain classification (STDC) method based on the adaptive syn-thetic sampling method, the gradient-boosting decision tree, and tensor domain theory is proposed in this paper. Firstly, the algorithm applies the continuous medium theory to analogize the aging state points of the thyristor to the mass points in the continuous medium. Then, the algorithm applies the concept of the tensor domain to identify the aging state of the thyristor and to transform the original state-identification problem into the state classification surface determination of the tensor domain. Secondly, a temporal fuzzy clustering algorithm is applied to realize automatic positioning of the classification surface of each tensor sub-domain. Furthermore, to solve the problem of unbalanced sample size between aging class data and normal class data in the state-identification domain, the improved adaptive synthetic sampling algorithm is applied to preprocess the data. The gradient-boosting decision tree algorithm is applied to solve the multi-classification problem of the thyristor. Finally, the comparison between the algorithm proposed and the conventional algorithm is performed through the field-test data provided by the CSG EHV Power Transmission Company of China's Southern Power Grid. It is verified that the evaluation method proposed has higher recognition accuracy and can effectively classify the thyristor states. [ABSTRACT FROM AUTHOR]

The new generation of 3D video is an international frontier research hotspot. However, the large amount of data and high complexity are core problems to be solved urgently in 3D video coding. The latest generation of video coding standard versatile video coding (VVC) adopts the quad-tree with nested multi-type tree (QTMT) partition structure, and the coding efficiency is much higher than other coding standards. However, the current research work undertaken for VVC is less for 3D video. In light of this context, we propose a fast coding unit (CU) decision algorithm based on the gray level co-occurrence matrix (GLCM) and Extra trees for the characteristics of the depth map in 3D video. In the first stage, we introduce an edge detection algorithm using GLCM to classify the CU in the depth map into smooth and complex edge blocks based on the extracted features. Subsequently, the extracted features from the CUs, classified as complex edge blocks in the first stage, are fed into the constructed Extra trees model to make a fast decision on the partition type of that CU and avoid calculating unnecessary rate-distortion cost. Experimental results show that the overall algorithm can effectively reduce the coding time by 36.27–51.98%, while the Bjøntegaard delta bit rate (BDBR) is only increased by 0.24% on average which is negligible, all reflecting the superior performance of our method. Moreover, our algorithm can effectively ensure video quality while saving much encoding time compared with other algorithms. [ABSTRACT FROM AUTHOR]

In the manufacturing of chips, the accurate and effective detection of internal bubble defects of chips is essential to maintain product reliability. In general, the inspection is performed manually by viewing X-ray images, which is time-consuming and less reliable. To solve the above problems, an improved bubble defect detection model YOLO-Xray based on the YOLOv5 algorithm for chip X-ray images is proposed. First, the chip X-ray images are preprocessed by image segmentation to construct the chip X-ray defect dataset, namely, CXray. Then, in the input stage, the K-means++ algorithm is used to re-cluster the CXray dataset to generate the anchors suitable for our dataset. In the backbone network, a micro-scale detection head is added to improve the capabilities for small defect detection. In the neck network, the bi-direction feature fusion idea of BiFPN is used to construct a new feature fusion network based on the improved backbone to fuse the semantic features of different layers. In addition, the Quality Focal Loss function is used to replace the cross-entropy loss function to solve the imbalance of positive and negative samples. The experimental results show that the mean average precision (mAP) of the YOLO-Xray algorithm on the CXray dataset reaches 93.5%, which is 5.1% higher than the original YOLOv5. Meanwhile, the YOLO-Xray algorithm achieves state-of-the-art detection accuracy and speed compared with other mainstream object detection models. This shows the proposed YOLO-Xray algorithm can provide technical support for bubble defect detection in chip X-ray images. The CXray dataset is also open and available at CXray. [ABSTRACT FROM AUTHOR]

Aiming at the problems of multi-scale and serious overlap of dangerous goods in X-ray security-inspection-image samples, an X-ray dangerous-goods-detection algorithm with high detection accuracy is designed based on the improvement of YOLOv4. Using deformable convolution to redesign YOLOv4's path-aggregation-network (PANet) module, deformable convolution can flexibly change its receptive field based on the shape of the detected object. When the high-level information and low-level information are fused in the PANet module, deformable convolution is used to align features, which can effectively improve the detection accuracy. Then, the Focal-EIOU loss function is introduced, which can solve the problem of the CIOU loss function being prone to causing severe loss-value oscillation when dealing with low-quality samples. During training, the network can converge more quickly and the detection accuracy can be slightly improved. Finally, Soft-NMS was used to improve the non-maximum suppression of YOLOv4, effectively solving the problem of the high overlap rate of hazardous materials in the X-ray security-inspection dataset and improving accuracy. On the SIXRay dataset, this model detected 95.73%, 83.00%, 82.95%, 85.13%, and 80.74% AP for guns, knives, wrenches, pliers, and scissors, respectively, and the detected mAP reached 85.51%. The proposed model can effectively reduce the false-detection rate of dangerous goods in X-ray security images and improve the detection ability of small targets. [ABSTRACT FROM AUTHOR]

To solve the problem of complex network models with a large number of redundant parameters, a pruning algorithm combined with an attention mechanism is proposed. Firstly, the basic training is performed once, and the network model is then re-trained with the attention mechanism for the baseline. The obtained model is pruned based on channel correlation, and finally a simplified model is obtained via continuous cyclic iteration while the accuracy rate is kept as close as possible to that of the baseline model. The algorithm was experimentally validated on ResNet based on different datasets, and the results showed that the algorithm provided strong adaptability to different datasets and different network structures. For the CIFAR-100 dataset, ResNet50 was pruned to reduce the amount of model parameters by 80.3% and the amount of computation by 69.4%, while maintaining accuracy. For the ImageNet dataset, the ResNet50 parameter volume was compressed by 2.49 times and the computational volume was compressed by 3.01 times. The ResNet101 parameter volume was reduced by 61.2%, and the computational volume was reduced by 68.5%. Compared with the traditional fixed threshold, the model achieves better results in terms of detection accuracy, compression effect, and inference speed. [ABSTRACT FROM AUTHOR]

It is challenging for a visual SLAM system to keep long-term precise and robust localization ability in a large-scale indoor environment since there is a low probability of the occurrence of loop closure. Aiming to solve this problem, we propose a monocular visual localization algorithm for large-scale indoor environments through matching a prior semantic map. In the approach, the line features of certain semantic objects observed by the monocular camera are extracted in real time. A cost function is proposed to represent the difference between the observed objects and the matched semantic objects in the preexisting semantic map. After that, a bundle adjustment model integrating the semantic object matching difference is given to optimize the pose of the camera and the real-time environment map. Finally, test cases are designed to evaluate the performance of our approach, in which the line features with semantic information are extracted in advance to build the semantic map for matching in real time. The test results show that the positioning accuracy of our method is improved in large-scale indoor navigation. [ABSTRACT FROM AUTHOR]

To improve the detection speed of the three-phase unbalanced voltage sag, the traditional αβ/dq transformation algorithm can be applied. However, in this algorithm, the virtual quadrature voltage signal (VQVS) needs to be accurately constructed in the αβ coordination system. Then, the information of the voltage jump can be achieved by the αβ/dq transformation. However, the traditional algorithm for constructing the VQVS introduces the harmonic component, so that the detection speed and accuracy is low. To solve the problem, this article modifies the algorithm and presents a new algorithm based on the combination of the short time delay (STD) and the positive- and negative-sequence transformation (PNST) algorithm. The STD algorithm and its construction are firstly detailed. Then, the extraction step and performance of the PNST are given. Since the STD algorithm can avoid harmonic properties, voltage sag signal can be quickly obtained by analyzing the positive and negative sequence component derived from the PNST algorithm. The proposed algorithm is compared with two alternatives already proposed in the literature in terms of detection time. Finally, simulation and experimental results validate the validity of the proposed algorithm. [ABSTRACT FROM AUTHOR]

With a deep connection to the internet, the controller area network (CAN) bus of intelligent connected vehicles (ICVs) has suffered many network attacks. A deep situation awareness method is urgently needed to judge whether network attacks will occur in the future. However, traditional shallow methods cannot extract deep features from CAN data with noise to accurately detect attacks. To solve these problems, we developed a SDAE+Bi-LSTM based situation awareness algorithm for the CAN bus of ICVs, simply called SDBL. Firstly, the stacked denoising auto-encoder (SDAE) model was used to compress the CAN data with noise and extract the deep spatial features at a certain time, to reduce the impact of noise. Secondly, a bidirectional long short-term memory (Bi-LSTM) model was further built to capture the periodic features from two directions to enhance the accuracy of the future situation prediction. Finally, a threat assessment model was constructed to evaluate the risk level of the CAN bus. Extensive experiments also verified the improved performance of our SDBL algorithm. [ABSTRACT FROM AUTHOR]

Recently, the reconfigurable intelligent surface (RIS)-aided communication system has emerged as a promising candidate for future millimeter-wave wireless communications. Due to the short wavelength of millimeter wave, the antennas on the base station (BS) and the elements on the RIS can be densely packed. It usually causes the BS and RIS to be blocked by rain, snow, or dust, which will change the channel's characteristics and decrease the performance of communication system. In order to solve this problem, we propose an iterative compressed sense based algorithm for joint estimating the blockage coefficients of RIS and BS. Then, for the complete blockage scenario, we propose a low complexity algorithm for estimating the blockage coefficients. Our simulation results demonstrate the superior performance of the proposed algorithm to existing ones. [ABSTRACT FROM AUTHOR]

Multi object tracking (MOT) is a key research technology in the environment sensing system of automatic driving, which is very important to driving safety. Online multi object tracking needs to accurately extend the trajectory of multiple objects without using future frame information, so it will face greater challenges. Most of the existing online MOT methods are anchor-based detectors, which have many misdetections and missed detection problems, and have a poor effect on the trajectory extension of adjacent object objects when they are occluded and overlapped. In this paper, we propose a discrimination learning online tracker that can effectively solve the occlusion problem based on an anchor-free detector. This method uses the different weight characteristics of the object when the occlusion occurs and realizes the extension of the competition trajectory through the discrimination module to prevent the ID-switch problem. In the experimental part, we compared the algorithm with other trackers on two public benchmark datasets, MOT16 and MOT17, and proved that our algorithm has achieved state-of-the-art performance, and conducted a qualitative analysis on the convincing autonomous driving dataset KITTI. [ABSTRACT FROM AUTHOR]

Device-free localization (DFL) is a technique used to track a target transporting no electronic devices. Radiofrequency (RF) tomography based DFL technology in wireless sensor networks has been a popular research topic in recent years. Typically, high-tracking accuracy requires a high-density wireless network which limits its application in some resource-limited scenarios. To solve this problem, a geometric midpoint (GM) algorithm based on the computations of simple geometric objects is proposed to realize effective tracking of moving targets in low-density wireless networks. First, we proposed a signal processing method for raw RSS signals collected from wireless links that can detect the fluctuations caused by a moving target effectively. Second, a geometric midpoint algorithm is proposed to estimate the location of the target. Finally, simulations and experiments were performed to validate the proposed scheme. The experimental results show that the proposed GM algorithm outperforms the geometric filter algorithm, which is a state-of-the-art DFL method that yields tracking root-mean-square errors up to 0.86 m and improvements in tracking accuracy up to 67.66%. [ABSTRACT FROM AUTHOR]