Guiyang Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Guiyang Zhang has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
Ju Huo
Harbin Institute of Technology
7 shared publications- Ming Yang
School of Astronautics, Harbin Institute of Technology, Harbin 150001, China
5 shared publications Jiashan Cui
Jinhang Institute of Technology, China Aerospace Science and Industry Corporation, Tianjin 300308, China
3 shared publicationsLiang Wei
Tangshan University
3 shared publicationsFeiming Gao
Tangshan University
2 shared publicationsJianfei Han
Tangshan University
2 shared publications
Latest Publications
- 22 October 2026
- Published by Optica Publishing Group in Applied Optics
- Vol. 65 (31) , 10805
Dual collaborative particle swarm optimization method for nonlinear refinement of optical camera parameters
Camera calibration plays a vital role in machine vision, aiming to identify the optical parameters of a camera using features from 2D images alongside their corresponding 3D spatial features. To address the shortcomings associated with traditional techniques, which often struggle with weak local optima and deliver low calibration accuracy, a dual collaborative particle swarm optimization (DCPSO) method is introduced for the nonlinear optimization of optical camera parameters. Enhancements are made to the original particle swarm optimization (PSO) through dual collaborative improvements. The strategy for dynamic factor adjustment seeks to maintain a balance between the exploration and exploitation phases, while a dimension selection strategy is incorporated to determine which dimensions need updating when a superior solution is identified. DCPSO performs function value analysis on the CEC2017 test suite. Additionally, a nonlinear model for camera calibration is developed. By minimizing the mean reprojection error, DCPSO identifies the optimal optical camera parameters. The calibration method that utilizes DCPSO achieves a reprojection error of 0.0849 pixels, delivering a 25.39% accuracy improvement over Zhang’s method.
- 22 October 2026
- Published by Optica Publishing Group in Applied Optics
- Vol. 65 (31) , 10805
Dual collaborative particle swarm optimization method for nonlinear refinement of optical camera parameters
Camera calibration plays a vital role in machine vision, aiming to identify the optical parameters of a camera using features from 2D images alongside their corresponding 3D spatial features. To address the shortcomings associated with traditional techniques, which often struggle with weak local optima and deliver low calibration accuracy, a dual collaborative particle swarm optimization (DCPSO) method is introduced for the nonlinear optimization of optical camera parameters. Enhancements are made to the original particle swarm optimization (PSO) through dual collaborative improvements. The strategy for dynamic factor adjustment seeks to maintain a balance between the exploration and exploitation phases, while a dimension selection strategy is incorporated to determine which dimensions need updating when a superior solution is identified. DCPSO performs function value analysis on the CEC2017 test suite. Additionally, a nonlinear model for camera calibration is developed. By minimizing the mean reprojection error, DCPSO identifies the optimal optical camera parameters. The calibration method that utilizes DCPSO achieves a reprojection error of 0.0849 pixels, delivering a 25.39% accuracy improvement over Zhang’s method.
- 10 September 2026
- Published by Optica Publishing Group in Optics Express
- Vol. 34 (19) , 35754
Nonlinear optimization of optical camera parameter via multi-strategy fusion particle swarm optimization algorithm based on asymmetric circle grid
Addressing the limitations of checkerboard and circular targets, resulting in low calibration accuracy and eccentricity errors, this study introduces a camera calibration method based on asymmetric circle grid and multi-strategy fusion particle swarm optimization algorithm. To address eccentricity errors by enhancing calibration targets through the refinement and design of asymmetric circle grid, focusing on hardware-based solutions. During target feature point extraction, the imaged circle centers derived from cross-ratio invariance remain unaffected by perspective projection, ensuring accurate feature point localization. After the initial camera calibration, the multi-strategy fusion particle swarm optimization algorithm (MSPSO) is used to enhance the calibration results, improving the method's performance. Enhancements have been implemented in the original particle swarm optimization algorithm (PSO). The non-linear inertia weight and sine-cosine learning factors effectively balance the algorithm's exploration and exploitation phases. Secondly, a fitness-distance balance is utilized to create an alternative learning exemplar instead of the global best position. The population reorganization strategy enhances population diversity and effectively prevents the algorithm from stagnating prematurely. MSPSO is evaluated on the CEC2017 test suite, including function value and convergence curve analyses. MSPSO optimizes camera parameters by minimizing the mean reprojection errors as the objective function. The proposed camera calibration method achieves a reprojection error of 0.086 pixels and a dimensional measurement error of 0.2038 mm, which verifies its practicality and effectiveness.
- 10 September 2026
- Published by Optica Publishing Group in Optics Express
- Vol. 34 (19) , 35754
Nonlinear optimization of optical camera parameter via multi-strategy fusion particle swarm optimization algorithm based on asymmetric circle grid
Addressing the limitations of checkerboard and circular targets, resulting in low calibration accuracy and eccentricity errors, this study introduces a camera calibration method based on asymmetric circle grid and multi-strategy fusion particle swarm optimization algorithm. To address eccentricity errors by enhancing calibration targets through the refinement and design of asymmetric circle grid, focusing on hardware-based solutions. During target feature point extraction, the imaged circle centers derived from cross-ratio invariance remain unaffected by perspective projection, ensuring accurate feature point localization. After the initial camera calibration, the multi-strategy fusion particle swarm optimization algorithm (MSPSO) is used to enhance the calibration results, improving the method's performance. Enhancements have been implemented in the original particle swarm optimization algorithm (PSO). The non-linear inertia weight and sine-cosine learning factors effectively balance the algorithm's exploration and exploitation phases. Secondly, a fitness-distance balance is utilized to create an alternative learning exemplar instead of the global best position. The population reorganization strategy enhances population diversity and effectively prevents the algorithm from stagnating prematurely. MSPSO is evaluated on the CEC2017 test suite, including function value and convergence curve analyses. MSPSO optimizes camera parameters by minimizing the mean reprojection errors as the objective function. The proposed camera calibration method achieves a reprojection error of 0.086 pixels and a dimensional measurement error of 0.2038 mm, which verifies its practicality and effectiveness.
- Open Access
- 20 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Photonics Journal
- Vol. 15 (6) , 1-11
Cross-Layer Feature Fusion and Decentration Aberration Correction of Circular Points for Automated Guided Vehicle Terminal Positioning
To address the visual detection and positioning challenge of the Automated Guided Vehicle (AGV) terminal, this study proposed a high-precision target recognition and positioning strategy based on cross-layer feature fusion and eccentricity error correction. In the remote coarse positioning stage, small number of receiver domains underwent continuous multi-layer convolution, which broadened the receptive field of a single element in the feature map of a small circular target. Next, a cross-layer connection feature pyramid was constructed, and the deconvolution module was utilized to enlarge the feature map and fuse it with the shallow features, focusing more on the fine-grained image recognition and enhancing the applicability of circular marker detection. In the near-end fine positioning stage, the factors impacting the deviation between the projection point of the circular feature center and the fitting center were analyzed. Based on this analysis, the deviation of the iterative fitting center was corrected to approximate the real center projection sub-pixel coordinates. The experimental results demonstrated that the proposed method achieved dynamic positioning accuracy of better than 2.0 mm, static positioning accuracy of better than 1.5 mm, and a false recognition rate of less than 1.33% in the range of 3 m from AGV to the tray. Consequently, this method has significant application potential in enabling rapid and stable terminal vision positioning.
- 20 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Photonics Journal
- Vol. 15 (6) , 1-11
Open AccessCross-Layer Feature Fusion and Decentration Aberration Correction of Circular Points for Automated Guided Vehicle Terminal Positioning
To address the visual detection and positioning challenge of the Automated Guided Vehicle (AGV) terminal, this study proposed a high-precision target recognition and positioning strategy based on cross-layer feature fusion and eccentricity error correction. In the remote coarse positioning stage, small number of receiver domains underwent continuous multi-layer convolution, which broadened the receptive field of a single element in the feature map of a small circular target. Next, a cross-layer connection feature pyramid was constructed, and the deconvolution module was utilized to enlarge the feature map and fuse it with the shallow features, focusing more on the fine-grained image recognition and enhancing the applicability of circular marker detection. In the near-end fine positioning stage, the factors impacting the deviation between the projection point of the circular feature center and the fitting center were analyzed. Based on this analysis, the deviation of the iterative fitting center was corrected to approximate the real center projection sub-pixel coordinates. The experimental results demonstrated that the proposed method achieved dynamic positioning accuracy of better than 2.0 mm, static positioning accuracy of better than 1.5 mm, and a false recognition rate of less than 1.33% in the range of 3 m from AGV to the tray. Consequently, this method has significant application potential in enabling rapid and stable terminal vision positioning.
- 25 October 2022
- Published by Optica Publishing Group in Applied Optics
- Vol. 61 (32) , 9311-9323
Parallel optimization of tridimensional deformation measurement based on correlation function constraints of a multi-camera network
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.
- 25 October 2022
- Published by Optica Publishing Group in Applied Optics
- Vol. 61 (32) , 9311-9323
Parallel optimization of tridimensional deformation measurement based on correlation function constraints of a multi-camera network
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.
- 1 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Systems Engineering and Electronics
- Vol. 33 (1) , 1-10
Non-Cooperative Target Pose Estimation based on Improved Iterative Closest Point Algorithm
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°.- 1 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Systems Engineering and Electronics
- Vol. 33 (1) , 1-10
Non-Cooperative Target Pose Estimation based on Improved Iterative Closest Point Algorithm
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°.- Open Access
- 12 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 148952-148967
Expedited Pose Estimation Algorithm Involving Perturbance Affine Term Based on Projection Vector for Space Target
The present study primarily discusses the perturbance error indeterminacy that is caused by anisotropic and correlated non-identical gray distribution of feature points in vision measurement for space target pose parameters. On that basis, an expedited algorithm that involves perturbance affine term based on the novel statistical objective function is proposed. By invoking the inverse covariance matrix to model a novel data space, the pose estimation algorithm based on projection vector is capable of reducing the effect of different levels of disturbance error on the measured results, as well as effectively avoiding the poor or non-convergence attributed to data degradation. Furthermore, the repeated calculation is avoided by coupling each iteration, which significantly simplifies the computation. As a consequence, the calculation complexity of each iteration decreases from O(n) to O(1), and the expediting process is implemented significantly. Lastly, as revealed from the experimental results, the calculation efficiency is improved by 3.3 times, and the maximum measured error of the space target attitude is less than 0.1°. Compared with the conventional methods, the proposed algorithm exhibits the effectively promoted speed-ability, precision and indeterminacy attenuation performance, suggesting that the proposed approach should have promising practical applications in deep-space target capture.
- 12 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 148952-148967
Open AccessExpedited Pose Estimation Algorithm Involving Perturbance Affine Term Based on Projection Vector for Space Target
The present study primarily discusses the perturbance error indeterminacy that is caused by anisotropic and correlated non-identical gray distribution of feature points in vision measurement for space target pose parameters. On that basis, an expedited algorithm that involves perturbance affine term based on the novel statistical objective function is proposed. By invoking the inverse covariance matrix to model a novel data space, the pose estimation algorithm based on projection vector is capable of reducing the effect of different levels of disturbance error on the measured results, as well as effectively avoiding the poor or non-convergence attributed to data degradation. Furthermore, the repeated calculation is avoided by coupling each iteration, which significantly simplifies the computation. As a consequence, the calculation complexity of each iteration decreases from O(n) to O(1), and the expediting process is implemented significantly. Lastly, as revealed from the experimental results, the calculation efficiency is improved by 3.3 times, and the maximum measured error of the space target attitude is less than 0.1°. Compared with the conventional methods, the proposed algorithm exhibits the effectively promoted speed-ability, precision and indeterminacy attenuation performance, suggesting that the proposed approach should have promising practical applications in deep-space target capture.
- 28 September 2018
- Published by Taylor & Francis in Journal of Modern Optics
- Vol. 66 (2) , 218-227
Algorithm of locating the sphere center imaging point based on novel edge model and Zernike moments for vision measurement
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.
- 28 September 2018
- Published by Taylor & Francis in Journal of Modern Optics
- Vol. 66 (2) , 218-227
Algorithm of locating the sphere center imaging point based on novel edge model and Zernike moments for vision measurement
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.
- 29 June 2018
- Published by Optica Publishing Group in Applied Optics
- Vol. 57 (19) , 5492-5504
Corrected calibration algorithm with a fixed constraint relationship and an error compensation technique for a binocular vision measurement system
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.
- 29 June 2018
- Published by Optica Publishing Group in Applied Optics
- Vol. 57 (19) , 5492-5504
Corrected calibration algorithm with a fixed constraint relationship and an error compensation technique for a binocular vision measurement system
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.
- 20 April 2018
- Published by Optica Publishing Group in Applied Optics
- Vol. 57 (12) , 3306-3315
Algorithm for pose estimation based on objective function with uncertainty-weighted measuring error of feature point cling to the curved surface
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.- 20 April 2018
- Published by Optica Publishing Group in Applied Optics
- Vol. 57 (12) , 3306-3315
Algorithm for pose estimation based on objective function with uncertainty-weighted measuring error of feature point cling to the curved surface
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.