In this work, we propose a 3D occlusion facial recognition network based on a multi-feature combination threshold (MFCT-3DOFRNet). First, we design and extract the depth information of the 3D face point cloud, the elevation, and the azimuth angle of the normal vector as new 3D facially distinctive features, so as to improve the differentiation between 3D faces. Next, we propose a multi-feature combinatorial threshold that will be embedded at the input of the backbone network to implement the removal of occlusion features in each channel image. To enhance the feature extraction capability of the neural network for missing faces, we also introduce a missing face data generation method that enhances the training samples of the network. Finally, we use a Focal-ArcFace loss function to increase the inter-class decision boundaries and improve network performance during the training process. The experimental results show that the method has excellent recognition performance for unoccluded faces and also effectively improves the performance of 3D occlusion face recognition. The average Top-1 recognition rate of the proposed MFCT-3DOFRNet for the Bosphorus database is 99.52%, including 98.94% for occluded faces and 100% for unoccluded faces. For the UMB-DB dataset, the average Top-1 recognition rate is 95.08%, including 93.41% for occluded faces and 100% for unoccluded faces. These 3D face recognition experiments show that the proposed method essentially meets the requirements of high accuracy and good robustness.

Point cloud registration is widely used in autonomous driving, SLAM, and 3D reconstruction, and it aims to align point clouds from different viewpoints or poses under the same coordinate system. However, point cloud registration is challenging in complex situations, such as a large initial pose difference, high noise, or incomplete overlap, which will cause point cloud registration failure or mismatching. To address the shortcomings of the existing registration algorithms, this paper designed a new coarse-to-fine registration two-stage point cloud registration network, CCRNet, which utilizes an end-to-end form to perform the registration task for point clouds. The multi-scale feature extraction module, coarse registration prediction module, and fine registration prediction module designed in this paper can robustly and accurately register two point clouds without iterations. CCRNet can link the feature information between two point clouds and solve the problems of high noise and incomplete overlap by using a soft correspondence matrix. In the standard dataset ModelNet40, in cases of large initial pose difference, high noise, and incomplete overlap, the accuracy of our method, compared with the second-best popular registration algorithm, was improved by 7.0%, 7.8%, and 22.7% on the MAE, respectively. Experiments showed that our CCRNet method has advantages in registration results in a variety of complex conditions.

The point cloud data from actual measurements are often sparse and incomplete, making it difficult to apply them directly to visual processing and 3D reconstruction. The point cloud completion task can predict missing parts based on a sparse and incomplete point cloud model. However, the disordered and unstructured characteristics of point clouds make it difficult for neural networks to obtain detailed spatial structures and topological relationships, resulting in a challenging point cloud completion task. Existing point cloud completion methods can only predict the rough geometry of the point cloud, but cannot accurately predict the local details. To address the shortcomings of existing point cloud complementation methods, this paper describes a novel network for adaptive point cloud growth, MAPGNet, which generates a sparse skeletal point cloud using the skeletal features in the composite encoder, and then adaptively grows the local point cloud in the spherical neighborhood of each point using the growth features to complement the details of the point cloud in two steps. In this paper, the Offset Transformer module is added in the process of complementation to enhance the contextual connection between point clouds. As a result, MAPGNet improves the quality of the generated point clouds and recovers more local detail information. Comparing our algorithm with other state-of-the-art algorithms in different datasets, experimental results show that our algorithm has advantages in dense point cloud completion.

With the rapid advancement of aerospace technology, the maneuverability of spacecraft has increasingly improved, creating a pressing demand for star sensors with a high attitude update rate and high precision. Star identification, as the most complex and time-consuming algorithm of star sensors, faces stringent requirements for enhanced identification speed and an enhanced identification rate. Furthermore, as the space environment is becoming more complex, the need for star sensors with heightened detection sensitivity is growing to facilitate real-time and accurate alerts for various non-cooperative targets, which has led to a sharp increase in the number of high-magnitude navigation stars in the star catalog, significantly impeding the speed and rate of star identification. Traditional methods are no longer adequate to meet the current demand for star sensors with high identification speed and a high identification rate. Addressing these challenges, a voting-based star identification algorithm using a partitioned star catalog is proposed. Initially, a uniform partitioning method for the star catalog is introduced. Building on this, a navigation feature library using partitioned catalog neighborhoods as a basic unit is constructed. During star identification, a method based on a voting decision is employed for feature matching in the basic unit. Compared to conventional methods, the proposed algorithm significantly simplifies the navigation feature library and narrows the retrieval region during star identification, markedly enhancing identification speed while effectively reducing the probability of redundant and false matching. The performance of the proposed algorithm is validated through a simulation experiment and nighttime star observation experiment. Experimental results indicate an average identification rate of 99.760% and an average identification time of 8.861 milliseconds, exhibiting high robustness against position errors, magnitude errors, and false stars. The proposed algorithm presents a clear advantage over other common star identification methods, meeting the current requirement for star sensors with high star identification speed and a high identification rate.