Next Article in Journal
Multimodal Interface for Human–Robot Collaboration
Previous Article in Journal
Geometric Design and Dynamic Analysis of a Compact Cam Reducer
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Solution of Spatial Transformation Relationship of Similar Ruled Surfaces Based on Registration of Divided Regions

School of Mechanical Engineering, Xi’an University of Science and Technology, Xi’an 710000, China
*
Author to whom correspondence should be addressed.
Machines 2022, 10(10), 956; https://doi.org/10.3390/machines10100956
Submission received: 14 September 2022 / Revised: 16 October 2022 / Accepted: 18 October 2022 / Published: 19 October 2022
(This article belongs to the Section Advanced Manufacturing)

Abstract

:
Since the geometric transformation relationship of similar surfaces with complex features, such as local deformation and curvature changes, is hard to be solved through global registration, this paper proposes a method for solving the spatial transformation relationship of similar ruled surfaces based on registration of divided regions. First, an adaptive region division algorithm is proposed to divide similar surfaces, and then, an improved registration algorithm is proposed by adding two constraints which are the curvature feature and differential geometric features of point clouds. Through this improved registration algorithm, the geometric transformation relationship of each sub-region can be solved, and then the spatial geometric transformation relationship of the overall similar surface can be established. Moreover, the improved registration algorithm can ensure that the differential geometric properties of corresponding points are similar after registration, which may provide a basis for mapping and reuse of process knowledge between corresponding points on similar surfaces. Finally, two similar ruled surface blades are taken as examples for simulation verification, the results show that the maximum registration error of each sub-region is 0.025 mm, which is within the allowable error range, and the registration speed of the proposed algorithm is better than the S-ICP algorithm. This proves that the method in this paper is feasible and effective.

1. Introduction

The current research on the reuse of CNC (Computer Numerical Control) machining processes focuses on searching for similar processes or similar cases in the database or instance library according to the similarity of the geometric shape or topological structure of the parts and realizing the reuse of process knowledge through inheritance or modification [1]. However, the above methods ignore the close relationship between the 3D geometry of the parts and the CNC machining process of process knowledge reuse [2], which leads to the mismatch between the reused similar process knowledge and the CNC machining process of similar parts. This situation is particularly serious on complex surfaces due to their complex shape and structure [3], the similar processing techniques such as machining methods; cutting conditions [4] and tool parameters [5] obtained through model retrieval [6] cannot be completely copied to the CNC machining of similar surface parts. Therefore, in order to accurately and effectively realize the reuse of process knowledge between similar free-form surface parts, after obtaining the similar process of free-form surface parts, it is important to study the internal mathematical relationship between similar free-form surface parts and reveal the spatial geometric transformation relationship between free-form surface parts; only by this way, the reuse of machining knowledge between similar free-form surface parts can be realized. At present, the spatial transformation relationship between similar surfaces is roughly divided into rigid transformation and non-rigid transformation. In order to solve the rigid transformation relationship between similar surfaces, Thompson et al. [7] transformed the transformation relationship between surfaces into a mathematical least square problem and obtained a rigid transformation matrix between surfaces through iterative method, but the obtained transformation matrix was not the optimal solution of the least square problem. In [8], Horn et al. proposed the quaternion method for the above problems, and successfully solved the problem of solving the rigid transformation matrix based on least-squares principle, but there are problems such as complex calculation and low precision. Besl and Mckay [9] proposed the iterative closest point (ICP) algorithm, which searches the nearest corresponding point on the point cloud of the two surfaces and matches it to obtain the transformation matrix. At present, it is still a widely used method to solve the surface transformation relationship. However, the algorithm has high requirements on the initial positions of the two surfaces, and it has a large amount of calculation, so many scholars have optimized and improved it. For example, Yao et al. [10] simplified point cloud data and improved registration efficiency by introducing curvature feature similarity into point cloud registration. Xu [11] and Li et al. [12] improved the ICP algorithm by combining the Random Sample Consistency (RANSAC) algorithm, so the problem of low accuracy and poor robustness when registering large point clouds by traditional methods were solved. However, when the point cloud has noise and low overlap rate, the point cloud registration result is difficult to guarantee [13]. Lu et al. [14] applied multiple constraints such as curvature and distance to the point cloud for accurate registration, which solved the registration problem of similar surfaces with low feature recognition. Yu et al. [15] proposed a new registration pipeline that focuses on object-level alignment, thus overcoming the difficulty of point cloud registration with low overlap rates. However, the above algorithms cannot solve the case that two surfaces have different scales. In order to solve the problem of non-rigid transformation between similar surfaces, Du et al. [16] put forward the S-ICP algorithm, this algorithm can register point clouds with different scales. Wang [17] and Shu et al. [18] proposed a multi-directional affine registration algorithm, which can register the 3D point cloud of multi-directional affine transformation, so as to solve the scale parameters between similar surfaces.
The solution methods for the above spatial transformation relationships are based on the idea of overall registration; however, when there are complex flexible transformations such as local deformation or overall curvature changes between similar surfaces, traditional registration algorithms cannot perform good registration of similar surfaces [19]. Therefore, in order to solve the spatial geometric transformation relationship between such similar surfaces, this paper proposes a method for solving the spatial transformation relationship based on registration of divided regions. Taking two similar ruled surface blade parts with complex transformation features as an example, first, the adaptive region division algorithm is used to segment similar surfaces. Before registering each sub-region, the point cloud is screened by the curvature similarity between the point pairs, and then the S-ICP algorithm is used for accurate registration to solve the geometric transformation relationship of each sub-region. Therefore, the overall spatial transformation relationship of similar surfaces can be established through the geometric transformation relationship of each sub-region. Finally, the local coordinate system of the point cloud is defined, and the point pairs after S-ICP registration are screened by imposing range constraints on the rotational deviation of the local coordinate system, so as to ensure that the differential geometric properties between the corresponding points are similar, it provides the possibility for the subsequent realization of the mapping and reuse of process knowledge between corresponding points.

2. Description of Spatial Transformation Relationship

If a surface can be transformed into another surface with similar geometric shape through scaling, rotation, and translation transformation, it can be described that the two surfaces are similar [20].This spatial transformation relationship can be called affine transformation, in which scaling transformation can be divided into uniform scaling and non-uniform scaling [21]. The scaling transformation matrix S can be represented by three scaling components s x , s y , and s z of the coordinate axis as:
S = [ s x s y s z ]
where s x > 0 , s y > 0 , s z > 0 , when s x = s y = s z is uniform scaling.
The rotation matrix R is generally represented by three rotation variables α , β , γ around the three-coordinate axis, that is:
R = R z ( α ) R y ( β ) R x ( γ ) = [ cos γ sin γ 0 sin γ cos γ 0 0 0 1 ] [ cos β 0 sin β 0 1 0 sin β 0 cos β ] [ 1 0 0 0 cos α sin α 0 sin α cos α ] = [ cos β cos γ sin α sin β cos γ cos α sin γ cos α sin β cos γ + sin α sin γ cos β sin γ sin α sin β sin γ + cos α cos γ cos α sin β sin γ sin α cos γ sin β sin α cos β cos α cos β ]
where α , β , γ ( π , π ] , R Δ ( θ ) is expressed as a rotation transformation matrix that rotates the θ angle counterclockwise around the Δ axis.
The translation vector T can be represented by the 3 translation components t x , t y , t z along the coordinate axis as:
T = ( t x t y t z )
It can be seen from the above that the spatial geometric transformation relationship between two similar surfaces can be established by three variables: scaling S, rotation R, and translation T. Supposing that the coordinate points (x, y, z) on the surface s are affine transformation into the coordinate points (x′, y′, z′) on the corresponding surface s’, the three-dimensional Euclidean space affine transformation can be obtained:
[ x y z ] = S R [ x y z ] + T
Not all spatial transformation relationships of similar free-form surfaces can be expressed by the above affine transformation matrix. When there are local deformations, surface twists, and overall curvature changes between two similar surfaces, it is generally difficult to use a simple display function mapping relationship to represent the overall transformation relationship. Therefore, in order to solve the spatial transformation relationships of such similar surfaces, the whole surface is divided into several regions according to the curvature characteristics of the surface in this paper, and then each sub-region is registered to solve the spatial geometric transformation relationship m i of each sub-region, so that the spatial geometric transformation relationship m = { m 1 , m 2 , m 3 , , m n } of the entire similar surface can be established, which according to the geometric transformation relationship m i of each sub-region.

3. Solving the Spatial Transformation Relation

The proposed method in this paper for solving the spatial transformation relationship of similar surfaces is divided into four parts: adaptive region division, curvature characteristic constraints, point cloud registration to solve transformation parameters, and local coordinate system constraints. The main idea is to use adaptive region division algorithm to segment similar surfaces that cannot be registered directly, and then each sub region is registered after region division. Before each sub region is registered, the wrong point pairs are preliminarily screened through curvature similarity judgment, and then the S-ICP algorithm is used to register the point cloud; the geometric transformation relationship of each sub-region can be solved. Therefore, the overall spatial transformation relationship of similar surfaces can be established through the transformation relationship of each sub-region. Finally, the point pairs after registration are further screened by constraining the rotational deviation of the local coordinate system between the corresponding points, so as to ensure that the differential geometric properties between the corresponding points are similar.

3.1. Adaptive Region Division Algorithm for Similar Surfaces

For the division of surfaces, the parameters of the surface should first be selected as the basis for division [22]. Because the curvature is independent of the position, size, and posture of the free-form surface, the curvature is selected as the parameter for the division of similar surfaces. However, due to the differences between similar surfaces such as local deformation and overall curvature inconsistency, the method of dividing the surface by the curvature of each point on the surface can only reflect the respective differential geometric properties of similar surfaces, so the corresponding regions between similar surfaces still have the problem of inconsistency in the size of curvature and degree of deformation, which leads to the registration effect is still unsatisfactory. Therefore, the curvature mutation points on the boundary are used to divide the surfaces in this paper, so as to better reflect the curvature characteristics on the surfaces. It can also ensure that the curvature characteristics of the corresponding sub regions after segmentation are as similar as possible, so as to achieve good registration between corresponding regions.
Given two similar surfaces P and P , extract all feature points on the boundaries of surfaces P and P , then record them as feature point sets Z = { z i | z i R , i = 1 , 2 , , n } and Z = { z j | z j R , j = 1 , 2 , , m } , respectively. Using the moving least squares method [23] to solve the maximum principal curvature k 1 ( z i ) and the minimum principal curvature k 2 ( z i ) of each feature point z i in the point sets Z , where k 1 ( z i ) and k 2 ( z i ) represent the maximum and minimum bending degrees at the feature point, respectively; therefore, the curvature characteristic parameter is defined as [24]:
ξ ( z i ) = 1 2 1 π arctan k 1 ( z i ) + k 2 ( z i ) k 1 ( z i ) + k 2 ( z i )
According to the definition of Equation (5), two criteria for judging whether z i is characteristic point of curvature mutation are obtained:
ξ ( z i ) > max [ ξ ( z i , 1 ) , ξ ( z i , 2 ) , , ξ ( z i , j ) ]
ξ ( z i ) < min [ ξ ( z i , 1 ) , ξ ( z i , 2 ) , , ξ ( z i , j ) ]
where ξ ( z i , j ) is the curvature characteristic parameter of the adjacent feature points of point z i . If Equation (6) is satisfied, then z i is considered as the boundary convex point; if Equation (7) is satisfied, then z i is considered as the boundary concave point. If one of the two is satisfied, then z i is regarded as the boundary curvature mutation point, and stored in the boundary curvature mutation pointset C, and record the u , v parameter values of each boundary curvature mutation point as { u c i , v c i } , where u , v [ 0 , 1 ] . As shown in Figure 1a, the distribution of surface boundary curvature mutation point can reflect the local deformation of the surface and the change of the curvature. Therefore, the surface P can be divided by connecting the boundary points. However, due to the large number of curvature mutation points, it is necessary to select appropriate curvature mutation points to divide the surface. The principle of selection is that the characteristic points with similar u or v values on both sides of the surface, which are called “boundary points”. As shown in Figure 1b, the red point is the final selected “boundary point”, and the line connecting the boundary point is called the “boundary line”. In order to ensure that the boundary line can reflect the curvature characteristics of the surface, and the region division can be better realized, the corresponding boundary points are connected by fitting curve in this paper. As shown in Figure 1c, because the u and v values of the corresponding boundary points at both ends of the surface are different, in order to make the boundary lines as smooth as possible, the isoparametric method is used to divide u direction or v direction in this paper, and then used the fit curve to connect the two corresponding boundary points to divide the surface. At the same time, in order to ensure that the regions between similar surfaces can be registered correspondingly, the number of sub regions divided by surface P and similar surface P′ should be consistent. Therefore, in the feature point sets Z , find the feature points with the same u , v parameter values as the points in the boundary curvature mutation points sets C , record them as the boundary curvature mutation points of the surface P and store them in the boundary curvature mutation points sets C , then use them to divide the similar surface P .
From what is discussed above, the whole adaptive region partition algorithm is reasonably drawn out as follows.
Step 1. Extract all feature points on the boundaries of surfaces P and P , then record them as feature point sets Z = { z i | z i R , i = 1 , 2 , , n } and Z = { z j | z j R , j = 1 , 2 , , m } , respectively.
Step 2. Compute k 1 ( z i ) and k 2 ( z i ) of each point in the point sets Z, and compute ξ ( z i ) according to Equation (5).
Step 3. Determine whether z i is a boundary curvature mutation point by Equations (6) and (7), and store it in the boundary curvature mutation point sets C.
Step 4. Connect the boundary points to divide the surface P and output each division region S p = { p 1 , p 2 , ...... , p n } .
Step 5. Establish the boundary curvature mutation point set C of the surface P according to the boundary curvature mutation point sets C, repeat the step to divide the surface P , output each division region S p = { p 1 , p 2 , ...... , p n } .

3.2. Similarity Judgment of Differential Geometric Properties

3.2.1. Curvature Property Constraints

Due to the high data density of the extracted similar surface point clouds, there may be a large number of redundant points, which seriously affects the efficiency of subsequent algorithms. Therefore, before registering point clouds, the number of point clouds should be screened according to certain requirements. Since curvature is a feature that does not change with translation, rotation, and scaling transformations, the point cloud can be preliminary screened by the curvature feature to remove the wrong point pairs.
Given two point sets p i = { q p i , x | q p i , x R , x = 1 , 2 , , N } and p i = { q p i , y | q p i , y R , y = 1 , 2 , , M } , which are the corresponding regional point sets in two similar surfaces, first, calculate the principal curvature k 1 ( q p i , x ) , k 2 ( q p i , x ) , and k 1 ( q p i , y ) , k 2 ( q p i , y ) of each point in the point cloud sets p i and p i . Then, for each point in the point set p i , find the corresponding point with similar curvature characteristics in its corresponding point set p i . Therefore, the similarity judgment criterion of curvature is expressed as follows [25]:
{ k 1 ( q p i , x ) k 1 ( q p i , y ) k 1 ( q p i , x ) + k 1 ( q p i , y ) < α 1 k 2 ( q p i , x ) k 2 ( q p i , y ) k 2 ( q p i , x ) + k 2 ( q p i , y ) < α 2
where α 1 , α 2 are the curvature similarity thresholds, and only when the above two criteria are met, the curvature characteristics of point pairs are similar. Further, extract the point pairs that meet the judgment criteria of curvature similarity according to Equation (8), and store them in the corresponding point sets U p i and U p i . The point cloud registration of each corresponding point set U p i and U p i is carried out through the S-ICP algorithm, so as the geometric transformation relationship m i = { S i , R i , T i } , i = 1 , 2 , , n between each corresponding region can be solved.

3.2.2. Local Coordinate System Property Constraints

Whether the differential geometric properties of corresponding points between similar surfaces are similar is the basis for realizing process knowledge mapping and reuse between corresponding points, screening only by the curvature property of the corresponding points does not guarantee that the differential geometric properties of the corresponding points after registration are similar. Therefore, it is necessary to further screen the corresponding points after registration, and the normal vector and the tangent vector are important attributes to measure whether the differential geometric properties of corresponding points are similar. However, if only one of these variables is used to filter the point cloud, a point may have many corresponding points with similar differential geometric characteristics. Therefore, the normal vector, tangent vector and their vector product are combined to build the local coordinate system of the point cloud in this paper, and the corresponding points after S-ICP registration are further screened to ensure that the differential geometric properties between the corresponding points are similar.
Suppose O u is any point in the corresponding point cloud set U p i , e x is the unit normal vector of the point, e y is the unit tangent vector, so its vector product is e z = e x × e y . As shown in Figure 2a, take O u as the origin of the coordinate, and let the directions of e x , e y , e z be the x u , y u , z u axes, respectively, to establish the local coordinate system O u - x u y u z u of the point. Similarly, construct the local coordinate system O u - x u y u z u of its corresponding point O u in the corresponding point set U p i , where F i is the tangent plane of the point. As shown in Figure 2b, in order to facilitate the observation of the rotation deviation of each axis of the corresponding point, the corresponding point is converted to the same coordinate system, so the rotation deviation angle θ 1 , θ 2 , θ 3 of the normal vector, tangent vector, and vector product between the corresponding points can be calculated by Equation (9):
cos θ i = a · b | a | · | b | , θ i = arccos ( a · b | a | · | b | )
Point pairs are further matched by changing the minimum distance measure between corresponding points to the minimum included angle measure. First, constraints are imposed on the rotational deviation of each axis, and then a weight factor is introduced to give different weights to the rotational deviations of each axis to further constrain the sum of the rotational deviations of the overall local coordinate system, so as to screen out the corresponding points with similar differential geometry. Since the normal vector can be used to describe the direction of the local surface and is an important feature of the surface geometry [26], it is necessary to ensure that the weight of the normal vector is relatively large. Therefore, the rotational deviation measurement formula of the local coordinate system given in this paper is as follows:
ω = ω ( θ 1 , θ 2 , θ 3 ) = { θ 1 δ 1 θ 2 δ 2 θ 3 δ 3 ( 1 2 θ 1 + 1 4 θ 2 + 1 4 θ 3 ) δ 4
where δ i is the rotational deviation threshold, and the point pairs that satisfy the constraints of each axis in Equation (10) at the same time are extracted to form the corresponding point sets with similar differential geometric properties. This method can effectively filter out the corresponding points with dissimilar differential geometric characteristics in the corresponding point clouds after registration. It provides the possibility of reusing machining process knowledge between corresponding points of similar surfaces.

3.3. Region Registration Algorithm for Similar Surfaces

As shown in Figure 3, the point cloud registration algorithm based on region division can be reasonably obtained from the above discussion:
Step 1. Use the adaptive region division algorithm to segment similar surfaces, and denote the divided regions as S p = { p 1 , p 2 , ...... , p n } and S p = { p 1 , p 2 , ...... , p n }
Step 2. Randomly select a regional point cloud sets p i = { q p i , x | q p i , x R , x = 1 , 2 , , N } from S P , and select its corresponding regional point cloud sets p i = { q p i , y | q p i , y R , y = 1 , 2 , , M } in S P .
Step 3. Calculate the principal curvature of each point in the point cloud sets p i and p i .
Step 4. Extract point pairs with similar curvature characteristics by Equation (8) and store them in corresponding point sets U p i and U p i .
Step 5. Input U p i and U p i , and solve the geometric transformation parameter m i = { S i , R i , T i } of this region by S-ICP algorithm.
Step 6. The point pairs after registration are further filtered by Formula (10) to extract corresponding points with similar differential geometric characteristics.
Step 7. Repeat steps 3–7 for point sets p i and p i in other regions to solve the m i of each sub-region.
Step 8. the overall spatial transformation relationship M = { m 1 , m 2 , m 3 , , m n } of similar surfaces can be established.

4. Experimental Design and Results

To prove the feasibility and effectiveness of the method proposed in this paper, similar blades of ruled surface were used for registration verification. The simulation was based on MATLAB 2020a, whose environment was configured for a 3.3 GHz CPU with 8 GB RAM. The root mean square error (RMSE) is applied to evaluate the error of the registration, the RMSE can be expressed as [16]:
R M S = ( 1 N x = 1 N S R q p i , x + T q p i , c k ( x ) 2 2 ) 1 2

4.1. Similar Surface Region Division

Figure 4 shows an example of two similar ruled surface blades P and P′ for comparative analysis. The length and width of blade P are 107.06 mm and 68.67 mm, respectively. The length and width of blade P′ are 79.42 mm and 53.27 mm, respectively. Blade P′ is the complex flexible transformation blade of P. The upper left position of the two blades shown in Figure 4a has significant bending deformation, and the overall curvature of the two blades shown in Figure 4b,c is obviously different. Therefore, it can be proven that the two similar blades selected in this paper have complex flexible transformation.
The initial state of the point cloud model of two similar blades is shown in Figure 5a, and the results by applying the traditional registration method is shown in Figure 5b. It can be obvious seen that although the registration of blade on size is correct, the overall surface registration is still poor. This is because the registration accuracy of traditional methods is affected by the overall curvature and local deformation of the blades, and the greater the difference of blade, the lower the accuracy of registration. Therefore, the traditional global registration method is difficult to solve the registration problem of similar surfaces obtained from complex flexible transformations.
In order to solve the above-mentioned phenomenon of poor registration, an adaptive region division algorithm is proposed in this paper for region division of similar surfaces. As show in Figure 6a, first, the abrupt curvature points of the surface boundary were found through the algorithm; it can be seen that the abrupt curvature points are distributed at the obvious curvature change of the surface boundary, which can closely reflect curvature changes and local deformation. Then, the curvature mutation points with approximate u or v values on both sides of the blade as the boundary points were selected, as shown in Figure 6b; the red abrupt curvature points are called the boundary points. Finally, the fitting curve was used to connect the corresponding boundary points to complete the region division of blade P′. It can be seen from Figure 6c that the adaptive region division algorithm can achieve a good segmentation effect for the local deformation and obvious curvature changes of blade P′.
After the blade P′ completes the region division, the adaptive region division algorithm is used to divide the region of blade P, and the result is shown in Figure 7. the boundary point on blade P has the same value of u and v parameters as the boundary points on blade P′. It can be seen that blade P is also divided into 20 sub regions. The shape and curvature of the corresponding sub regions of blade P and P′ are relatively similar, which provides a good initial condition for accurate registration between the corresponding regions.

4.2. Point Cloud Registration for Each Sub-Region

After each sub-region is divided, the S-ICP algorithm is used to register the point cloud of each sub-region to solve the geometric transformation relationship, and the corresponding regions p1 and p1′ are taken as examples in this paper. The registration result is shown in Figure 8a; it can be seen that the registration results of the divided regions are greatly improved compared with the overall registration results, and a good registration effect can be basically achieved. However, because point pairs with dissimilar curvature characteristics and differential geometric properties are not screened, there are many point pairs with inconsistent curvature at the diagonal positions that cannot be completely coincident, and there are also many corresponding points at the edges with different differential geometric properties. Figure 8b shows the registration result of the algorithm in this paper, due to the curvature characteristics and differential geometric properties of point pairs have been filtered, it can be seen from the figure that the registration effect of the method in this paper is generally better than the S-ICP algorithm, the areas that cannot be fitted due to inconsistent curvature become smaller, and the point pairs with dissimilar differential geometric properties at the edge of the surface are significantly reduced.
It can be seen from Table 1 that the geometric transformation parameters between regions solved by the two methods are relatively close, the registration time of the method in this paper is reduced from 40.7 s to 30.5 s compared with the S-ICP algorithm, and the root mean square error is also reduced. This shows that this paper provides a good initial environment for precise registration by screening point pairs with large differences in curvature characteristics, which can effectively reduce the registration time and improve registration accuracy. At the same time, the differential geometric properties of the corresponding points can be ensured to be similar after the differential geometric properties of the point pairs are screened.
Figure 9 shows the registration results of the algorithm in this paper for each sub-region between similar surfaces. It can be seen that the registration effect of each region is good, and there is no result that cannot be registered due to local deformation and curvature difference between regions. Even in the p1 area with the largest bending deformation, the overall registration effect is still good except for a few edges that cannot be fitted, this also proves the effectiveness of the algorithm in this paper.
The registration time and RMSE of the two methods for each sub-region are shown in Figure 10 and Figure 11. It can be seen from the figure that the maximum RMSE of each region registered by the algorithm in this paper is 2.52 × 10 2 mm , and the RMSE of other regions fluctuates in 5 × 10 3 mm .The actual registration errors are all within the allowable error range σ 0.1 mm , this indirectly indicates that the geometric transformation relationship of each corresponding region solved by the method in this paper is relatively accurate. At the same time, since the reduction of the number of point pairs by screening out some wrong point pairs, the registration time of the method in this paper is significantly reduced compared with the SICP algorithm. Moreover, because point pairs with large differences in curvature characteristics and differential geometric properties are filtered out, the RMSE is also reduced.
As shown in Figure 12, in order to verify that the overall spatial transformation relationship M = { m 1 , m 2 , m 3 , , m 20 } of similar surfaces can be established by solving the geometric transformation relationship m i of each sub-region, the corresponding regions after registration are formed into an overall surface for analysis. It can be seen from Figure 12a that the entire surface formed by each region have a good overall fit, and there is no overlapping of each sub-region and no deformation of the entire surface. It can be seen from Figure 12b that due to point clouds having been filtered through differential geometric properties, the overall similar surfaces can be well fitted where the curvature changes and distortions are large, and the corresponding points can be accurately matched. There is no situation that the overall similar surfaces are still difficult to coincide after registration as in Figure 5. Therefore, the geometric transformation relationship M = { m 1 , m 2 , m 3 , , m 20 } between the overall similar surfaces can be composed of the transformation relationship m i of each sub-region. This proves that the method of region registration in this paper can effectively solve the overall spatial transformation relationship of similar surfaces with complex transformations.

5. Conclusions

A method for solving the spatial transformation relationship of similar ruled surfaces is proposed based on registration of divided regions in this paper, which can solve the geometric transformation relationship between similar surfaces with complex flexible transformations such as local deformation or curvature changes. The main contributions can be summarized as follows:
  • An adaptive region division algorithm is proposed to accurately divide the complex surfaces by finding curvature mutation points on the surface boundary. This region division algorithm can ensure that the corresponding regions between similar surfaces are similar in shape, and have the same number, which provides the possibility for the subsequent point cloud registration of each sub-region.
  • The traditional S-ICP algorithm is improved by introducing the similarity judgment of curvature characteristics and differential geometry properties, and the registration efficiency and accuracy are improved. Moreover, the improved S-ICP algorithm can ensure that the differential geometric properties between corresponding points are similar after registration, which provides a basis for mapping and reuse of process knowledge between corresponding points on similar surfaces.
  • The calculation results show that the method proposed in this paper can effectively complete the registration of each sub-region and solve the spatial transformation relationship. Compared with the traditional S-ICP algorithm, the registration accuracy of the proposed method is improved, and the registration time of each sub-region is reduced by about 20%. In addition, the simulation results show that the registration effect of the overall surface which is formed by each sub-region after registration is also very good, it can achieve a better fit even in the area of local deformation or curvature changes. It is proven that the proposed method in this paper is suitable for the situation that it is difficult to solve the spatial geometric transformation relationship of similar surfaces with complex transformation through global registration.
However, the method in this paper cannot solve the numerical value of curvature change and torque deformation between similar surfaces, and when the degree of curvature changes or torque deformation between similar surfaces is too large, it is difficult to achieve accuracy in the final registration result, so it is also an important research direction of our future work.

Author Contributions

F.H. and Z.H. conceptualized the study. F.H. drew up the paper direction and solution. Z.H. compiled the algorithm and completed the simulation experiment. L.H. corrected the point cloud data. X.P. analyzed and corrected the data error. M.Y. and C.Z. supplied significant information regarding the current research to the introduction and conclusion. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (51905418), the Coal Joint Fund Project of Shaanxi (2019JLM-37), the Excellent Youth Fund of Xi’an University of Science and Technology(2020YQ3-07), and the Opening Topic Fund of Key Laboratory of Aeroengine High Performance Manufacturing Industry and Information Technology of Ministry of China (HPM-2020-04). Shaanxi innovative talents promotion plan—Science and technology innovation team (2021TD-27).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Huang, R.; Zhang, S.; Xu, C.; Zhang, X.; Zhang, C. A flexible and effective NC machining process reuse approach for similar subparts. Comput. -Aided Des. 2015, 62, 64–77. [Google Scholar] [CrossRef]
  2. Huang, B.; Zhang, S.; Huang, R.; Li, X.; Zhang, Y. An effective retrieval approach of 3D CAD models for macro process reuse. Int. J. Adv. Manuf. Technol. 2019, 102, 1067–1089. [Google Scholar] [CrossRef]
  3. Sun, Y.; Jia, J.; Xu, J.; Chen, M.; Niu, J.P. feedrate and trajectory planning for free-form surface machining: A state-of-the-art review. Chin. J. Aeronaut. 2022, 35, 12–29. [Google Scholar] [CrossRef]
  4. Yan, S.; Sun, Y. Early chatter detection in thin-walled workpiece milling process based on multi-synchro squeezing transform and feature selection. Mech. Syst. Signal Process 2022, 169, 108622. [Google Scholar] [CrossRef]
  5. Sun, Y.; Jiang, S. Predictive modeling of chatter stability considering force-induced deformation effect in milling thin-walled parts. Int. J. Mach. Tools Manuf. 2018, 135, 38–52. [Google Scholar] [CrossRef]
  6. Huang, R.; Jing, J.F.; He, K.; Chen, Z. An effective free form surface retrieval approach for potential machining process reuse. Int. J. Adv. Manuf. Technol. 2017, 91, 4341–4358. [Google Scholar] [CrossRef]
  7. Thompson, E.H. An exact linear solution of the problem of absolute orientation. Photogrammetria 1958, 15, 163–179. [Google Scholar] [CrossRef]
  8. Horn, B.K.P. Closed-form solution of absolute orientation using unit quaternions. J. Opt. Soc. Am. A 1987, 4, 629–642. [Google Scholar] [CrossRef]
  9. Besl, P.J.; Mckay, H.D. A method for registration of 3-D shapes. IEEE Trans. Pattern Anal. Mach. Intell. 1992, 14, 239–256. [Google Scholar] [CrossRef] [Green Version]
  10. Yao, Z.; Zhao, Q.; Li, X.; Bi, Q. Point cloud registration algorithm based on curvature feature similarity. Measurement 2021, 177, 109274. [Google Scholar] [CrossRef]
  11. Xu, G.; Pang, Y.; Bai, Z.; Wang, Y.; Lu, Z. A Fast Point Clouds Registration Algorithm for Laser Scanners. Appl. Sci. 2021, 11, 3426. [Google Scholar] [CrossRef]
  12. Žagar, B.L.; Yurtsever, E.; Peters, A.; Knoll, A.C. Point Cloud Registration With Object-Centric Alignment. IEEE Access 2022, 10, 76586–76595. [Google Scholar] [CrossRef]
  13. Geng, N.; Ma, F.; Yang, H.; Li, B.; Zhang, Z. Neighboring constraint-based pairwise point cloud registration algorithm. Multimed. Tools Appl. 2016, 75, 16763–16780. [Google Scholar] [CrossRef]
  14. Lu, J.; Wang, Z.; Hua, B.; Chen, K. Automatic point cloud registration algorithm based on the feature histogram of local surface. PLoS ONE 2020, 15, e0238802. [Google Scholar] [CrossRef]
  15. Li, J.; Huang, S.; Cui, H.; Ma, Y.; Chen, X. Automatic Point Cloud Registration for Large Outdoor Scenes Using a Priori Semantic Information. Remote Sens. 2021, 13, 3474. [Google Scholar] [CrossRef]
  16. Du, S.Y.; Zheng, N.; Lei, X.; Ying, S.H.; Xue, J. Scaling iterative closest point algorithm for registration of m-D point sets. J. Vis. Commun. ImageRepresentation 2010, 21, 442–452. [Google Scholar] [CrossRef]
  17. Wang, C.; Shu, Q.; Yang, Y.; Deng, S. Point cloud registration in multidirectional affine transformation with variance compensation. Acta Opt. Sin. 2019, 39, 0215002. [Google Scholar] [CrossRef]
  18. Shu, Q.; He, X.; Wang, C.; Yang, Y.; Cui, Z. Fast point cloud registration in multidirectional affine transformation. Opt. —Int. J. Light Electron Opt. 2021, 229, 165884. [Google Scholar] [CrossRef]
  19. Netto, G.M.; Oliveira, M.M. Robust point-cloud registration based on dense point matching and probabilistic modeling. Vis Comput. 2022, 38, 3217–3230. [Google Scholar] [CrossRef]
  20. Han, F.Y.; Zhang, C.W.; Guo, W.; Peng, X.L.; Zhang, W. A high-efficiency generation method of integral impeller channel tool path based on parametric domain template trajectory mapping. Int. J. Adv. Manuf. Technol. 2019, 100, 75–85. [Google Scholar] [CrossRef]
  21. Ying, S.H.; Peng, J.G.; Du, S.Y.; Qiao, H. A Scale Stretch Method Based on ICP for 3D Data Registration. IEEE Trans. Autom. Sci. Eng. 2009, 6, 559–565. [Google Scholar] [CrossRef]
  22. Zhang, L.; Guo, J.; Xiao, J. Blending Surface Segmentation and Editing for 3D Models. IEEE Trans. Vis. Comput. Graph. 2020, 28, 2879–2894. [Google Scholar] [CrossRef] [PubMed]
  23. Wan, J.; Li, X. Analysis of a superconvergent recursive moving least squares approximation. Appl. Math. Lett. 2022, 133, 108223. [Google Scholar] [CrossRef]
  24. Wang, C.; Shu, Q.; Yang, Y.; Deng, S. Point Cloud Registration in Multidirectional Affine Transformation. IEEE Photonics J. 2018, 10, 1–15. [Google Scholar] [CrossRef]
  25. Barequet, G.; Sharir, M. Partial Surface and Volume Matching in Three Dimensions. IEEE Trans. Pattern Anal. Mach. Intell. 1998, 19, 929–948. [Google Scholar] [CrossRef]
  26. Li, L.; Cao, X.; Sun, J. Three-Dimensional Point Cloud Registration Based on Normal Vector Angle. J. Indian Soc. Remote Sens. 2019, 47, 585–593. [Google Scholar] [CrossRef]
Figure 1. Selection of boundary points and region division of surfaces: (a) distribution of abrupt curvature points, (b) selection of boundary points, (c) surface region division.
Figure 1. Selection of boundary points and region division of surfaces: (a) distribution of abrupt curvature points, (b) selection of boundary points, (c) surface region division.
Machines 10 00956 g001
Figure 2. Local coordinate system and rotational deviation of corresponding points: (a) the local coordinate system of the corresponding point, (b) rotational deviation of the local coordinate system.
Figure 2. Local coordinate system and rotational deviation of corresponding points: (a) the local coordinate system of the corresponding point, (b) rotational deviation of the local coordinate system.
Machines 10 00956 g002
Figure 3. Flow chart of algorithm.
Figure 3. Flow chart of algorithm.
Machines 10 00956 g003
Figure 4. Three-dimensional model of two similar blades: (a) local deformation of similar blades, (b) vertical view of similar blades, (c) side view of similar blades.
Figure 4. Three-dimensional model of two similar blades: (a) local deformation of similar blades, (b) vertical view of similar blades, (c) side view of similar blades.
Machines 10 00956 g004
Figure 5. Overall point cloud registration of similar surfaces: (a) Point cloud initial state, (b) point cloud overall registration effect.
Figure 5. Overall point cloud registration of similar surfaces: (a) Point cloud initial state, (b) point cloud overall registration effect.
Machines 10 00956 g005
Figure 6. Region division of ruled blade P′: (a) distribution of abrupt curvature points, (b) extract boundary points for region division, (c) region division of blade.
Figure 6. Region division of ruled blade P′: (a) distribution of abrupt curvature points, (b) extract boundary points for region division, (c) region division of blade.
Machines 10 00956 g006
Figure 7. Region division of ruled blade P: (a) distribution of boundary points, (b) region division of blade.
Figure 7. Region division of ruled blade P: (a) distribution of boundary points, (b) region division of blade.
Machines 10 00956 g007
Figure 8. Point cloud registration effect comparison: (a) S-ICP algorithm, (b) region-registration algorithm.
Figure 8. Point cloud registration effect comparison: (a) S-ICP algorithm, (b) region-registration algorithm.
Machines 10 00956 g008
Figure 9. Point cloud registration for each sub-region.
Figure 9. Point cloud registration for each sub-region.
Machines 10 00956 g009
Figure 10. Registration time of each sub-region under two algorithms.
Figure 10. Registration time of each sub-region under two algorithms.
Machines 10 00956 g010
Figure 11. RMSE of each sub-region under two algorithms.
Figure 11. RMSE of each sub-region under two algorithms.
Machines 10 00956 g011
Figure 12. The overall registration effect of each sub-region: (a) front view of overall similar surface, (b) side view of overall similar surface.
Figure 12. The overall registration effect of each sub-region: (a) front view of overall similar surface, (b) side view of overall similar surface.
Machines 10 00956 g012
Table 1. Comparing the registration results of the two methods.
Table 1. Comparing the registration results of the two methods.
MethodScaleRotationTranslationTime/sRMES/mm
S-ICP
algorithm
diag(0.753,0.766,0.754) 0.9674 0.0418 0.2498 0.0530 0.9309 0.3613 0.2477 0.3646 0.8984 (29.22,20.86,92.10)40.70.0564
Region-registration algorithmdiag(0.752,0.762,0.751) 0.9796 0.0540 0.1958 0.1206 0.9284 0.3482 0.1632 0.3646 0.9167 (29.67,20.63,92.22)30.50.0354
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Han, F.; Hu, Z.; He, L.; Peng, X.; Yang, M.; Zhang, C. Solution of Spatial Transformation Relationship of Similar Ruled Surfaces Based on Registration of Divided Regions. Machines 2022, 10, 956. https://doi.org/10.3390/machines10100956

AMA Style

Han F, Hu Z, He L, Peng X, Yang M, Zhang C. Solution of Spatial Transformation Relationship of Similar Ruled Surfaces Based on Registration of Divided Regions. Machines. 2022; 10(10):956. https://doi.org/10.3390/machines10100956

Chicago/Turabian Style

Han, Feiyan, Zhitao Hu, Longlong He, Xianlong Peng, Manzhi Yang, and Chuanwei Zhang. 2022. "Solution of Spatial Transformation Relationship of Similar Ruled Surfaces Based on Registration of Divided Regions" Machines 10, no. 10: 956. https://doi.org/10.3390/machines10100956

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop