1 February 2022 in Journal of Systems Engineering and Electronics
For localisation of unknown non-cooperative targets in space, the existence of interference points causes inaccuracy of pose estimation while utilizing point cloud registration. To address this issue, this paper proposes a new iterative closest point (ICP) algorithm combined with distributed weights to intensify the dependability and robustness of the non-cooperative target localisation. As interference points in space have not yet been extensively studied, we classify them into two broad categories, far interference points and near interference points. For the former, the statistical outlier elimination algorithm is employed. For the latter, the Gaussian distributed weights, simultaneously valuing with the variation of the Euclidean distance from each point to the centroid, are commingled to the traditional ICP algorithm. In each iteration, the weight matrix $W$ in connection with the overall localisation is obtained, and the singular value decomposition is adopted to accomplish high-precision estimation of the target pose. Finally, the experiments are implemented by shooting the satellite model and setting the position of interference points. The outcomes suggest that the proposed algorithm can effectively suppress interference points and enhance the accuracy of non-cooperative target pose estimation. When the interference point number reaches about 700, the average error of angle is superior to 0.88°.
29 June 2018 in Applied Optics
This paper is concerned with the precise calibration algorithm and error compensation technique for a binocular vision measurement system. By invoking a fixed constraint relationship between the binocular cameras, these two cameras can be preferably bound together as one camera, which means that in each iteration only one camera needs external parameter tuning for optimized encapsulation, and the iteration time is reduced. The global optimal solutions are obtained by substituting the initial iterative solutions into the optimized iterative equations of the spatial points. The derived improved iterative algorithm obtains the camera parameters with high precision and performs better in noise resistance. Moreover, the error compensation matrix is constructed to correct the relative pose of binocular cameras, upon which solutions to the error compensation matrix are solved via the unit quaternion. Consequently, the relative pose matrix is revised, allowing for further improvement in the calibration performance. Finally, simulation and practical experiments are demonstrated. The relevant results confirm the precision and robustness of the proposed approach.
28 September 2018 in Journal of Modern Optics
High accuracy of locating the sphere center imaging points is crucial for the vision measurement system. This paper investigates the effect of projection projective model on extraction of the sphere center, upon which the sub-pixel edge-location algorithm based on the sphere projection model is proposed. The sphere center projection model is established by analysing the process of sphere imaging, and the sub-pixel edge-location algorithm consisted of the novel edge model and the improved Zernike moment computing is studied. The novel edge model based on the Erf (error function) is adopted for modelling the practical edge part, which obtains the edge distribution points with high precision. Then a closed-form solution of edge locating error compensation is calculated based on Zernike moments. Finally, the proposed method is verified via simulations and experiments. The relevant results show that the proposed method can accurately locate the sphere center imaging point, which further improves the precision and robustness of the vision measurement system.
17 October 2017 in Journal of Modern Optics
In this paper, we investigate the effect of anisotropic and correlated non-identical distributions of feature points’ gray level on pose estimation in stereo vision system. The generalized orthogonal iteration (GOI) algorithm for pose estimation with uncertainty-weighted measuring error of feature target is proposed. In this method, the inverse covariance matrix is applied to describe the uncertainty of feature points, and weighted contribution of uncertainty to the error objective function is analysed. By transforming the uncertainty into the covariance-weighted data space, a novel objective function based on spatial collinear error is constructed. The orthogonal iterative algorithm is extended to stereo vision system for pose estimation and the GOI algorithm is deduced, by which the optimized solution to a novel objective function is given. Finally, simulation and actual experimental results show high accuracy and strong robustness of the proposed approach, and should therefore, have potential for a variety of engineering applications.
20 April 2018 in Applied Optics
This paper is concerned with the anisotropic and non-identical gray distribution of feature points clinging to the curved surface, upon which a high precision and uncertainty-resistance algorithm for pose estimation is proposed. Weighted contribution of uncertainty to the objective function of feature points measuring error is analyzed. Then a novel error objective function based on the spatial collinear error is constructed by transforming the uncertainty into a covariance-weighted matrix, which is suitable for the practical applications. Further, the optimized generalized orthogonal iterative (GOI) algorithm is utilized for iterative solutions such that it avoids the poor convergence and significantly resists the uncertainty. Hence, the optimized GOI algorithm extends the field-of-view applications and improves the accuracy and robustness of the measuring results by the redundant information. Finally, simulation and practical experiments show that the maximum error of re-projection image coordinates of the target is less than 0.110 pixels. Within the space , the maximum estimation errors of static and dynamic measurement for rocket nozzle motion are superior to 0.065° and 0.128°, respectively. Results verify the high accuracy and uncertainty attenuation performance of the proposed approach and should therefore have potential for engineering applications.
25 October 2022 in Applied Optics
This study primarily investigates the low accuracy and redundant time-consuming problem of speckle registration in the full-field deformation measurement of slender and biggish specimens. To solve these problems, a parallel optimization of the tridimensional deformation measurement method is proposed based on what we believe is a novel correlation function constraints of a multi-camera network. First, a neotype correlation function is built based on the joint constraint relationship among the multiple cameras, which is capable of accurately restricting the search for homologous points in image pairs to the epipolar line, instead of the entire image, while significantly narrowing the search space and accelerating the search. The multiple cameras are bundled as a whole, thus reducing the dimension of the Jacobian matrix and the normalized matrix to a certain extent. Subsequently, more speckle images can be calculated in one iteration. Furthermore, the decomposition of the derived correlation function and the scheme of the parallel algorithm are decomposed via the kernel function based on the GPU parallel mechanism of the compute unified device architecture source program, thus increasing the subpixel search speed of speckle matching and ensuring the calculation performance of the stereo deformation measurement method to reach a higher level. Lastly, the experimental results revealed that the proposed strategy could allow the calculation speed-up ratio of speckle sequence and stereo registration to reach 20.390 times and 17.873 times, respectively, while ensuring the out-of-plane displacement average measuring accuracy to be higher than 0.179 mm within the spatial range of [2 m, 2 m, 3 m]. As a result, the proposed approach has crucial applications in rapid and stable tridimensional deformation measurement.