Xiulan Wen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiulan Wen has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Aiguo Song
Southeast University
3 shared publications - Guifang Qiao
School of Automation, Nanjing Institute of Technology, Nanjing 211167, China
3 shared publications Danghong Sheng
Nanjing Institute of Technology
2 shared publications- Guangming Song
Southeast University
2 shared publications Youxiong Xu
2 shared publicationsChuanShuai Kang
Automation Department
1 shared publication
Latest Publications
- Open Access
Speckle-Assisted Binocular 3D Reconstruction of Asphalt Pavement with a Multi-Scale Adaptive Feature Fusion Algorithm
To address the challenges of unreliable feature matching, high mismatch rates, and limited reconstruction accuracy in binocular stereo vision applied to asphalt pavement with inherent weak texture features, this paper proposes a speckle-assisted binocular 3D reconstruction method based on a multi-scale adaptive feature fusion algorithm. Infrared speckle patterns are actively projected to enrich the pavement surface features, and a multi-scale matching framework is developed by integrating Laplacian pyramid representations, feature-driven adaptive regularization, and Softmax-based nonlinear fusion. This design can achieve stable and accurate disparity estimation, even in weak texture regions, and produce high-quality 3D point clouds that faithfully represent both macro-scale undulations and micro-scale texture details. Ablation experiments validate the effectiveness of the proposed modules, showing that the relative errors of the arithmetic mean height (Sa) and root-mean-square height (Sq) are reduced to below 2.3%. When aligned with 3D scanner data using the iterative closest point (ICP) algorithm, the reconstructed point clouds achieve sub-millimeter mean error and an overlap rate exceeding 97%. The results indicate that the proposed method offers a reliable technical solution for efficient texture-depth analysis and practical pavement condition assessment.
Open AccessSpeckle-Assisted Binocular 3D Reconstruction of Asphalt Pavement with a Multi-Scale Adaptive Feature Fusion Algorithm
To address the challenges of unreliable feature matching, high mismatch rates, and limited reconstruction accuracy in binocular stereo vision applied to asphalt pavement with inherent weak texture features, this paper proposes a speckle-assisted binocular 3D reconstruction method based on a multi-scale adaptive feature fusion algorithm. Infrared speckle patterns are actively projected to enrich the pavement surface features, and a multi-scale matching framework is developed by integrating Laplacian pyramid representations, feature-driven adaptive regularization, and Softmax-based nonlinear fusion. This design can achieve stable and accurate disparity estimation, even in weak texture regions, and produce high-quality 3D point clouds that faithfully represent both macro-scale undulations and micro-scale texture details. Ablation experiments validate the effectiveness of the proposed modules, showing that the relative errors of the arithmetic mean height (Sa) and root-mean-square height (Sq) are reduced to below 2.3%. When aligned with 3D scanner data using the iterative closest point (ICP) algorithm, the reconstructed point clouds achieve sub-millimeter mean error and an overlap rate exceeding 97%. The results indicate that the proposed method offers a reliable technical solution for efficient texture-depth analysis and practical pavement condition assessment.
- Open Access
- 12 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 232-237
Registration of 3D Point Cloud with Rotation Invariant Features Learning for Partial Overlapping
Point cloud registration attempts to register a pair of point cloud through rigid transformation to form a complete point cloud. Traditional methods rely on searching closest neighbors in the feature space and filtering the outliers through RANSAC to find the point-to-point correspondence. Recently, learning-based algorithms incorporate learning to local feature descriptors and perform better than the traditional methods. However, they continue to adopt the feature-based matching and point-level correspondence approach for pose estimation. In this work, attention mechanism is incorporated to learning transformation-invariant features and an end-to-end solution is used to predict the correspondences. A two-stream feature extraction architecture consisting primarily of feature extractor and transformer learns the rotation-invariant features through transformer layer. The network learns to predict the point coordinates mapped to the other point cloud and the probability between the correspondences in the overlap region. The rigid relative pose transformation can be solved from the predicted correspondences in a closed form. The registration method is applied to pose estimation in the robotic grasping and sorting task and achieves favorable result.
- 12 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 232-237
Open AccessRegistration of 3D Point Cloud with Rotation Invariant Features Learning for Partial Overlapping
Point cloud registration attempts to register a pair of point cloud through rigid transformation to form a complete point cloud. Traditional methods rely on searching closest neighbors in the feature space and filtering the outliers through RANSAC to find the point-to-point correspondence. Recently, learning-based algorithms incorporate learning to local feature descriptors and perform better than the traditional methods. However, they continue to adopt the feature-based matching and point-level correspondence approach for pose estimation. In this work, attention mechanism is incorporated to learning transformation-invariant features and an end-to-end solution is used to predict the correspondences. A two-stream feature extraction architecture consisting primarily of feature extractor and transformer learns the rotation-invariant features through transformer layer. The network learns to predict the point coordinates mapped to the other point cloud and the probability between the correspondences in the overlap region. The rigid relative pose transformation can be solved from the predicted correspondences in a closed form. The registration method is applied to pose estimation in the robotic grasping and sorting task and achieves favorable result.
- Open Access
- 8 July 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-9
Experimental Analysis on the Effectiveness of Kinematic Error Compensation Methods for Serial Industrial Robots
Based on the established serial 6-DOF robot calibration experiment platform, this paper aims to analyze and compare the effects of four error compensation methods, which are pseudotarget iteration-based error compensation method with three different forms and the Newton–Raphson-based error compensation method. Firstly, the pose error model of the serial robot is established based on the M-DH model in this paper. The calibration results show that the accuracy of the Staubli TX60 robot has been greatly improved. The average comprehensive position accuracy is increased by 88.7%, and the average comprehensive attitude accuracy is increased by 56.6%. Secondly, the principles of the four error compensation methods are discussed, and the effectiveness of the four error compensation methods are compared through experiments. The results show that the four error compensation methods can achieve error compensation well. The compensation accuracy is consistent with the identification accuracy of the kinematic model. The pseudotarget iteration with differential form has the best performance by the comprehensive consideration of accuracy and computational efficiency. Error compensation determines whether the accuracy of the identified model can be achieved. This paper presents a systematic experimental validation research on the effectiveness of four error compensation methods, which provides a reliable reference for the kinematic error compensation of industrial robots.
- 8 July 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-9
Open AccessExperimental Analysis on the Effectiveness of Kinematic Error Compensation Methods for Serial Industrial Robots
Based on the established serial 6-DOF robot calibration experiment platform, this paper aims to analyze and compare the effects of four error compensation methods, which are pseudotarget iteration-based error compensation method with three different forms and the Newton–Raphson-based error compensation method. Firstly, the pose error model of the serial robot is established based on the M-DH model in this paper. The calibration results show that the accuracy of the Staubli TX60 robot has been greatly improved. The average comprehensive position accuracy is increased by 88.7%, and the average comprehensive attitude accuracy is increased by 56.6%. Secondly, the principles of the four error compensation methods are discussed, and the effectiveness of the four error compensation methods are compared through experiments. The results show that the four error compensation methods can achieve error compensation well. The compensation accuracy is consistent with the identification accuracy of the kinematic model. The pseudotarget iteration with differential form has the best performance by the comprehensive consideration of accuracy and computational efficiency. Error compensation determines whether the accuracy of the identified model can be achieved. This paper presents a systematic experimental validation research on the effectiveness of four error compensation methods, which provides a reliable reference for the kinematic error compensation of industrial robots.
- 7 February 2021
- Published by University of Slavonski Brod in Tehnicki vjesnik - Technical Gazette
- Vol. 28 (1) , 52-57
An Online Word Vector Generation Method Based on Incremental Huffman Tree Merging
Aiming at high real-time performance processing requirements for large amounts of online text data in natural language processing applications, an online word vector model generation method based on incremental Huffman tree merging is...
- 7 February 2021
- Published by University of Slavonski Brod in Tehnicki vjesnik - Technical Gazette
- Vol. 28 (1) , 52-57
An Online Word Vector Generation Method Based on Incremental Huffman Tree Merging
Aiming at high real-time performance processing requirements for large amounts of online text data in natural language processing applications, an online word vector model generation method based on incremental Huffman tree merging is...
- Open Access
- 1 January 2020
- Published by Chinese Journal of Mechanical Engineering in Journal of Mechanical Engineering
- Vol. 56 (14) , 1-8
A Rapid Coordinate Transformation Method for Serial Robot Calibration System
- 1 January 2020
- Published by Chinese Journal of Mechanical Engineering in Journal of Mechanical Engineering
- Vol. 56 (14) , 1-8
Open AccessA Rapid Coordinate Transformation Method for Serial Robot Calibration System
- Open Access
- 1 January 2019
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2019 (1)
Uncertainty Estimation of Robot Geometric Parameters and End‐Effecter Position Based on New Generation GPS
The robot end‐effecter positioning accuracy can be improved by the calibration of robot geometric parameters errors. According to the requirements of new generation geometrical product specification (GPS), the calibration uncertainty should be given when the calibration results are given. In this paper, the modified Denavit‐Hartenberg method (MDH) of six‐joint series robot is established and the joint movement trajectory method is applied to calibrate the robot geometric parameters. The uncertainty contributors significant are analyzed and the calibration uncertainty of robot geometric parameters is estimated based on the guide to the expression of uncertainty in measurement (GUM). In order to overcome the limitations of GUM for highly nonlinear model and reduce computational cost based on Monte Carlo Simulation (MCS) error estimation, an adaptive MCS (AMCS) is proposed to estimate the uncertainty distribution of robot end‐effector position. Simulation and practical example are illustrated and the experiments results confirm that not only can the proposed method evaluate the calibration uncertainty of geometric parameters, but also the uncertainty distribution of end‐effecter positions in the whole robot workspace can be estimated by AMCS in which the number of MCS trials can be selected adaptively and the quality of the numerical results can be controlled directly. The proposed method not only can evaluate the uncertainty of six‐joint series robot geometric parameters and end‐effecter position rapidly and accurately, but also can be popularized to the estimation of calibration uncertainty of other kinds of robot geometric parameters.
- 1 January 2019
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2019 (1)
Open AccessUncertainty Estimation of Robot Geometric Parameters and End‐Effecter Position Based on New Generation GPS
The robot end‐effecter positioning accuracy can be improved by the calibration of robot geometric parameters errors. According to the requirements of new generation geometrical product specification (GPS), the calibration uncertainty should be given when the calibration results are given. In this paper, the modified Denavit‐Hartenberg method (MDH) of six‐joint series robot is established and the joint movement trajectory method is applied to calibrate the robot geometric parameters. The uncertainty contributors significant are analyzed and the calibration uncertainty of robot geometric parameters is estimated based on the guide to the expression of uncertainty in measurement (GUM). In order to overcome the limitations of GUM for highly nonlinear model and reduce computational cost based on Monte Carlo Simulation (MCS) error estimation, an adaptive MCS (AMCS) is proposed to estimate the uncertainty distribution of robot end‐effector position. Simulation and practical example are illustrated and the experiments results confirm that not only can the proposed method evaluate the calibration uncertainty of geometric parameters, but also the uncertainty distribution of end‐effecter positions in the whole robot workspace can be estimated by AMCS in which the number of MCS trials can be selected adaptively and the quality of the numerical results can be controlled directly. The proposed method not only can evaluate the uncertainty of six‐joint series robot geometric parameters and end‐effecter position rapidly and accurately, but also can be popularized to the estimation of calibration uncertainty of other kinds of robot geometric parameters.
- 23 October 2015
- Published by Elsevier in Chinese Journal of Mechanical Engineering
- Vol. 29 (1) , 212-218
Measurement uncertainty evaluation of conicity error inspected on CMM
- 23 October 2015
- Published by Elsevier in Chinese Journal of Mechanical Engineering
- Vol. 29 (1) , 212-218
Measurement uncertainty evaluation of conicity error inspected on CMM
- 28 March 2013
- Published by Elsevier in Chinese Journal of Mechanical Engineering
- Vol. 26 (2) , 406-413
Accurate evaluation of free-form surface profile error based on quasi particle swarm optimization algorithm and surface subdivision
Although significant progress has been made in precision machining of free-form surfaces recently, inspection of such surfaces remains a difficult problem. In order to solve the problem that no specific standards for the verification of free-form surface profile are available, the profile parameters of free-form surface are proposed by referring to ISO standards regarding form tolerances and considering its complexity and non-rotational symmetry. Non-uniform rational basis spline(NURBS) for describing free-form surface is formulated. Crucial issues in surface inspection and profile error verification are localization between the design coordinate system(DCS) and measurement coordinate system(MCS) for searching the closest points on the design model corresponding to measured points. A quasi particle swarm optimization(QPSO) is proposed to search the transformation parameters to implement localization between DCS and MCS. Surface subdivide method which does the searching in a recursively reduced range of the parameters u and v of the NURBS design model is developed to find the closest points. In order to verify the effectiveness of the proposed methods, the design model is generated by NURBS and the measurement data of simulation example are generated by transforming the design model to arbitrary position and orientation, and the parts are machined based on the design model and are measured on CMM. The profile errors of simulation example and actual parts are calculated by the proposed method. The results verify that the evaluation precision of freeform surface profile error by the proposed method is higher 10%–22% than that by CMM software. The proposed method deals with the hard problem that it has a lower precision in profile error evaluation of free-form surface.
- 28 March 2013
- Published by Elsevier in Chinese Journal of Mechanical Engineering
- Vol. 26 (2) , 406-413
Accurate evaluation of free-form surface profile error based on quasi particle swarm optimization algorithm and surface subdivision
Although significant progress has been made in precision machining of free-form surfaces recently, inspection of such surfaces remains a difficult problem. In order to solve the problem that no specific standards for the verification of free-form surface profile are available, the profile parameters of free-form surface are proposed by referring to ISO standards regarding form tolerances and considering its complexity and non-rotational symmetry. Non-uniform rational basis spline(NURBS) for describing free-form surface is formulated. Crucial issues in surface inspection and profile error verification are localization between the design coordinate system(DCS) and measurement coordinate system(MCS) for searching the closest points on the design model corresponding to measured points. A quasi particle swarm optimization(QPSO) is proposed to search the transformation parameters to implement localization between DCS and MCS. Surface subdivide method which does the searching in a recursively reduced range of the parameters u and v of the NURBS design model is developed to find the closest points. In order to verify the effectiveness of the proposed methods, the design model is generated by NURBS and the measurement data of simulation example are generated by transforming the design model to arbitrary position and orientation, and the parts are machined based on the design model and are measured on CMM. The profile errors of simulation example and actual parts are calculated by the proposed method. The results verify that the evaluation precision of freeform surface profile error by the proposed method is higher 10%–22% than that by CMM software. The proposed method deals with the hard problem that it has a lower precision in profile error evaluation of free-form surface.
- 20 September 2012
- Published by Elsevier in Chinese Journal of Mechanical Engineering
- Vol. 25 (5) , 875-881
Monte carlo method for the uncertainty evaluation of spatial straightness error based on new generation geometrical product specification
- 20 September 2012
- Published by Elsevier in Chinese Journal of Mechanical Engineering
- Vol. 25 (5) , 875-881
Monte carlo method for the uncertainty evaluation of spatial straightness error based on new generation geometrical product specification
- Open Access
- 1 January 2012
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2012 (1)
Quasiparticle Swarm Optimization for Cross‐Section Linear Profile Error Evaluation of Variation Elliptical Piston Skirt
Variation elliptical piston skirt has better mechanical and thermodynamic properties and it is widely applied in internal combustion engine in recent years. Because of its complex form, its geometrical precision evaluation is a difficult problem. In this paper, quasi‐particle swarm optimization (QPSO) is proposed to calculate the minimum zone error and ellipticity of cross‐section linear profile, where initial positions and initial velocities of all particles are generated by using quasi‐random Halton sequences which sample points have good distribution properties and the particles’ velocities are modified by constriction factor approach. Then, the design formula and mathematical model of the cross‐section linear profile of variation elliptical piston skirt are set up and its objective function calculation approach using QPSO to solve the minimum zone cross‐section linear profile error is developed which conforms to the ISO/1101 standard. Finally, the experimental results evaluated by QPSO, particle swarm optimization (PSO), improved genetic algorithm (IGA) and the least square method (LSM) confirm the effectiveness of the proposed QPSO and it improves the linear profile error evaluation accuracy and efficiency. This method can be extended to other complex curve form error evaluation such as cam curve profile.
- 1 January 2012
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2012 (1)
Open AccessQuasiparticle Swarm Optimization for Cross‐Section Linear Profile Error Evaluation of Variation Elliptical Piston Skirt
Variation elliptical piston skirt has better mechanical and thermodynamic properties and it is widely applied in internal combustion engine in recent years. Because of its complex form, its geometrical precision evaluation is a difficult problem. In this paper, quasi‐particle swarm optimization (QPSO) is proposed to calculate the minimum zone error and ellipticity of cross‐section linear profile, where initial positions and initial velocities of all particles are generated by using quasi‐random Halton sequences which sample points have good distribution properties and the particles’ velocities are modified by constriction factor approach. Then, the design formula and mathematical model of the cross‐section linear profile of variation elliptical piston skirt are set up and its objective function calculation approach using QPSO to solve the minimum zone cross‐section linear profile error is developed which conforms to the ISO/1101 standard. Finally, the experimental results evaluated by QPSO, particle swarm optimization (PSO), improved genetic algorithm (IGA) and the least square method (LSM) confirm the effectiveness of the proposed QPSO and it improves the linear profile error evaluation accuracy and efficiency. This method can be extended to other complex curve form error evaluation such as cam curve profile.