The main purpose of reverse engineering is to convert discrete data pointsinto piecewise smooth, continuous surface models. Before carrying out model reconstruction it issignificant to extract geometric features becau...The main purpose of reverse engineering is to convert discrete data pointsinto piecewise smooth, continuous surface models. Before carrying out model reconstruction it issignificant to extract geometric features because the quality of modeling greatly depends on therepresentation of features. Some fitting techniques of natural quadric surfaces with least-squaresmethod are described. And these techniques can be directly used to extract quadric surfaces featuresduring the process of segmentation for point cloud.展开更多
The algorithm is divided into two steps. The first step pre-locates the blank by aligning its centre of gravity and approximate normal vector with those of destination surfaces, with largest overlap of projections...The algorithm is divided into two steps. The first step pre-locates the blank by aligning its centre of gravity and approximate normal vector with those of destination surfaces, with largest overlap of projections of two objects on a plane perpendicular to the normal vector. The second step is optimizing an objective function by means of gradient-simulated annealing algorithm to get the best matching of a set of distributed points on the blank and destination surfaces. An example for machining hydroelectric turbine blades is given to verify the effectiveness of algorithm.展开更多
Data fitting is an extensively employed modeling tool in geometric design. With the advent of the big data era, the data sets to be fitted are made larger and larger, leading to more and more least-squares fitting sys...Data fitting is an extensively employed modeling tool in geometric design. With the advent of the big data era, the data sets to be fitted are made larger and larger, leading to more and more least-squares fitting systems with singular coefficient matrices. LSPIA (least-squares progressive iterative approximation) is an efficient iterative method for the least-squares fitting. However, the convergence of LSPIA for the singular least-squares fitting systems remains as an open problem. In this paper, the authors showed that LSPIA for the singular least-squares fitting systems is convergent. Moreover, in a special case, LSPIA converges to the Moore-Penrose (M-P) pseudo-inverse solution to the least- squares fitting result of the data set. This property makes LSPIA, an iterative method with clear geometric meanings, robust in geometric modeling applications. In addition, the authors discussed some implementation detail of LSPIA, and presented an example to validate the convergence of LSPIA for the singular least-squares fitting systems.展开更多
This paper presents a novel approach for least-squares fitting of complex surface to measured 3D coordinate points by adjusting its location and/or shape. For a point expressed in the machine reference frame and a def...This paper presents a novel approach for least-squares fitting of complex surface to measured 3D coordinate points by adjusting its location and/or shape. For a point expressed in the machine reference frame and a deformable smooth surface represented in its own model frame, a signed point-to-surface distance function is defined, and its increment with respect to the differential motion and differential deformation of the surface is derived. On this basis, localization, surface reconstruction and geometric variation characterization are formulated as a unified nonlinear least-squares problem defined on the product space SE(3)×Km. By using Levenberg-Marquardt method, a sequential approximation surface fitting algorithm is developed. It has the advantages of implementational simplicity, computational efficiency and robustness. Applications confirm the validity of the proposed approach.展开更多
Despite the wide availability and usage of Gatan’s DigitalMicrograph software in the electron microscopy community for image recording and analysis, nonlinear least-squares fitting in DigitalMicrograph is less straig...Despite the wide availability and usage of Gatan’s DigitalMicrograph software in the electron microscopy community for image recording and analysis, nonlinear least-squares fitting in DigitalMicrograph is less straightforward. This work presents a ready-to-use tool, the DMPFIT software package, written in DigitalMicrograph script and C++ language, for nonlinear least-squares fitting of the intensity distribution of atomic columns in atomic-resolution transmission electron microscopy (TEM) images with a general two-dimensional (2D) Gaussian model. Applications of the DMPFIT software are demonstrated both in atomic-resolution conventional coherent TEM (CTEM) images recorded by the negative spherical aberration imaging technique and in high angle annular dark field (HAADF) scanning TEM (STEM) images. The implemented peak-finding algorithm based on the periodicity of 2D lattices enables reliable and convenient atomic-scale metrology as well as intuitive presentation of the resolved atomic structures.展开更多
基金This project is supported by Research Foundation for Doctoral Program of Higher Education, China (No.98033532)
文摘The main purpose of reverse engineering is to convert discrete data pointsinto piecewise smooth, continuous surface models. Before carrying out model reconstruction it issignificant to extract geometric features because the quality of modeling greatly depends on therepresentation of features. Some fitting techniques of natural quadric surfaces with least-squaresmethod are described. And these techniques can be directly used to extract quadric surfaces featuresduring the process of segmentation for point cloud.
文摘The algorithm is divided into two steps. The first step pre-locates the blank by aligning its centre of gravity and approximate normal vector with those of destination surfaces, with largest overlap of projections of two objects on a plane perpendicular to the normal vector. The second step is optimizing an objective function by means of gradient-simulated annealing algorithm to get the best matching of a set of distributed points on the blank and destination surfaces. An example for machining hydroelectric turbine blades is given to verify the effectiveness of algorithm.
基金supported by the Natural Science Foundation of China under Grant No.61379072
文摘Data fitting is an extensively employed modeling tool in geometric design. With the advent of the big data era, the data sets to be fitted are made larger and larger, leading to more and more least-squares fitting systems with singular coefficient matrices. LSPIA (least-squares progressive iterative approximation) is an efficient iterative method for the least-squares fitting. However, the convergence of LSPIA for the singular least-squares fitting systems remains as an open problem. In this paper, the authors showed that LSPIA for the singular least-squares fitting systems is convergent. Moreover, in a special case, LSPIA converges to the Moore-Penrose (M-P) pseudo-inverse solution to the least- squares fitting result of the data set. This property makes LSPIA, an iterative method with clear geometric meanings, robust in geometric modeling applications. In addition, the authors discussed some implementation detail of LSPIA, and presented an example to validate the convergence of LSPIA for the singular least-squares fitting systems.
基金This work was supported by the National Natural Science Foundation of China(Grant No.50205018)a grant from the State Key Laboratory for Manufacturing Systems Engineering.
文摘This paper presents a novel approach for least-squares fitting of complex surface to measured 3D coordinate points by adjusting its location and/or shape. For a point expressed in the machine reference frame and a deformable smooth surface represented in its own model frame, a signed point-to-surface distance function is defined, and its increment with respect to the differential motion and differential deformation of the surface is derived. On this basis, localization, surface reconstruction and geometric variation characterization are formulated as a unified nonlinear least-squares problem defined on the product space SE(3)×Km. By using Levenberg-Marquardt method, a sequential approximation surface fitting algorithm is developed. It has the advantages of implementational simplicity, computational efficiency and robustness. Applications confirm the validity of the proposed approach.
基金Financial support from the German Research Foundation(SFB917)is acknowledgedOpen Access funding enabled and organized by Projekt DEAL.
文摘Despite the wide availability and usage of Gatan’s DigitalMicrograph software in the electron microscopy community for image recording and analysis, nonlinear least-squares fitting in DigitalMicrograph is less straightforward. This work presents a ready-to-use tool, the DMPFIT software package, written in DigitalMicrograph script and C++ language, for nonlinear least-squares fitting of the intensity distribution of atomic columns in atomic-resolution transmission electron microscopy (TEM) images with a general two-dimensional (2D) Gaussian model. Applications of the DMPFIT software are demonstrated both in atomic-resolution conventional coherent TEM (CTEM) images recorded by the negative spherical aberration imaging technique and in high angle annular dark field (HAADF) scanning TEM (STEM) images. The implemented peak-finding algorithm based on the periodicity of 2D lattices enables reliable and convenient atomic-scale metrology as well as intuitive presentation of the resolved atomic structures.
