Search

In response to issues such as the lack of capability for timely early warning and the difficulty in monitoring the status of rolling bearings, a condition-monitoring method for rolling bearings based on the Honey Badger Algorithm (HBA) for optimizing dynamic asynchronous periods is proposed. This method is founded on the peak factor and involves comparing peak factors at different periods to construct a dynamic asynchronous peak-factor-ratio-monitoring index, which is then optimized using the HBA. Simulated experiments were carried out using the XJTU-SY dataset. The results indicate that, compared to the early warning times defined by international standards, the warning times provided using this method are consistently over 33 min in advance within the test dataset. Additionally, an envelope spectrum analysis of the warning data confirms the existence of early faults. This demonstrates that the monitoring indicator developed in this paper is capable of delivering earlier and more accurate early fault warnings and condition monitoring for rolling bearings.

Real-time computation tasks in vehicular edge computing (VEC) provide convenience for vehicle users. However, the efficiency of task offloading seriously affects the quality of service (QoS). The predictive-mode task offloading is limited by computation resources, storage resources and the timeliness of vehicle trajectory data. Meanwhile, machine learning is difficult to deploy on edge servers. In this paper, we propose a vehicle trajectory prediction method based on the vehicle frequent pattern for task offloading in VEC. First, in the initialization stage, a T-pattern prediction tree (TPPT) is constructed based on the historical vehicle trajectory data. Secondly, when predicting the vehicle trajectory, the vehicle frequent itemset with the largest vehicle trajectory support is found in the vehicle frequent itemset of the TPPT. Finally, in the update stage, the TPPT is updated in real time with the predicted vehicle trajectory results. Meanwhile, based on the proposed prediction method, the strategies of task offloading and optimization algorithm are designed to minimize energy consumption with time constraints. The experiments are carried out on real-vehicle datasets and the Capital Bikeshare datasets. The results show that compared with the baseline T-pattern method, the accuracy of the prediction method is improved by more than 10% and the prediction efficiency is improved by more than 6.5 times. The vehicle trajectory prediction method based on the vehicle frequent pattern has high accuracy and prediction efficiency, which can solve the problem of vehicle trajectory prediction for task offloading.

Extracting circle information from images has always been a basic problem in computer vision. Common circle detection algorithms have some defects, such as poor noise resistance and slow computation speed. In this paper, we propose an anti-noise fast circle detection algorithm. In order to improve the anti-noise of the algorithm, we first perform curve thinning and connection on the image after edge extraction, then suppress noise interference by the irregularity of noise edges and extract circular arcs by directional filtering. In order to reduce the invalid fitting and speed up the running speed, we propose a circle fitting algorithm with five quadrants, and improve the efficiency of the algorithm by the idea of “divide and conquer”. We compare the algorithm with RCD, CACD, WANG and AS on two open datasets. The results show that we have the best performance under noise while keeping the speed of the algorithm.

Circle detection is a fundamental problem in computer vision. However, conventional circle detection algorithms are usually time-consuming and sensitive to noise. In order to solve these shortcomings, we propose a fast circle detection algorithm based on information compression. First, we introduce the idea of information compression, which compresses the circular information on the image into a small number of points while removing some of the noise through sharpness estimation and orientation filtering. Then, the circle parameters stored in the information point are obtained by the average sampling algorithm with a time complexity of O(1) to obtain candidate circles. Finally, we set different constraints on the complete circle and the defective circle according to the sampling results and find the true circle from the candidate circles. The experimental results on the three datasets show that our method can compress the circular information in the image into 1% of the information points, and compared to RHT, RCD, Jiang, Wang and CACD, Precision, Recall, Time and F-measure are greatly improved.

The accurate noise parameter is essential for the Kalman filter to obtain optimal estimates. However, problems such as variations in the noise environment and measurement anomalies can cause degradation of estimation accuracy or even divergence. The adaptive Kalman filter can simultaneously estimate state and noise parameters, while its performance will also be degraded in complex noise. To address the problem of estimation accuracy degradation and result divergence of the integrated navigation system in a complex time-varying noise environment, an improved multiple-model adaptive estimation (MMAE) that combines the Sage–Husa adaptive unscented Kalman filter with the MMAE is proposed in this paper. The forgetting factor is included as an unknown parameter of MMAE so that the algorithm can adjust the value of the forgetting factor according to different system states. In addition, we improve the hypothesis testing algorithm of classical MMAE to deal with the competition problem of undesirable models that severely impacts the performance of variable-parameter MMAE and enhance the algorithm’s parameter identification capability. Simulation results show that this method enhances the system’s robustness to noises of different statistical properties and improves the estimation accuracy of the filter in time-varying noise environments.

As the Internet-of-Things (IoT) and edge computing have been major paradigms for distributed data collection, communication, and processing, smart city applications in the real world tend to adopt IoT and edge computing broadly. Today, more and more machine learning algorithms would be deployed into front-end sensors, devices, and edge data centres rather than centralised cloud data centres. However, front-end sensors and devices are usually not so capable as those computing units in huge data centres, and for this sake, in practice, engineers choose to compromise for limited capacity of embedded computing and limited memory, e.g., neural network models being pruned to fit embedded devices. Visual object tracking is one of many important elements of a smart city, and in the IoT and edge computing context, high requirements to computing power and memory space severely prevent massive and accurate tracking. In this paper, we report on our contribution to object tracking on lightweight computing including (1) using limited computing capacity and memory space to realise tracking; (2) proposing a new algorithm region proposal correlation filter fitting for most edge devices. Systematic evaluations show that (1) our techniques can fit most IoT devices; (2) our techniques can keep relatively high accuracy; and (3) the generated model size is much less than others.

This paper proposed a new computing method to quantitatively and non-destructively determine the corrosion of steel strands by analyzing the self-magnetic flux leakage (SMFL) signals from them. The magnetic dipole model and three growth models (Logistic model, Exponential model, and Linear model) were proposed to theoretically analyze the characteristic value of SMFL. Then, the experimental study on the corrosion detection by the magnetic sensor was carried out. The setup of the magnetic scanning device and signal collection method were also introduced. The results show that the Logistic Growth model is verified as the optimal model for calculating the magnetic field with good fitting effects. Combined with the experimental data analysis, the amplitudes of the calculated values (BxL(x,z) curves) agree with the measured values in general. This method provides significant application prospects for the evaluation of the corrosion and the residual bearing capacity of steel strand.