Under the dynamic working conditions of a star sensor, motion blur of the star will appear due to its energy dispersion during imaging, leading to the degradation of the star centroid accuracy and attitude accuracy of the star sensor. To address this, a restoration method of a blurred star image for a star sensor under dynamic conditions is presented in this paper. First, a kinematic model of the star centroid and the degradation function of blurred star image under different conditions are analyzed. Then, an improved curvature filtering method based on energy function is proposed to remove the noise and improve the signal-to-noise ratio of the star image. Finally, the Richardson Lucy algorithm is used and the termination condition of the iterative equation is established by using the star centroid coordinates in three consecutive frames of restored images to ensure the restoration effect of the blurred star image and the accuracy of the star centroid coordinates. Under the dynamic condition of 0~4°/s, the proposed algorithm can effectively improve the signal-to-noise ratio of a blurred star image and maintain an error of the star centroid coordinates that is less than 0.1 pixels, which meets the requirement for high centroid accuracy.
Tracking objects over time, i.e., identity (ID) consistency, is important when dealing with multiple object tracking (MOT). Especially in complex scenes with occlusion and interaction of objects this is challenging. Significant improvements in single object tracking (SOT) methods have inspired the introduction of SOT to MOT to improve the robustness, that is, maintaining object identities as long as possible, as well as helping alleviate the limitations from imperfect detections. SOT methods are constantly generalized to capture appearance changes of the object, and designed to efficiently distinguish the object from the background. Hence, simply extending SOT to a MOT scenario, which consists of a complex scene with spatially mixed, occluded, and similar objects, will encounter problems in computational efficiency and drifted results. To address this issue, we propose a binary-channel verification model that deeply excavates the potential of SOT in refining the representation while maintaining the identities of the object. In particular, we construct an integrated model that jointly processes the previous information of existing objects and new incoming detections, by using a unified correlation filter through the whole process to maintain consistency. A delay processing strategy consisting of the three parts—attaching, re-initialization, and re-claiming—is proposed to tackle drifted results caused by occlusion. Avoiding the fuzzy appearance features of complex scenes in MOT, this strategy can improve the ability to distinguish specific objects from each other without contaminating the fragile training space of a single object tracker, which is the main cause of the drift results. We demonstrate the effectiveness of our proposed approach on the MOT17 challenge benchmarks. Our approach shows better overall ID consistency performance in comparison with previous works.
A bullet point cloud registration algorithm with a low overlap rate based on line feature detection was proposed to solve the problem of the difficulty and low efficiency of point cloud registration due to the low overlap rate among point clouds sampled by the bullet model. In this paper, voxel downsampling is used to remove some noise points and outliers from the bullet point cloud and applied to the specified resolution to reduce the calculation cost. The bullet point cloud is transformed to a better initial position by fitting the central axis with the geometrical features of the bullet. Then, the direction vector of the bullet linear features is obtained by using an icosahedral fitting discrete Hough transform to simplify the parameter space of the search transformation. Finally, the optimal rotation angle is searched for in the parameter space by using the improved Cuckoo algorithm to realize the registration of the bullet point cloud with a low overlap rate. Simulation and experimental results show that the proposed registration method can accurately register bullet point clouds of different densities with a low overlap rate. Compared with the commonly used ICP, GICP, and TRICP algorithms, the registration error of the proposed algorithm is reduced by 92.68% on average when the overlap rate is 52.85%. The registration error is reduced by 98.87% in the case of a 41.36% overlap rate, by 99.52% in the case of a 33.02% overlap rate, and by 98.89% in the case of a 22.75% overlap rate.