Search

Aiming at the problems of the poor robustness and universality of traditional contour matching algorithms in engineering applications, a method for improving the surface defect detection of industrial products based on contour matching algorithms is detailed in this paper. Based on the image pyramid optimization method, a three-level matching method is designed, which can quickly obtain the candidate pose of the target contour at the top of the image pyramid, combining the integral graph and the integration graph acceleration strategy based on weak classification. It can quickly obtain the rough positioning and rough angle of the target contour, which greatly improves the performance of the algorithm. In addition, to solve the problem that a large number of duplicate candidate points will be generated when the target candidate points are expanded, a method to obtain the optimal candidate points in the neighborhood of the target candidate points is designed, which can guarantee the matching accuracy and greatly reduce the calculation amount. In order to verify the effectiveness of the algorithm, functional test experiments were designed for template building function and contour matching function, including uniform illumination condition, nonlinear condition and contour matching detection under different conditions. The results show that: (1) Under uniform illumination conditions, the detection accuracy can be maintained at about 93%. (2) Under nonlinear illumination conditions, the detection accuracy can be maintained at about 91.84%. (3) When there is an external interference source, there will be a false detection or no detection, and the overall defect detection rate remains above 94%. It is verified that the proposed method can meet the application requirements of common defect detection, and has good robustness and meets the expected functional requirements of the algorithm, providing a strong technical guarantee and data support for the design of embedded image sensors in the later stage. [ABSTRACT FROM AUTHOR]

Train wheels are crucial components for ensuring the safety of trains. The accurate and fast identification of wheel tread defects is necessary for the timely maintenance of wheels, which is essential for achieving the premise of conditional repair. Image-based detection methods are commonly used for detecting tread defects, but they still have issues with the misdetection of water stains and the leaking of small defects. In this paper, we address the challenges posed by the detection of wheel tread defects by proposing improvements to the YOLOv8 model. Firstly, the impact of water stains on tread defect detection is avoided by optimising the structure of the detection layer. Secondly, an improved SPPCSPC module is introduced to enhance the detection of small targets. Finally, the SIoU loss function is used to accelerate the convergence speed of the network, which ensures defect recognition accuracy with high operational efficiency. Validation was performed on the constructed tread defect dataset. The results demonstrate that the enhanced YOLOv8 model in this paper outperforms the original network and significantly improves the tread defect detection indexes. The average precision, accuracy, and recall reached 96.95%, 96.30%, and 95.31%. [ABSTRACT FROM AUTHOR]

Scanning ion conductance microscopy (SICM) enables the non-invasive three-dimensional imaging of live cells and other structures in physiological environments. However, when imaging complex samples, SICM faces challenges such as having a low temporal resolution during slow scanning and a reduced signal-to-noise ratio during fast scanning, making it difficult to simultaneously improve both temporal and spatial resolution. To address these issues, this paper proposes an algorithm for enhancing image resolution under high-speed scanning. Firstly, scanning images are preprocessed using a median filtering algorithm to remove the salt-and-pepper noise generated during high-speed scanning. Next, the Canny edge detection algorithm is employed to extract the edges of the image targets. To avoid blurring the edges, the new edge-directed interpolation (NEDI) algorithm is then used to fill the edges, while non-edge areas are filled using bilinear interpolation, thereby enhancing the image resolution. Finally, the peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM) are used to analyze the imaging of articular chondrocytes. The results show that under a scanning speed of 480 nm/ms, the proposed algorithm improves the temporal resolution of imaging by 60% compared to traditional 2× resolution imaging, increases the peak signal-to-noise ratio of the scanning images by 7 dB, and achieves a structural similarity of 0.97. Therefore, the proposed algorithm effectively removes noise during high-speed scanning and improves the SICM scanning imaging resolution, thereby avoiding the reduction in temporal resolution when scanning larger resolution samples and effectively enhancing the performance of SICM scanning imaging. [ABSTRACT FROM AUTHOR]

In this article, we address the problem of synchronizing multiple analog-to-digital converter (ADC) and digital-to-analog converter (DAC) chains in a multi-channel system, which is constrained by the sampling frequency and inconsistencies among the components during system integration. To evaluate and compensate for the synchronization differences, we propose a pulse compression shape-based algorithm to measure the entire delay parameter of the ADC/DAC chain, which achieves sub-sampling resolution by mapping the shape of the discrete pulse compression peak to the signal propagation delay. Moreover, owing to the matched filtering in the pulse compression process, the algorithm exhibits good noise performance and is suitable for wireless scenarios. Experiments verified that the algorithm can achieve precise measurements with sub-sampling resolution in scenarios where the signal-to-noise ratio (SNR) is greater than −10 dB. [ABSTRACT FROM AUTHOR]

This paper proposes the Lock-Position-Based RFID Adaptive Parallel Collision Tree (LAPCT) algorithm to address the issues of excessive time slots required in the identification process of collision tree algorithms for multiple tags and the high communication complexity between the reader and multiple tags. The LAPCT algorithm adopts a single-query multiple-response mechanism and dynamically divides the response sub-cycle numbers in the identification cycle based on an adaptive strategy. It uses Manchester encoding to lock collision positions and generate a common query prefix, effectively reducing the number of reader queries. This reduction in queries decreases the total number of required time slots and transmitted bits during the reader–tag communication process, thereby improving the efficiency of multiple tag recognition. Theoretical and simulation experiments demonstrate that compared to similar algorithms, the LAPCT algorithm achieves a maximum reduction of 37% in total time slots required, a maximum improvement of 30% in recognition efficiency, and a maximum reduction of 90% in communication complexity. Furthermore, with an increase in the number of tags, the performance advantages of the LAPCT algorithm become more pronounced, making it suitable for large-scale tag scenarios. [ABSTRACT FROM AUTHOR]

With the advancement of artificial intelligence technology and computer hardware, the stereo matching algorithm has been widely researched and applied in the field of image processing. In scenarios such as robot navigation and autonomous driving, stereo matching algorithms are used to assist robots in acquiring depth information about the surrounding environment, thereby improving the robot's ability for autonomous navigation during self-driving. In this paper, we address the issue of low matching accuracy of stereo matching algorithms in specular regions of images and propose a multi-attention-based stereo matching algorithm called MANet. The proposed algorithm embeds a multi-spectral attention module into the residual feature-extraction network of the PSMNet algorithm. It utilizes different 2D discrete cosine transforms to extract frequency-specific feature information, providing rich and effective features for cost computation in matching. The pyramid pooling module incorporates a coordinated attention mechanism, which not only maintains long-range dependencies with directional awareness but also captures more positional information during the pooling process, thereby enhancing the network's representational capacity. The MANet algorithm was evaluated on three major benchmark datasets, namely, SceneFlow, KITTI2015, and KITTI2012, and compared with relevant algorithms. Experimental results demonstrated that the MANet algorithm achieved higher accuracy in predicting disparities and exhibited stronger robustness against specular reflections, enabling more accurate disparity prediction in specular regions. [ABSTRACT FROM AUTHOR]

In the context of predicting pedestrian trajectories for indoor mobile robots, it is crucial to accurately measure the distance between indoor pedestrians and robots. This study aims to address this requirement by extracting pedestrians as regions of interest and mitigating issues related to inaccurate depth camera distance measurements and illumination conditions. To tackle these challenges, we focus on an improved version of the H-GrabCut image segmentation algorithm, which involves four steps for segmenting indoor pedestrians. Firstly, we leverage the YOLO-V5 object recognition algorithm to construct detection nodes. Next, we propose an enhanced BIL-MSRCR algorithm to enhance the edge details of pedestrians. Finally, we optimize the clustering features of the GrabCut algorithm by incorporating two-dimensional entropy, UV component distance, and LBP texture feature values. The experimental results demonstrate that our algorithm achieves a segmentation accuracy of 97.13% in both the INRIA dataset and real-world tests, outperforming alternative methods in terms of sensitivity, missegmentation rate, and intersection-over-union metrics. These experiments confirm the feasibility and practicality of our approach. The aforementioned findings will be utilized in the preliminary processing of indoor mobile robot pedestrian trajectory prediction and enable path planning based on the predicted results. [ABSTRACT FROM AUTHOR]

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

Path planning is an important part of the navigation control system of mobile robots since it plays a decisive role in whether mobile robots can realize autonomy and intelligence. The particle swarm algorithm can effectively solve the path-planning problem of a mobile robot, but the traditional particle swarm algorithm has the problems of a too-long path, poor global search ability, and local development ability. Moreover, the existence of obstacles makes the actual environment more complex, thus putting forward more stringent requirements on the environmental adaptation ability, path-planning accuracy, and path-planning efficiency of mobile robots. In this study, an artificial potential field-based particle swarm algorithm (apfrPSO) was proposed. First, the method generates robot planning paths by adjusting the inertia weight parameter and ranking the position vector of particles (rPSO), and second, the artificial potential field method is introduced. Through comparative numerical experiments with other state-of-the-art algorithms, the results show that the algorithm proposed was very competitive. [ABSTRACT FROM AUTHOR]

The combination of ultra-wide band (UWB) and inertial measurement unit (IMU) positioning is subject to random errors and non-line-of-sight errors, and in this paper, an improved positioning strategy is proposed to address this problem. The Kalman filter (KF) is used to pre-process the original UWB measurements, suppressing the effect of range mutation values of UWB on combined positioning, and the extended Kalman filter (EKF) is used to fuse the UWB measurements with the IMU measurements, with the difference between the two measurements used as the measurement information. The non-line-of-sight (NLOS) measurement information is also used. The optimal estimate is obtained by adjusting the system measurement noise covariance matrix in real time, according to the judgment result, and suppressing the interference of non-line-of-sight factors. The optimal estimate of the current state is fed back to the UWB range value in the next state, and the range value is dynamically adjusted after one-dimensional filtering pre-processing. Compared with conventional tightly coupled positioning, the positioning accuracy of the method in this paper is improved by 46.15% in the field experimental positioning results. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new path planning algorithm based on the probabilistic roadmaps method (PRM), in order to effectively solve the autonomous path planning of mobile robots in complex environments with multiple narrow channels. The improved PRM algorithm mainly improves the density and distribution of sampling points in the narrow channel, through a combination of the learning process of the PRM algorithm and the APF algorithm. We also shortened the required time and path length by optimizing the query process. The first key technology to improve the PRM algorithm involves optimizing the number and distribution of free points and collision-free lines in the free workspace. To ensure full visibility of the narrow channel, we extend the obstacles through the diagonal distance of the mobile robot while ignoring the safety distance. Considering the safety distance during movement, we re-classify the all sampling points obtained by the quasi-random sampling principle into three categories: free points, obstacle points, and adjacent points. Next, we transform obstacle points into the free points of the narrow channel by combining the APF algorithm and the characteristics of the narrow channel, increasing the density of sampling points in the narrow space. Then, we include potential energy judgment into the construction process of collision-free lines shortening the required time and reduce collisions with obstacles. Optimizing the query process of the PRM algorithm is the second key technology. To reduce the required time in the query process, we adapt the bidirectional A* algorithm to query these local paths and obtain an effective path to the target point. We also combine the path pruning technology with the potential energy function to obtain a short path without collisions. Finally, the experimental results demonstrate that the new PRM path planning technology can improve the density of free points in narrow spaces and achieve an optimized, collision-free path in complex environments with multiple narrow channels. [ABSTRACT FROM AUTHOR]

With the rise of robotics within various fields, there has been a significant development in the use of mobile robots. For mobile robots performing unmanned delivery tasks, autonomous robot navigation based on complex environments is particularly important. In this paper, an improved Gray Wolf Optimization (GWO)-based algorithm is proposed to realize the autonomous path planning of mobile robots in complex scenarios. First, the strategy for generating the initial wolf pack of the GWO algorithm is modified by introducing a two-dimensional Tent–Sine coupled chaotic mapping in this paper. This guarantees that the GWO algorithm generates the initial population diversity while improving the randomness between the two-dimensional state variables of the path nodes. Second, by introducing the opposition-based learning method based on the elite strategy, the adaptive nonlinear inertia weight strategy and random wandering law of the Butterfly Optimization Algorithm (BOA), this paper improves the defects of slow convergence speed, low accuracy, and imbalance between global exploration and local mining functions of the GWO algorithm in dealing with high-dimensional complex problems. In this paper, the improved algorithm is named as an EWB-GWO algorithm, where EWB is the abbreviation of three strategies. Finally, this paper enhances the rationalization of the initial population generation of the EWB-GWO algorithm based on the visual-field line detection technique of Bresenham's line algorithm, reduces the number of iterations of the EWB-GWO algorithm, and decreases the time complexity of the algorithm in dealing with the path planning problem. The simulation results show that the EWB-GWO algorithm is very competitive among metaheuristics of the same type. It also achieves optimal path length measures and smoothness metrics in the path planning experiments. [ABSTRACT FROM AUTHOR]

The purpose of image dehazing is to remove the interference from weather factors in degraded images and enhance the clarity and color saturation of images to maximize the restoration of useful features. Single image dehazing is one of the most important tasks in the field of image restoration. In recent years, due to the progress of deep learning, single image dehazing has made great progress. With the success of Transformer in advanced computer vision tasks, some research studies also began to apply Transformer to image dehazing tasks and obtained surprising results. However, both the deconvolution-neural-network-based dehazing algorithm and Transformer based dehazing algorithm magnify their advantages and disadvantages separately. Therefore, this paper proposes a novel Transformer–Convolution fusion dehazing network (TCFDN), which uses Transformer's global modeling ability and convolutional neural network's local modeling ability to improve the dehazing ability. In the Transformer–Convolution fusion dehazing network, the classic self-encoder structure is used. This paper proposes a Transformer–Convolution hybrid layer, which uses an adaptive fusion strategy to make full use of the Swin-Transformer and convolutional neural network to extract and reconstruct image features. On the basis of previous research, this layer further improves the ability of the network to remove haze. A series of contrast experiments and ablation experiments not only proved that the Transformer–Convolution fusion dehazing network proposed in this paper exceeded the more advanced dehazing algorithm, but also provided solid and powerful evidence for the basic theory on which it depends. [ABSTRACT FROM AUTHOR]

The image of expressway asphalt pavement crack disease obtained by a three-dimensional line scan laser is easily affected by external factors such as uneven illumination distribution, environmental noise, occlusion shadow, and foreign bodies on the pavement. To locate and extract cracks accurately and efficiently, this article proposes a three-stage asphalt pavement crack location and segmentation method based on traditional digital image processing technology and deep learning methods. In the first stage of this method, the guided filtering and Retinex methods are used to preprocess the asphalt pavement crack image. The processed image removes redundant noise information and improves the brightness. At the information entropy level, it is 63% higher than the unpreprocessed image. In the second stage, the newly proposed YOLO-SAMT target detection model is used to locate the crack diseases in asphalt pavement. The model is 5.42 percentage points higher than the original YOLOv7 model on mAP@0.5, which enhances the recognition and location ability of crack diseases and reduces the calculation amount for the extraction of crack contour in the next stage. In the third stage, the improved k-means clustering algorithm is used to extract cracks. Compared with the traditional k-means clustering algorithm, this method improves the accuracy by 7.34 percentage points, the true rate by 6.57 percentage points, and the false positive rate by 18.32 percentage points to better extract the crack contour. To sum up, the method proposed in this article improves the quality of the pavement disease image, enhances the ability to identify and locate cracks, reduces the amount of calculation, improves the accuracy of crack contour extraction, and provides a new solution for highway crack inspection. [ABSTRACT FROM AUTHOR]

Aiming at the common problems, such as noise pollution, low contrast, and color distortion in underwater images, and the characteristics of holothurian recognition, such as morphological ambiguity, high similarity with the background, and coexistence of special ecological scenes, this paper proposes an underwater holothurian target-detection algorithm (FA-CenterNet), based on improved CenterNet and scene feature fusion. First, to reduce the model's occupancy of embedded device resources, we use EfficientNet-B3 as the backbone network to reduce the model's Params and FLOPs. At the same time, EfficientNet-B3 increases the depth and width of the model, which improves the accuracy of the model. Then, we design an effective FPT (feature pyramid transformer) combination module to fully focus and mine the information on holothurian ecological scenarios of different scales and spaces (e.g., holothurian spines, reefs, and waterweeds are often present in the same scenario as holothurians). The co-existing scene information can be used as auxiliary features to detect holothurians, which can improve the detection ability of fuzzy and small-sized holothurians. Finally, we add the AFF module to realize the deep fusion of the shallow-detail and high-level semantic features of holothurians. The results show that the method presented in this paper yields better results on the 2020 CURPC underwater target-detection image dataset with an AP50 of 83.43%, Params of 15.90 M, and FLOPs of 25.12 G compared to other methods. In the underwater holothurian-detection task, this method improves the accuracy of detecting holothurians with fuzzy features, a small size, and dense scene. It also achieves a good balance between detection accuracy, Params, and FLOPs, and is suitable for underwater holothurian detection in most situations. [ABSTRACT FROM AUTHOR]

As a classic positioning algorithm with a simple principle and low computational complexity, the trilateration positioning algorithm utilizes the coordinates of three anchor nodes to determine the position of an unknown node, which is widely applied in various positioning scenes. However, due to the environmental noise, environmental interference, the distance estimation error, the uncertainty of anchor nodes' coordinates, and other negative factors, the positioning error increases significantly. For this problem, we propose a new trilateration algorithm based on the combination and K-Means clustering to effectively remove the positioning results with significant errors in this paper, which makes full use of the position and distance information of the anchor nodes in the area. In this method, after analyzing the factors affecting the optimization of the trilateration and selecting optimal parameters, we carry out experiments to verify the effectiveness and feasibility of the proposed algorithm. We also compare the positioning accuracy and positioning efficiency of the proposed algorithm with those of other algorithms in different environments. According to the comparison of the least-squares method, the maximum likelihood method, the classical trilateration and the proposed trilateration, the results of the experiments show that the proposed trilateration algorithm performs well in the positioning accuracy and efficiency in both light-of-sight (LOS) and non-light-of-sight (NLOS) environments. Then, we test our approach in three realistic environments, i.e., indoor, outdoor and hall. The experimental results show that when there are few available anchor nodes, the proposed localization method reduces the mean distance error compared with the classical trilateration, the least-squares method, and the maximum likelihood. [ABSTRACT FROM AUTHOR]

The new generation video coding standard Versatile Video Coding (VVC) has adopted many novel technologies to improve compression performance, and consequently, remarkable results have been achieved. In practical applications, less data, in terms of bitrate, would reduce the burden of the sensors and improve their performance. Hence, to further enhance the intra compression performance of VVC, we propose a fusion-based intra prediction algorithm in this paper. Specifically, to better predict areas with similar texture information, we propose a fusion-based adaptive template matching method, which directly takes the error between reference and objective templates into account. Furthermore, to better utilize the correlation between reference pixels and the pixels to be predicted, we propose a fusion-based linear prediction method, which can compensate for the deficiency of single linear prediction. We implemented our algorithm on top of the VVC Test Model (VTM) 9.1. When compared with the VVC, our proposed fusion-based algorithm saves a bitrate of 0.89%, 0.84%, and 0.90% on average for the Y, Cb, and Cr components, respectively. In addition, when compared with some other existing works, our algorithm showed superior performance in bitrate savings. [ABSTRACT FROM AUTHOR]

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

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

The PID control algorithm for balancing robot attitude control suffers from the problem of difficult parameter tuning. Previous studies have proposed using metaheuristic algorithms to tune the PID parameters. However, traditional metaheuristic algorithms are subject to the criticism of premature convergence and the possibility of falling into local optimum solutions. Therefore, the present paper proposes a CFHBA-PID algorithm for balancing robot Dual-loop PID attitude control based on Honey Badger Algorithm (HBA) and CF-ITAE. On the one hand, HBA maintains a sufficiently large population diversity throughout the search process and employs a dynamic search strategy for balanced exploration and exploitation, effectively avoiding the problems of classical intelligent optimization algorithms and serving as a global search. On the other hand, a novel complementary factor (CF) is proposed to complement integrated time absolute error (ITAE) with the overshoot amount, resulting in a new rectification indicator CF-ITAE, which balances the overshoot amount and the response time during parameter tuning. Using balancing robot as the experimental object, HBA-PID is compared with AOA-PID, WOA-PID, and PSO-PID, and the results demonstrate that HBA-PID outperforms the other three algorithms in terms of overshoot amount, stabilization time, ITAE, and convergence speed, proving that the algorithm combining HBA with PID is better than the existing mainstream algorithms. The comparative experiments using CF prove that CFHBA-PID is able to effectively control the overshoot amount in attitude control. In conclusion, the CFHBA-PID algorithm has great control and significant results when applied to the balancing robot. [ABSTRACT FROM AUTHOR]

To address the problems of uneven distribution and low coverage of wireless sensor network (WSN) nodes in random deployment, a node coverage optimization strategy with an improved COOT bird algorithm (COOTCLCO) is proposed. Firstly, the chaotic tent map is used to initialize the population, increase the diversity of the population, and lay the foundation for the global search for the optimal solutions. Secondly, the Lévy flight strategy is used to perturb the individual positions to improve the search range of the population. Thirdly, Cauchy mutation and an opposition-based learning strategy are fused to perturb the optimal solutions to generate new solutions and enhance the ability of the algorithm to jump out of the local optimum. Finally, the COOTCLCO algorithm is applied to WSN coverage optimization problems. Simulation results show that COOTCLCO has a faster convergence speed and better search accuracy than several other typical algorithms on 23 benchmark test functions; meanwhile, the coverage rate of the COOTCLCO algorithm is increased by 9.654%, 13.888%, 6.188%, 5.39%, 1.31%, and 2.012% compared to particle swarm optimization (PSO), butterfly optimization algorithm (BOA), seagull optimization algorithm (SOA), whale optimization algorithm (WOA), Harris hawks optimization (HHO), and bald eagle search (BES), respectively. This means that in terms of coverage optimization effect, COOTCLCO can obtain a higher coverage rate compared to these algorithms. The experimental results demonstrate that COOTCLCO can effectively improve the coverage rate of sensor nodes and improve the distribution of nodes in WSN coverage optimization problems. [ABSTRACT FROM AUTHOR]

This paper studies the problem of maximizing the energy utilization for data transmission in sensors with periodical wireless charging process while taking into account the thermal effect. Two classes of problems are analyzed: one is the case that wireless charging can process for only a limited period of time, and the other is the case that wireless charging can process for a long enough time. Algorithms are proposed to solve the problems and analysis of these algorithms are also provided. For the first problem, three subproblems are studied, and, for the general problem, we give an algorithm that can derive a performance bound of (1−1/2m)(OPT−E) compared to an optimal solution. In addition, for the second problem, we provide an algorithm with 2m/2m−1OPT+1 performance bound for the general problem. Simulations confirm the analysis of the algorithms [ABSTRACT FROM AUTHOR]

From object tracking to 3D reconstruction, RGB-Depth (RGB-D) camera networks play an increasingly important role in many vision and graphics applications. Practical applications often use sparsely-placed cameras to maximize visibility, while using as few cameras as possible to minimize cost. In general, it is challenging to calibrate sparse camera networks due to the lack of shared scene features across different camera views. In this paper, we propose a novel algorithm that can accurately and rapidly calibrate the geometric relationships across an arbitrary number of RGB-D cameras on a network. Our work has a number of novel features. First, to cope with the wide separation between different cameras, we establish view correspondences by using a spherical calibration object. We show that this approach outperforms other techniques based on planar calibration objects. Second, instead of modeling camera extrinsic calibration using rigid transformation, which is optimal only for pinhole cameras, we systematically test different view transformation functions including rigid transformation, polynomial transformation and manifold regression to determine the most robust mapping that generalizes well to unseen data. Third, we reformulate the celebrated bundle adjustment procedure to minimize the global 3D reprojection error so as to fine-tune the initial estimates. Finally, our scalable client-server architecture is computationally efficient: the calibration of a five-camera system, including data capture, can be done in minutes using only commodity PCs. Our proposed framework is compared with other state-of-the-arts systems using both quantitative measurements and visual alignment results of the merged point clouds. [ABSTRACT FROM AUTHOR]

The superpixel segmentation algorithm, as a preprocessing technique, should show good performance in fast segmentation speed, accurate boundary adherence and homogeneous regularity. A fast superpixel segmentation algorithm by iterative edge refinement (IER) works well on optical images. However, it may generate poor superpixels for Polarimetric synthetic aperture radar (PolSAR) images due to the influence of strong speckle noise and many small-sized or slim regions. To solve these problems, we utilized a fast revised Wishart distance instead of Euclidean distance in the local relabeling of unstable pixels, and initialized unstable pixels as all the pixels substituted for the initial grid edge pixels in the initialization step. Then, postprocessing with the dissimilarity measure is employed to remove the generated small isolated regions as well as to preserve strong point targets. Finally, the superiority of the proposed algorithm is validated with extensive experiments on four simulated and two real-world PolSAR images from Experimental Synthetic Aperture Radar (ESAR) and Airborne Synthetic Aperture Radar (AirSAR) data sets, which demonstrate that the proposed method shows better performance with respect to several commonly used evaluation measures, even with about nine times higher computational efficiency, as well as fine boundary adherence and strong point targets preservation, compared with three state-of-the-art methods. [ABSTRACT FROM AUTHOR]

COMPASS is an indigenously developed Chinese global navigation satellite system and will share many features in common with GPS (Global Positioning System). Since the ultra-tight GPS/INS (Inertial Navigation System) integration shows its advantage over independent GPS receivers in many scenarios, the federated ultra-tight COMPASS/INS integration has been investigated in this paper, particularly, by proposing a simplified prefilter model. Compared with a traditional prefilter model, the state space of this simplified system contains only carrier phase, carrier frequency and carrier frequency rate tracking errors. A two-quadrant arctangent discriminator output is used as a measurement. Since the code tracking error related parameters were excluded from the state space of traditional prefilter models, the code/carrier divergence would destroy the carrier tracking process, and therefore an adaptive Kalman filter algorithm tuning process noise covariance matrix based on state correction sequence was incorporated to compensate for the divergence. The federated ultra-tight COMPASS/INS integration was implemented with a hardware COMPASS intermediate frequency (IF), and INS's accelerometers and gyroscopes signal sampling system. Field and simulation test results showed almost similar tracking and navigation performances for both the traditional prefilter model and the proposed system; however, the latter largely decreased the computational load. [ABSTRACT FROM AUTHOR]

Detection of human lower body provides an implementation idea for the automatic tracking and accurate relocation of automatic vehicles. Based on traditional SSD and ResNet, this paper proposes an improved detection algorithm R-SSD for human lower body detection, which utilizes ResNet50 instead of VGG16 to improve the feature extraction level of the model. According to the application of acquisition equipment, the model input resolution is increased to 448 × 448 and the model detection range is expanded. Six feature maps of the updated resolution network are selected for detection and the lower body image dataset is clustered into five categories for aspect ratio, which are evenly distributed to each feature detection map. The experimental results show that the model R-SSD detection accuracy after training reaches 85.1% mAP. Compared with the original SSD, the detection accuracy is improved by 7% mAP. The detection confidence in practical application reaches more than 99%, which lays the foundation for subsequent tracking and relocation for automatic vehicles. [ABSTRACT FROM AUTHOR]

Principal Component Analysis (PCA) is one of the main methods used for electronic nose pattern recognition. However, poor classification performance is common in classification and recognition when using regular PCA. This paper aims to improve the classification performance of regular PCA based on the existing Wilks A-statistic (i.e., combined PCA with the Wilks distribution). The improved algorithms, which combine regular PCA with the Wilks A-statistic, were developed after analysing the functionality and defects of PCA. Verification tests were conducted using a PEN3 electronic nose. The collected samples consisted of the volatiles of six varieties of rough rice (Zhongxiang1, Xiangwan13, Yaopingxiang, WufengyouT025, Pin 36, and Youyou122), grown in same area and season. The first two principal components used as analysis vectors cannot perform the rough rice varieties classification task based on a regular PCA. Using the improved algorithms, which combine the regular PCA with the Wilks A-statistic, many different principal components were selected as analysis vectors. The set of data points of the Mahalanobis distance between each of the varieties of rough rice was selected to estimate the performance of the classification. The result illustrates that the rough rice varieties classification task is achieved well using the improved algorithm. A Probabilistic Neural Networks (PNN) was also established to test the effectiveness of the improved algorithms. The first two principal components (namely PC1 and PC2) and the first and fifth principal component (namely PC1 and PC5) were selected as the inputs of PNN for the classification of the six rough rice varieties. The results indicate that the classification accuracy based on the improved algorithm was improved by 6.67% compared to the results of the regular method. These results prove the effectiveness of using the Wilks Λ-statistic to improve the classification accuracy of the regular PCA approach. The results also indicate that the electronic nose provides a non-destructive and rapid classification method for rough rice. [ABSTRACT FROM AUTHOR]

Establishing an effective local feature descriptor and using an accurate key point matching algorithm are two crucial tasks in recognizing and registering on the 3D point cloud. Because the descriptors need to keep enough descriptive ability against the effect of noise, occlusion, and incomplete regions in the point cloud, a suitable key point matching algorithm can get more precise matched pairs. To obtain an effective descriptor, this paper proposes a Multi-Statistics Histogram Descriptor (MSHD) that combines spatial distribution and geometric attributes features. Furthermore, based on deep learning, we developed a new key point matching algorithm that could identify more corresponding point pairs than the existing methods. Our method is evaluated based on Stanford 3D dataset and four real component point cloud dataset from the train bottom. The experimental results demonstrate the superiority of MSHD because its descriptive ability and robustness to noise and mesh resolution are greater than those of carefully selected baselines (e.g., FPFH, SHOT, RoPS, and SpinImage descriptors). Importantly, it has been confirmed that the error of rotation and translation matrix is much smaller based on our key point matching algorithm, and the precise corresponding point pairs can be captured, resulting in enhanced recognition and registration for three-dimensional surface matching. [ABSTRACT FROM AUTHOR]

Only a few effective methods can detect internal defects and monitor the internal state of complex structural parts. On the basis of the principle of PET (positron emission computed tomography), a new measurement method, using γ photon to detect defects of an inner surface, is proposed. This method has the characteristics of strong penetration, anti-corrosion and anti-interference. With the aim of improving detection accuracy and imaging speed, this study also proposes image reconstruction algorithms, combining the classic FBP (filtered back projection) with MLEM (maximum likelihood expectation Maximization) algorithm. The proposed scheme can reduce the number of iterations required, when imaging, to achieve the same image quality. According to the operational demands of FPGAs (field-programmable gate array), a BPML (back projection maximum likelihood) algorithm is adapted to the structural characteristics of an FPGA, which makes it feasible to test the proposed algorithms therein. Furthermore, edge detection and defect recognition are conducted after reconstructing the inner image. The effectiveness and superiority of the algorithm are verified, and the performance of the FPGA is evaluated by the experiments. [ABSTRACT FROM AUTHOR]

High-precision indoor localisation is becoming a necessity with novel location-based services that are emerging around 5G. The deployment of high-precision indoor location technologies is usually costly due to the high density of reference points. In this work, we propose the opportunistic fusion of several different technologies, such as ultra-wide band (UWB) and WiFi fine-time measurement (FTM), in order to improve the performance of location. We also propose the use of fusion with cellular networks, such as LTE, to complement these technologies where the number of reference points is under-determined, increasing the availability of the location service. Maximum likelihood estimation (MLE) is presented to weight the different reference points to eliminate outliers, and several searching methods are presented and evaluated for the localisation algorithm. An experimental setup is used to validate the presented system, using UWB and WiFi FTM due to their incorporation in the latest flagship smartphones. It is shown that the use of multi-technology fusion in trilateration algorithm remarkably optimises the precise coverage area. In addition, it reduces the positioning error by over-determining the positioning problem. This technique reduces the costs of any network deployment oriented to location services, since a reduced number of reference points from each technology is required. [ABSTRACT FROM AUTHOR]

This paper considers the problem of robust bearing-only source localization in impulsive noise with symmetric α -stable distribution based on the Lp-norm minimization criterion. The existing Iteratively Reweighted Pseudolinear Least-Squares (IRPLS) method can be used to solve the least LP-norm optimization problem. However, the IRPLS algorithm cannot reduce the bias attributed to the correlation between system matrices and noise vectors. To reduce this kind of bias, a Total Lp-norm Optimization (TLPO) method is proposed by minimizing the errors in all elements of system matrix and data vector based on the minimum dispersion criterion. Subsequently, an equivalent form of TLPO is obtained, and two algorithms are developed to solve the TLPO problem by using Iterative Generalized Eigenvalue Decomposition (IGED) and Generalized Lagrange Multiplier (GLM), respectively. Numerical examples demonstrate the performance advantage of the IGED and GLM algorithms over the IRPLS algorithm. [ABSTRACT FROM AUTHOR]

The advantages of UAV video in flexibility, traceability, easy-operation, and abundant information make it a popular and powerful aerial tool applied in traffic monitoring in recent years. This paper proposed a systematic approach to detect and track vehicles based on the YOLO v3 model and the deep SORT algorithm for further extracting key traffic parameters. A field experiment was implemented to provide data for model training and validation to ensure the accuracy of the proposed approach. In the experiment, 5400 frame images and 1192 speed points were collected from two test vehicles equipped with high-precision GNSS-RTK and onboard OBD after completion of seven experimental groups with a different height (150 m to 500 m) and operating speed (40 km/h to 90 km/h). The results indicate that the proposed approach exhibits strong robustness and reliability, due to the 90.88% accuracy of object detection and 98.9% precision of tracking vehicle. Moreover, the absolute and relative error of extracted speed falls within ±3 km/h and 2%, respectively. The overall accuracy of the extracted parameters reaches up to 98%. [ABSTRACT FROM AUTHOR]

In order to meet the needs of intelligent perception of the driving environment, a point cloud registering method based on 3D NDT-ICP algorithm is proposed to improve the modeling accuracy of tunneling roadway environments. Firstly, Voxel Grid filtering method is used to preprocess the point cloud of tunneling roadways to maintain the overall structure of the point cloud and reduce the number of point clouds. After that, the 3D NDT algorithm is used to solve the coordinate transformation of the point cloud in the tunneling roadway and the cell resolution of the algorithm is optimized according to the environmental features of the tunneling roadway. Finally, a kd-tree is introduced into the ICP algorithm for point pair search, and the Gauss–Newton method is used to optimize the solution of nonlinear objective function of the algorithm to complete accurate registering of tunneling roadway point clouds. The experimental results show that the 3D NDT algorithm can meet the resolution requirement when the cell resolution is set to 0.5 m under the condition of processing the point cloud with the environmental features of tunneling roadways. At this time, the registering time is the shortest. Compared with the NDT algorithm, ICP algorithm and traditional 3D NDT-ICP algorithm, the registering speed of the 3D NDT-ICP algorithm proposed in this paper is obviously improved and the registering error is smaller. [ABSTRACT FROM AUTHOR]

An accurate vehicle driving state observer is a necessary condition for a safe automotive electronic control system. Vehicle driving state observer is challenged by unknown measurement noise and transient disturbances caused by complex working conditions and sensor failure. For the classical adaptive unscented Kalman filter (AUKF) algorithm, transient disturbances will cause the failure of state estimation and affect the subsequent process. This paper proposes an AUKF based on a modified Sage–Husa filter and divergence calculation technique for multi-dimensional vehicle driving state observation. Based on the seven-degrees-of-freedom vehicle model and the Dugoff tire model, the proposed algorithm corrects the measurement noise by using modified Sage–Husa maximum posteriori. To reduce the influence of transient disturbance on the subsequent process, covariance matrix is updated after divergence is detected. The effectiveness of the algorithm is tested on the double lane change and Sine Wave road conditions. The robustness of the algorithm is tested under severe transient disturbance. The results demonstrate that the modified Sage–Husa UKF algorithm can accurately detect transient disturbance and effectively reduce the resulted accumulated error. Compared to classical AUKF, our algorithm significantly improves the accuracy and robustness of vehicle driving state estimation. The research in this paper provides a reference for multi-dimensional data processing under changeable vehicle driving states. [ABSTRACT FROM AUTHOR]

In this paper, a new approach of multi-sensor fusion algorithm based on the improved unscented particle filter (IUPF) and a new multi-sensor distributed fusion model are proposed. Additionally, we employ a novel multi-target tracking algorithm that combines the joint probabilistic data association (JPDA) algorithm and the IUPF algorithm. To improve the real-time performance of the UPF algorithm for the maneuvering target, minimum skew simplex unscented transform combined with a scaled unscented transform is utilized, which significantly reduces the calculation of UPF sample selection. Moreover, a self-adaptive gain modification coefficient is defined to solve the low accuracy problem caused by the sigma point reduction, and the problem of particle degradation is solved by modifying the weights calculation method. In addition, a new multi-sensor fusion model is proposed, which better integrates radar and infrared sensors. Simulation results show that IUPF effectively improves real-time performance while ensuring the tracking accuracy compared with other algorithms. Besides, compared with the traditional distributed fusion architecture, the proposed new architecture makes better use of the advantages of radar and an infrared sensor and improves the tracking accuracy. [ABSTRACT FROM AUTHOR]

This paper presents an active wide-baseline triple-camera measurement system designed especially for 3D modeling in general outdoor environments, as well as a novel parallel surface refinement algorithm within the multi-view stereo (MVS) framework. Firstly, the pre-processing module converts the synchronized raw triple images from one single-shot acquisition of our setup to aligned RGB-Depth frames, which are then used for camera pose estimation using iterative closest point (ICP) and RANSAC perspective-n-point (PnP) approaches. Afterwards, an efficient dense reconstruction method, mostly implemented on the GPU in a grid manner, takes the raw depth data as input and optimizes the per-pixel depth values based on the multi-view photographic evidence, surface curvature and depth priors. Through a basic fusion scheme, an accurate and complete 3D model can be obtained from these enhanced depth maps. For a comprehensive test, the proposed MVS implementation is evaluated on benchmark and synthetic datasets, and a real-world reconstruction experiment is also conducted using our measurement system in an outdoor scenario. The results demonstrate that (1) our MVS method achieves very competitive performance in terms of modeling accuracy, surface completeness and noise reduction, given an input coarse geometry; and (2) despite some limitations, our triple-camera setup in combination with the proposed reconstruction routine, can be applied to some practical 3D modeling tasks operated in outdoor environments where conventional stereo or depth senors would normally suffer. [ABSTRACT FROM AUTHOR]

Cooperative transmission is a promising technology for underwater acoustic sensor networks (UASNs) to ensure the effective collection of underwater information. In this paper, we study the joint relay selection and power allocation problem to maximize the cumulative quality of information transmission in energy harvesting-powered UASNs (EH-UASNs). First, we formulate the process of cooperative transmission with joint strategy optimization as a Markov decision process model. In the proposed model, an effective state expression is presented to better reveal interactive relationship between learning and environment, thereby improving the learning ability. Then, we further propose a novel reward function which can guide nodes to adjust power strategy adaptively to balance instantaneous capacity and long-term quality of service (QoS) under the dynamic unpredictable energy harvesting. More specifically, we propose a deep Q-network-based resource allocation algorithm for EH-UASNs to solve the complex coupled strategy optimization problem without any prior underwater environment information. Finally, simulation results verify the superior performance of the proposed algorithm in improving the cumulative network capacity and reducing outages. [ABSTRACT FROM AUTHOR]

Reconstruction methods for discrete data, such as the Moving Least Squares (MLS) and Moving Total Least Squares (MTLS), have made a great many achievements with the progress of modern industrial technology. Although the MLS and MTLS have good approximation accuracy, neither of these two approaches are robust model reconstruction methods and the outliers in the data cannot be processed effectively as the construction principle results in distorted local approximation. This paper proposes an improved method that is called the Moving Total Least Trimmed Squares (MTLTS) to achieve more accurate and robust estimations. By applying the Total Least Trimmed Squares (TLTS) method to the orthogonal construction way in the proposed MTLTS, the outliers as well as the random errors of all variables that exist in the measurement data can be effectively suppressed. The results of the numerical simulation and measurement experiment show that the proposed algorithm is superior to the MTLS and MLS method from the perspective of robustness and accuracy. [ABSTRACT FROM AUTHOR]

We analyze the source of the position deviation and propose a demodulation recursive compensation algorithm to ensure a sub-millimeter resolution in improved optical frequency domain reflectometry. The position deviation between the geometric path and optical path changes with the temperature or strain, due to the elastic-optic and thermal-optic effects. It accumulates along the fiber and becomes large enough to affect the spectral correlation between the measured and reference spectra at the fiber end. The proposed algorithm compensates for the position deviation of each measuring point and aligns the measured spectra with its reference. The numerical and experimental results both reveal that the signal-to-noise ratio of the correlation is improved doubly and a sub-millimeter spatial resolution becomes available at a 30 m fiber end. The recursive compensation algorithm helps to restrain the correlation degeneration at the fiber end and promises an effective approach to a sub-millimeter resolution in optical frequency domain reflectometry. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel method for fault diagnosis in micro-electromechanical system (MEMS) inertial sensors using a bidirectional long short-term memory (BLSTM)-based Hilbert–Huang transform (HHT) and a convolutional neural network (CNN). First, the method for fault diagnosis of inertial sensors is formulated into an HHT-based deep learning problem. Second, we present a new BLSTM-based empirical mode decomposition (EMD) method for converting one-dimensional inertial data into two-dimensional Hilbert spectra. Finally, a CNN is used to perform fault classification tasks that use time–frequency HHT spectrums as input. According to our experimental results, significantly improved performance can be achieved, on average, for the proposed BLSTM-based EMD algorithm in terms of EMD computational efficiency compared with state-of-the-art algorithms. In addition, the proposed fault diagnosis method achieves high accuracy in fault classification. [ABSTRACT FROM AUTHOR]

The complexity of unmanned aerial vehicle (UAV) missions is increasing with the rapid development of UAV technology. Multiple UAVs usually cooperate in the form of teams to improve the efficiency of mission execution. The UAVs are equipped with multiple sensors with complementary functions to adapt to the complex mission constraints. Reasonable task assignment, task scheduling, and UAV trajectory planning are the prerequisites for efficient cooperation of multi-functional heterogeneous UAVs. In this paper, a multi-swarm fruit fly optimization algorithm (MFOA) with dual strategy switching is proposed to solve the multi-functional heterogeneous UAV cooperative mission planning problem with the criterion of simultaneously minimizing the makespan and the total mission time. First, the multi-swarm mechanism is introduced to enhance the global search capability of the fruit fly optimization algorithm. Second, in the smell-based search phase, the local search strategies and large-scale search strategies are designed to drive multiple fruit fly swarms, and the dual strategy switching method is presented. Third, in the vision-based search stage, the greedy selection strategy is adopted. Finally, numerical simulation experiments are designed. The simulation results show that the MFOA algorithm is more effective and stable for solving the multi-functional heterogeneous UAV cooperative mission planning problem compared with other algorithms. [ABSTRACT FROM AUTHOR]

Passenger flow prediction has drawn increasing attention in the deep learning research field due to its great importance in traffic management and public safety. The major challenge of this essential task lies in multiple spatiotemporal correlations that exhibit complex non-linear correlations. Although both the spatial and temporal perspectives have been considered in modeling, most existing works have ignored complex temporal correlations or underlying spatial similarity. In this paper, we identify the unique spatiotemporal correlation of urban metro flow, and propose an attention-based deep spatiotemporal network with multi-task learning (ADST-Net) at a citywide level to predict the future flow from historical observations. ADST-Net uses three independent channels with the same structure to model the recent, daily-periodic and weekly-periodic complicated spatiotemporal correlations, respectively. Specifically, each channel uses the framework of residual networks, the rectified block and the multi-scale convolutions to mine spatiotemporal correlations. The residual networks can effectively overcome the gradient vanishing problem. The rectified block adopts an attentional mechanism to automatically reweigh measurements at different time intervals, and the multi-scale convolutions are used to extract explicit spatial relationships. ADST-Net also introduces an external embedding mechanism to extract the influence of external factors on flow prediction, such as weather conditions. Furthermore, we enforce multi-task learning to utilize transition passenger flow volume prediction as an auxiliary task during the training process for generalization. Through this model, we can not only capture the steady trend, but also the sudden changes of passenger flow. Extensive experimental results on two real-world traffic flow datasets demonstrate the obvious improvement and superior performance of our proposed algorithm compared with state-of-the-art baselines. [ABSTRACT FROM AUTHOR]

As one of the important facilities for marine exploration, as well as environment monitoring, access control, and security, underwater wireless sensor networks (UWSNs) are widely used in related military and civil fields, since the sensor node localization is the basis of UWSNs' application in various related fields. Therefore, the research of localization algorithms based on UWSNs has gradually become one of the research hotspots today. However, unlike terrestrial wireless sensor networks (WSNs), many terrestrial monitoring and localization technologies cannot be directly applied to the underwater environment. Moreover, due to the complexity and particularity of the underwater environment, the localization of underwater sensor nodes still faces challenges, such as the localization ratio of sensor nodes, time synchronization, localization accuracy, and the mobility of nodes. In this paper, we propose a mobility-assisted localization scheme with time synchronization-free feature (MALS-TSF) for three-dimensional (3D) large-scale UWSNs. In addition, the underwater drift of the sensor node is considered in this scheme. The localization scheme can be divided into two phases. In Phase I, anchor nodes are distributed in the monitoring area, reducing the monitoring cost. Then, we address a time-synchronization-free localization scheme, to obtain the coordinates of the unknown sensor nodes. In Phase II, we use the method of two-way TOA to locate the remaining ordinary sensor nodes. The simulation results show that MALS-TSF can achieve a relatively high localization ratio without time synchronization. [ABSTRACT FROM AUTHOR]

Phaseless terahertz coded-aperture imaging (PL-TCAI) is a novel radar computational imaging method that utilizes the coded aperture and the incoherent detector array to achieve forward-looking and high-resolution imaging without relying on relative motion. In this paper, we propose a more reasonable and compact architecture for the PL-TCAI system and derive the imaging model of PL-TCAI based on the random frequency-hopping signal. Since most phase retrieval algorithms for PL-TCAI utilize only the intensity of echo signals to accurately reconstruct the target, excessive measurement samples are usually required. In order to reduce the number of measurement samples required for imaging, this paper proposes a sparse Wirtinger flow algorithm with optimal stepsize (SWFOS) by using the sparse prior of the target. The specific procedures of the SWFOS algorithm include the support recovery, initialization by truncated spectral method, iteration via gradient descent scheme, hard threshold operation, and stepsize optimization of iteration. Numerical simulations are performed, and the results show that the SWFOS algorithm not only has good performance for the PR problem, but can also sharply reduce the number of measurement samples required for imaging in the PL-TCAI system. [ABSTRACT FROM AUTHOR]

In this paper, we study the multi-sensor multi-target tracking problem in the formulation of random finite sets. The Gaussian Mixture probability hypothesis density (GM-PHD) method is employed to formulate the sequential fusing multi-sensor GM-PHD (SFMGM-PHD) algorithm. First, the GM-PHD is applied to multiple sensors to get the posterior GM estimations in a parallel way. Second, we propose the SFMGM-PHD algorithm to fuse the multi-sensor GM estimations in a sequential way. Third, the unbalanced weighted fusing and adaptive sequence ordering methods are further proposed for two improved SFMGM-PHD algorithms. At last, we analyze the proposed algorithms in four different multi-sensor multi-target tracking scenes, and the results demonstrate the efficiency. [ABSTRACT FROM AUTHOR]

Micro-electro-mechanical system (MEMS) gyro is one of the extensively used inertia sensors in the field of optical target tracking (OTT). However, velocity closed-loop bandwidth of the OTT system is limited due to the resonance and measurement range issues of MEMS gyro. In this paper, the generalized sensor fusion framework, named the closed-loop fusion (CLF), is analyzed, and the optimal design principle of filter is proposed in detail in order to improve measurement of the bandwidth of MEMS gyro by integrating information of MEMS accelerometers. The fusion error optimization problem, which is the core issue of fusion design, can be solved better through the feedback compensation law of CLF framework and fusion filter optimal design. Differently from conventional methods, the fusion filter of CLF can be simply and accurately designed, and the determination of superposition of fusion information can also be effectively avoided. To show the validity of the proposed method, both sensor fusion simulations and closed-loop experiments of optical target tracking system have yielded excellent results. [ABSTRACT FROM AUTHOR]

Currently, there is a growing demand for the use of communication network bandwidth for the Internet of Things (IoT) within the cyber-physical-social system (CPSS), while needing progressively more powerful technologies for using scarce spectrum resources. Then, cognitive radio networks (CRNs) as one of those important solutions mentioned above, are used to achieve IoT effectively. Generally, dynamic resource allocation plays a crucial role in the design of CRN-aided IoT systems. Aiming at this issue, orthogonal frequency division multiplexing (OFDM) has been identified as one of the successful technologies, which works with a multi-carrier parallel radio transmission strategy. In this article, through the use of swarm intelligence paradigm, a solution approach is accordingly proposed by employing an efficient Jaya algorithm, called PA-Jaya, to deal with the power allocation problem in cognitive OFDM radio networks for IoT. Because of the algorithm-specific parameter-free feature in the proposed PA-Jaya algorithm, a satisfactory computational performance could be achieved in the handling of this problem. For this optimization problem with some constraints, the simulation results show that compared with some popular algorithms, the efficiency of spectrum utilization could be further improved by using PA-Jaya algorithm with faster convergence speed, while maximizing the total transmission rate. [ABSTRACT FROM AUTHOR]

A non-linear filtering algorithm based on the alpha-divergence is proposed, which uses the exponential family distribution to approximate the actual state distribution and the alpha-divergence to measure the approximation degree between the two distributions; thus, it provides more choices for similarity measurement by adjusting the value of α during the updating process of the equation of state and the measurement equation in the non-linear dynamic systems. Firstly, an α -mixed probability density function that satisfies the normalization condition is defined, and the properties of the mean and variance are analyzed when the probability density functions p (x) and q (x) are one-dimensional normal distributions. Secondly, the sufficient condition of the alpha-divergence taking the minimum value is proven, that is when α ≥ 1 , the natural statistical vector's expectations of the exponential family distribution are equal to the natural statistical vector's expectations of the α -mixed probability state density function. Finally, the conclusion is applied to non-linear filtering, and the non-linear filtering algorithm based on alpha-divergence minimization is proposed, providing more non-linear processing strategies for non-linear filtering. Furthermore, the algorithm's validity is verified by the experimental results, and a better filtering effect is achieved for non-linear filtering by adjusting the value of α. [ABSTRACT FROM AUTHOR]

Having an incentive mechanism is crucial for the recruitment of mobile users to participate in a sensing task and to ensure that participants provide high-quality sensing data. In this paper, we investigate a staged incentive and punishment mechanism for mobile crowd sensing. We first divide the incentive process into two stages: the recruiting stage and the sensing stage. In the recruiting stage, we introduce the payment incentive coefficient and design a Stackelberg-based game method. The participants can be recruited via game interaction. In the sensing stage, we propose a sensing data utility algorithm in the interaction. After the sensing task, the winners can be filtered out using data utility, which is affected by time–space correlation. In particular, the participants’ reputation accumulation can be carried out based on data utility, and a punishment mechanism is presented to reduce the waste of payment costs caused by malicious participants. Finally, we conduct an extensive study of our solution based on realistic data. Extensive experiments show that compared to the existing positive auction incentive mechanism (PAIM) and reverse auction incentive mechanism (RAIM), our proposed staged incentive mechanism (SIM) can effectively extend the incentive behavior from the recruiting stage to the sensing stage. It not only achieves being a real-time incentive in both the recruiting and sensing stages but also improves the utility of sensing data. [ABSTRACT FROM AUTHOR]