Explore the vast range of titles available.

In response to the issues of slow convergence and the tendency to fall into local optima in traditional iterative closest point (ICP) point cloud registration algorithms, this study presents a fast registration algorithm for laser point clouds based on 3D scale-invariant feature transform (3D-SIFT) feature extraction. First, feature points are preliminarily extracted using a normal vector threshold; then, more high-quality feature points are extracted using the 3D-SIFT algorithm, effectively reducing the number of point cloud registrations. Based on the extracted feature points, a coarse registration of the point cloud is performed using the fast point feature histogram (FPFH) descriptor combined with the sample consensus initial alignment (SAC-IA) algorithm, followed by fine registration using the point-to-plane ICP algorithm with a symmetric target function. The experimental results show that this algorithm significantly improved the registration efficiency. Compared with the traditional SAC−IA+ICP algorithm, the registration accuracy of this algorithm increased by 29.55% in experiments on a public dataset, and the registration time was reduced by 81.01%. In experiments on actual collected data, the registration accuracy increased by 41.72%, and the registration time was reduced by 67.65%. The algorithm presented in this paper maintains a high registration accuracy while greatly reducing the registration speed.

Detection and parameter estimation of maneuvering targets having a jerking motion are some of the challenging problems for modern radar systems. Such targets usually introduce range migration (RM) and Doppler frequency migration (DFM) problems leading to serious performance degradation in detection. To address these problems, a novel coherent integration (CI) algorithm is proposed based on a new symmetric instantaneous autocorrelation function (NSIAF), which can be utilized to reduce the order on the slow time and to eliminate the linear range migration (LRM) first. Then, the jerk and acceleration of the target are estimated after applying the keystone transform (KT) and the scaled Fourier transform (SFT); both of these are then used to construct the reference function for matched filtering. Finally, CI and target detection can be accomplished by the scaled inverse Fourier transform (SCIFT) after matched filtering. Both simulation data (this work) and practical radar experiment data (data set of others) were processed to validate the proposed algorithm. Compared with other representative algorithms, our algorithm can achieve a good balance between computational complexity and detection performance.

Robust nonlinear filtering is an important method for tracking maneuvering targets in non-Gaussian noise environments. Although there are many robust filters for nonlinear systems, few of them have ideal performance for mixed Gaussian noise and non-Gaussian noise (such as scattering noise) in practical applications. Therefore, a novel cubature formula and maximum correntropy criterion (MCC)-based robust cubature Kalman filter is proposed. First, the fully symmetric cubature criterion and high-order divided difference are used to construct a new fifth-degree cubature formula using fewer symmetric cubature points. Then, a new cost function is obtained by combining the weighted least-squares method and the MCC loss criterion to deal with the abnormal values of non-Gaussian noise, which enhances the robustness; and statistical linearization methods are used to calculate the approximate result of the measurement process. Thus, the final fifth-degree divided difference–maximum correntropy cubature Kalman filter (DD-MCCKF) framework is constructed. A typical surface-maneuvering target-tracking simulation example is used to verify the tracking accuracy and robustness of the proposed filter. Experimental results indicate that the proposed filter has a higher tracking accuracy and better numerical stability than other common nonlinear filters in non-Gaussian noise environments with fewer cubature points used.

Complex evidence theory (CET) plays a critical role in addressing uncertainty within the complex domain. However, accurately measuring conflicts between complex mass functions (CMFs) remains a challenge. To solve this issue, we propose the symmetric complex Renyi (SCR) divergence, which extends the traditional Renyi divergence into the complex domain by incorporating both magnitude and phase information. SCR divergence satisfies the essential properties of symmetry, non-negativity, and non-degeneracy, making it a reliable tool for conflict quantification in uncertain environments. Based on SCR divergence, we develop a novel multi-source information fusion algorithm that dynamically adjusts evidence weights according to conflict levels, effectively mitigating inconsistencies and improving fusion outcomes. Numerical experiments validate the efficiency and robustness of the proposed method, demonstrating its advantages over traditional approaches. Furthermore, the proposed method is applied in medical diagnosis and target recognition, showcasing its practicality and effectiveness in real-world decision-making scenarios. These results highlight the potential of the SCR divergence and the fusion algorithm to address conflict resolution and information integration challenges in complex systems.

The essential purpose of radar is to detect a target of interest and provide information concerning the target's location, motion, size, and other parameters. The knowledge about the pulse trains’ properties shows that a class of signals is mainly well suited to digital processing of increasing practical importance. A low autocorrelation binary sequence (LABS) is a complex combinatorial problem. The main problems of LABS are low Merit Factor (MF) and shorter length sequences. Besides, the maximum possible MF equals 12.3248 as infinity length is unable to be achieved. Therefore, this study implemented two techniques to propose a new metaheuristic algorithm based on Hybrid Modified Sine Cosine Algorithm with Cuckoo Search Algorithm (HMSCACSA) using Inverse Filtering (IF) and clipping method to achieve better results. The proposed algorithms, LABS-IF and HMSCACSA-IF, achieved better results with two large MFs equal to 12.12 and 12.6678 for lengths 231 and 237, respectively, where the optimal solutions belong to the skew-symmetric sequences. The MF outperformed up to 24.335% and 2.708% against the state-of-the-art LABS heuristic algorithm, xLastovka, and Golay, respectively. These results indicated that the proposed algorithm's simulation had quality solutions in terms of fast convergence curve with better optimal means, and standard deviation.

This paper provides two methods about implementation of elementary symmetric function (ESF) in Gaussian mixture cardinalized probability hypothesis density (GM-CPHD) filter. One is based on the matrix inversion; the other is implementing the ESF recursively. Simulation results reveal that the recursive implementation of ESF weights over the matrix inversion based method. (4 pages)