Search

Radar system error registration is a prerequisite and foundation for radar networking. For radars with long detection distances, their measurement errors in the detection space exhibit obvious non-uniform distribution characteristics, which causes traditional system error correction methods to be difficult to solve the error correction problem. In response to the non-uniform distribution characteristics of radar system errors, this paper proposes to divide the radar detection space into several small intervals, in each of which the system errors can be considered as a fixed value. At this time, the iterative closest point algorithm can be used to calculate the radar system error in each interval, and finally a system error compensation matrix is formed for the entire detection space, thereby achieving accurate correction of non-uniform distribution system errors. The effectiveness of the proposed method is verified by the experimental data. [ABSTRACT FROM AUTHOR]

The rigid matching of two geometric clouds is vital in the computer vision and its intelligent applications, such as computational geometry, robotics, shape modelling, surface reconstruction and mapping, and many other fields. The variants of the iterative closest point algorithm were employed as the most noticeable matching algorithm. In traditional ICP algorithms applications for symmetrical geometry matching, the initial uncertainty and the multiple local minima of the distance function adversely affect the alignment process, which leads to weak performance, such as incorrect correspondence, narrow convergence region, and instability. In this study, the novel algorithm fused the ICP algorithm, particle filter and K-means clustering to correctly estimate the transformation ICP parameters. Further guide to initial values of parameters and their covariance obtained by k-means clustering. Then, a particle filter was implemented to estimate accurate values and perform global optimization. In the introduced PF-ICP algorithm, the alignment parameters: rotation angles, scale factor, and translation, were defined as particles elements optimized using a sequential importance resampling (SIR) particle filter. The proposed algorithm was implemented on a medical robot FPGA board and applied to "three symmetrical models" and "noisy and poor datasets." The calculated variances and estimated parameters were compared with four modified ICP methods. The results show a significantly increasing accuracy and convergence region with an acceptable speed for the practical conditions. [ABSTRACT FROM AUTHOR]

In the field of automatic bulk material loading, accurate detection of the profile of the material pile in the compartment can control its height and distribution, thus improving the loading efficiency and stability, therefore, this paper proposes a new method for pile detection based on cross-source point cloud registration. First, 3D point cloud data are simultaneously collected using lidar and binocular camera. Second, feature points are extracted and described based on 3D scale-invariant features and 3D shape contexts algorithms, and then feature points are used in progressive sample consensus algorithm to complete coarse matching. Then, bi-directional KD-tree accelerated iterative closest point is established to complete the fine registration. Ultimately, the detection of the pile contour is realized by extracting the point cloud boundary after the registration. The experimental results show that the registration errors of this method are reduced by 54.2%, 52.4%, and 14.9% compared with the other three algorithms, and the relative error of the pile contour detection is less than 0.2%. [ABSTRACT FROM AUTHOR]

Radar system error registration is a prerequisite and foundation for radar networking. For radars with long detection distances, their measurement errors in the detection space exhibit obvious non-uniform distribution characteristics, which causes traditional system error correction methods to be difficult to solve the error correction problem. In response to the non-uniform distribution characteristics of radar system errors, this paper proposes to divide the radar detection space into several small intervals, in each of which the system errors can be considered as a fixed value. At this time, the iterative closest point algorithm can be used to calculate the radar system error in each interval, and finally a system error compensation matrix is formed for the entire detection space, thereby achieving accurate correction of non-uniform distribution system errors. The effectiveness of the proposed method is verified by the experimental data.

Magnetic flux leakage (MFL) is a non-destructive testing method for shale gas pipeline safety monitoring. Despite many pipelines have completed two or more rounds of internal inspection and have accumulated substantial data, effectively analyzing and utilizing this MFL data remains a significant challenge. To that end, this study proposes a novel combined model that integrates Iterative Closest Point (ICP) and DBSCAN (Density-Based Spatial Clustering of Applications with Noise) fusion to match multiple MFL data. The model outputs the matching result and visualisation images of MFL data acquired in different years. Furthermore, RMSE (root mean square error) and overlap rate have been used to evaluate the model. The results indicate that the average distance error of matched defects between two datasets decreased by 72.5%, and the overlap rate increased by 20%. Additionally, the DBSCAN Fusion shows better computational efficiency with an increase in defect quantity within the pipe segments. Finally, the impact of different datasets on the model’s matching accuracy is discussed in this study. The findings show that small-scale datasets or higher false detection rates lead to decreased accuracy. The proposed model fully leverages MFL data to achieve rapid matching of defects, offering a dependable and effective technical solution for safety monitoring and corrosion prediction in shale gas pipelines. [ABSTRACT FROM AUTHOR]

Plant height is regarded as a key indicator that is crucial for assessing the crop growth status and predicting yield. In this study, an advanced method based on solid-state LiDAR technology is proposed, which is specifically designed to accurately capture the phenotypic characteristics of plant height during the maize growth cycle. By segmenting the scanned point cloud of maize, detailed point cloud data of a single maize plant were successfully extracted, from which stem information was accurately measured to obtain accurate plant height information. In this study, we will concentrate on the analysis of individual maize plants. Leveraging the advantages of solid-state LiDAR technology in precisely capturing phenotypic information, the data processing approach for individual maize plants, as compared to an entire maize community, will better restore the maize's original growth patterns. This will enable the acquisition of more accurate maize plant height information and more clearly demonstrate the potential of solid-state LiDAR in capturing detailed phenotypic information. To enhance the universality of the research findings, this study meticulously selected key growth stages of maize for data validation and comparison, encompassing the tasseling, silking, and maturity phases. At these crucial stages, 20 maize plants at the tasseling stage, 40 at the flowering stage, and 40 at the maturity stage were randomly selected, totaling 100 samples for analysis. Each sample not only included actual measurement values but also included plant height information extracted using point cloud technology. The observation period was set from 20 June to 20 September 2021. This period encompasses the three key growth stages of maize described above, and each growth stage included one round of data collection, with three rounds of data collection each, each spaced about a week apart, for a total of nine data collections. To ensure the accuracy and reliability of the data, all collections were performed at noon when the natural wind speed was controlled within the range of 0 to 1.5 m/s and the weather was clear. The findings demonstrate that the root mean square error (RMSE) of the maize plant height data, procured through LiDAR technology, stands at 1.27 cm, the mean absolute percentage error (MAPE) hovers around 0.77%, and the peak R2 value attained is 0.99. These metrics collectively attest to the method's ongoing high efficiency and precision in capturing the plant height information. In the comparative study of different stem growth stages, especially at the maturity stage, the MAPE of the plant height was reduced to 0.57%, which is a significant improvement compared to the performance at the nodulation and sprouting stage. These results effectively demonstrate that the maize phenotypic information extraction method based on solid-state LiDAR technology is not only highly accurate and effective but is also effective on individual plants, which provides a reliable reference for applying the technique to a wider range of plant populations and extending it to the whole farmland. [ABSTRACT FROM AUTHOR]

A research work was undergone in a virtual bone reduction process for reconstruction of the comminuted pelvic bone fracture using a CT scan dataset of patients. This includes segmentation, 3D model optimization and bone registration technique. The accuracy of the reconstructed bone model was validated using Finite Element Method. Analysed and applied various segmentation techniques to segregate the injured bone structure. The ICP (Iterative Closest Point), Procrustes algorithm and Canny edge detection algorithm were applied to understand the bone registration process for surgery in detail. The average RMS error, mean absolute distance, mean absolute deviation, and mean signed distance of the reconstructed bone model using proposed algorithms involving 10 patient datasets in a group were found to be 1.77, 1.48, 1.51 and −0.31 mm respectively. The calculated RMS error value proved minimal error in semi-automatic registration than other existing automatic registration techniques. Therefore, the proposed approach is suitable for virtual bone reduction for comminuted pelvic bone fracture. This method could also be implemented for various other bone fracture reconstruction requirements. [ABSTRACT FROM AUTHOR]

This paper presents open-source software for large-scale 3D mapping using an open-hardware hand-held measurement device. This work is dedicated to educational and research purposes. This software is composed of three components: LIDAR odometry, single-session refinement and multi-session refinement. Data refinement uses a pose-graph loop closure technique and an Iterative Closest Point algorithm to minimize the error of the edge. The results are 3D point clouds in LAZ data format (compressed LAS - LIDAR Aerial Survey). It was tested in many real-world scenarios/applications: city-level 3D mapping, culture heritage, creating ground truth data for mobile robots, precise forestry, and large-scale indoor 3D mapping. This software can run on Linux and Windows machines, it does not incorporate GPU computing. It is advised to use at least 32 GB of RAM to cope with large data sets. The optimization framework is implemented from scratch using the Eigen library, thus there is not need to install any additional libraries such as Ceres, g2o, GTSAM, manif, Sophus etc.

Keypoint detection plays a pivotal role in three-dimensional computer vision, with widespread applications in improving registration precision and efficiency. However, current keypoint detection methods often suffer from poor robustness and low discriminability. In this study, a novel keypoint detection approach based on the local variation of surface (LVS) is proposed. The LVS keypoint detection method comprises three main steps. Firstly, the surface variation index for each point is calculated using the local coordinate system. Subsequently, points with a surface variation index lower than the local average are identified as initial keypoints. Lastly, the final keypoints are determined by selecting the minimum value within the neighborhood from the initial keypoints. Additionally, a sampling consensus correspondence estimation algorithm based on geometric constraints (SAC-GC) for efficient and robust estimation of optimal transformations in correspondences is proposed. By combining LVS and SAC-GC, we propose a coarse-to-fine point cloud registration algorithm. Experimental results on four public datasets demonstrate that the LVS keypoint detection algorithm offers improved repeatability and robustness, particularly when dealing with noisy, occluded, or cluttered point clouds. The proposed coarse-to-fine point cloud registration algorithm also exhibits enhanced robustness and computational efficiency. [ABSTRACT FROM AUTHOR]

Nonrigid registration presents a significant challenge in the domain of point cloud processing. The general objective is to model complex nonrigid deformations between two or more overlapping point clouds. Applications are diverse and span multiple research fields, including registration of topographic data, scene flow estimation, and dynamic shape reconstruction. To provide context, the first part of the paper gives a general introduction to the topic of point cloud registration, including a categorization of existing methods. Then, a general mathematical formulation for the point cloud registration problem is introduced, which is then extended to address also nonrigid registration methods. A detailed discussion and categorization of existing approaches to nonrigid registration follows. In the second part of the paper, we propose a new method that uses piecewise tricubic polynomials for modeling nonrigid deformations. Our method offers several advantages over existing methods. These advantages include easy control of flexibility through a small number of intuitive tuning parameters, a closed-form optimization solution, and an efficient transformation of huge point clouds. We demonstrate our method through multiple examples that cover a broad range of applications, with a focus on remote sensing applications—namely, the registration of airborne laser scanning (ALS), mobile laser scanning (MLS), and terrestrial laser scanning (TLS) point clouds. The implementation of our algorithms is open source and can be found our public repository. [ABSTRACT FROM AUTHOR]

Background: There are many regular-shape objects in the artificial environment. It is difficult to distinguish the poses of these objects, when only geometric information is utilized. With the development of sensor technologies, we can utilize other information to solve this problem. Methods: We propose an algorithm to register point clouds by integrating color information. The key idea of the algorithm is that we jointly optimize dense term and edge term. The dense term is built similarly to iterative closest point algorithm. In order to build the edge term, we extract the edges of the images obtained by projecting the point clouds. The edge term prevents the point clouds from sliding in registration. We utilize this loosely coupled method to fuse geometric and color information. Results: The experiments demonstrate that edge image approach improves the precision and the algorithm is robust.

Plant height is regarded as a key indicator that is crucial for assessing the crop growth status and predicting yield. In this study, an advanced method based on solid-state LiDAR technology is proposed, which is specifically designed to accurately capture the phenotypic characteristics of plant height during the maize growth cycle. By segmenting the scanned point cloud of maize, detailed point cloud data of a single maize plant were successfully extracted, from which stem information was accurately measured to obtain accurate plant height information. In this study, we will concentrate on the analysis of individual maize plants. Leveraging the advantages of solid-state LiDAR technology in precisely capturing phenotypic information, the data processing approach for individual maize plants, as compared to an entire maize community, will better restore the maize’s original growth patterns. This will enable the acquisition of more accurate maize plant height information and more clearly demonstrate the potential of solid-state LiDAR in capturing detailed phenotypic information. To enhance the universality of the research findings, this study meticulously selected key growth stages of maize for data validation and comparison, encompassing the tasseling, silking, and maturity phases. At these crucial stages, 20 maize plants at the tasseling stage, 40 at the flowering stage, and 40 at the maturity stage were randomly selected, totaling 100 samples for analysis. Each sample not only included actual measurement values but also included plant height information extracted using point cloud technology. The observation period was set from 20 June to 20 September 2021. This period encompasses the three key growth stages of maize described above, and each growth stage included one round of data collection, with three rounds of data collection each, each spaced about a week apart, for a total of nine data collections. To ensure the accuracy and reliability of the data, all collections were performed at noon when the natural wind speed was controlled within the range of 0 to 1.5 m/s and the weather was clear. The findings demonstrate that the root mean square error (RMSE) of the maize plant height data, procured through LiDAR technology, stands at 1.27 cm, the mean absolute percentage error (MAPE) hovers around 0.77%, and the peak R2 value attained is 0.99. These metrics collectively attest to the method’s ongoing high efficiency and precision in capturing the plant height information. In the comparative study of different stem growth stages, especially at the maturity stage, the MAPE of the plant height was reduced to 0.57%, which is a significant improvement compared to the performance at the nodulation and sprouting stage. These results effectively demonstrate that the maize phenotypic information extraction method based on solid-state LiDAR technology is not only highly accurate and effective but is also effective on individual plants, which provides a reliable reference for applying the technique to a wider range of plant populations and extending it to the whole farmland.

The rotation accuracy of a machine tool spindle is essential for ensuring the machining precision. Due to the existence of manufacturing and assembly errors, the rotation accuracy of the spindle will be inevitably impacted and degraded. Therefore, to reduce the influence of the errors and improve the work performance, this paper focuses on accuracy analysis for the spindle and a novel optimization-oriented skin model shape method to tackle this highly complex problem. First, a structural analysis of the spindle is carried out to elaborate the intractable full parallel collections in the assembly. Then, based on the iterative closest point method, the deviation propagation of the spindle considering complex full parallel collections is transformed into an optimization problem, in which the skin model shapes and small displacement torsor are utilized to represent the form and pose errors of the part, respectively. By solving the optimization problem, assembly accuracy analysis for the spindle in terms of full parallel connections and form errors is accordingly achieved. On this basis, the tolerance analysis model of the spindle is also comprehensively established by employing the corresponding error simulation. Finally, measurement experiments are conducted to validate the effectiveness of the proposed method. The experiments show the predicted rotation runout and tolerance magnitude are close to the testing results, therefore indicating the proposed method can provide effective accuracy analysis for spindles. [ABSTRACT FROM AUTHOR]

Reconstructing a three-dimensional (3D) environment is an indispensable technique to make augmented reality and augmented virtuality feasible. A Kinect device is an efficient tool for reconstructing 3D environments, and using multiple Kinect devices enables the enhancement of reconstruction density and expansion of virtual spaces. To employ multiple devices simultaneously, Kinect devices need to be calibrated with respect to each other. There are several schemes available that calibrate 3D images generated from multiple Kinect devices, including the marker detection method. In this study, we introduce a markerless calibration technique for Azure Kinect devices that avoids the drawbacks of marker detection, which directly affects calibration accuracy; it offers superior user friendliness, efficiency, and accuracy. Further, we applied a joint tracking algorithm to approximate the calibration. Traditional methods require the information of multiple joints for calibration; however, Azure Kinect, the latest version of Kinect, requires the information of only one joint. The obtained result was further refined using the iterative closest point algorithm. We conducted several experimental tests that confirmed the enhanced efficiency and accuracy of the proposed method for multiple Kinect devices when compared to the conventional marker-based calibration. [ABSTRACT FROM AUTHOR]

The Iterative Closest Point (ICP) is a matching technique used to determine the transformation matrix that best minimizes the distance between two point clouds. Although mostly used for 2D and 3D surface reconstruction, this technique is also widely used for mobile robot self-localization by means of matching partial information provided by an onboard LIDAR scanner with a known map of the facility. Once the estimated position of the robot is obtained, the scans gathered by the LIDAR can be analyzed to locate possible obstacles obstructing the planned trajectory of the mobile robot. This work proposes to speed up the obstacle detection process by directly monitoring outliers (discrepant points between the LIDAR scans and the full map) spotted after ICP matching instead of spending time performing an isolated task to re-analyze the LIDAR scans to detect those discrepancies. In this work, a computationally optimized ICP implementation has been adapted to return the list of outliers along with other matching metrics, computed in an optimal way by taking advantage of the parameters already calculated in order to perform the ICP matching. The evaluation of this adapted ICP implementation in a real mobile robot application has shown that the time required to perform self-localization and obstacle detection has been reduced by 36.7% when obstacle detection is performed simultaneously with the ICP matching instead of implementing a redundant procedure for obstacle detection. The adapted ICP implementation is provided in the SLAMICP library. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel affine iterative closest point algorithm based on color information and correntropy, which can effectively deal with the registration problems with a large number of noise and outliers and small deformations in RGB-D datasets. Firstly, to alleviate the problem of low registration accuracy for data with weak geometric structures, we consider introducing color features into traditional affine algorithms to establish more accurate and reliable correspondences. Secondly, we introduce the correntropy measurement to overcome the influence of a large amount of noise and outliers in the RGB-D datasets, thereby further improving the registration accuracy. Experimental results demonstrate that the proposed registration algorithm has higher registration accuracy, with error reduction of almost 10 times, and achieves more stable robustness than other advanced algorithms. [ABSTRACT FROM AUTHOR]

As an important technology in 3D vision, point-cloud registration has broad development prospects in the fields of space-based remote sensing, photogrammetry, robotics, and so on. Of the available algorithms, the Iterative Closest Point (ICP) algorithm has been used as the classic algorithm for solving point cloud registration. However, with the point cloud data being under the influence of noise, outliers, overlapping values, and other issues, the performance of the ICP algorithm will be affected to varying degrees. This paper proposes a global structure and adaptive weight aware ICP algorithm (GSAW-ICP) for image registration. Specifically, we first proposed a global structure mathematical model based on the reconstruction of local surfaces using both the rotation of normal vectors and the change in curvature, so as to better describe the deformation of the object. The model was optimized for the convergence strategy, so that it had a wider convergence domain and a better convergence effect than either of the original point-to-point or point-to-point constrained models. Secondly, for outliers and overlapping values, the GSAW-ICP algorithm was able to assign appropriate weights, so as to optimize both the noise and outlier interference of the overall system. Our proposed algorithm was extensively tested on noisy, anomalous, and real datasets, and the proposed method was proven to have a better performance than other state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

One of the fundamental problems of robotics and navigation is the estimation of the relative pose of an external object with respect to the observer. A common method for computing the relative pose is the iterative closest point (ICP) algorithm, where a reference point cloud of a known object is registered against a sensed point cloud to determine relative pose. To use this computed pose information in downstream processing algorithms, it is necessary to estimate the uncertainty of the ICP output, typically represented as a covariance matrix. In this paper, a novel method for estimating uncertainty from sensed data is introduced. [ABSTRACT FROM AUTHOR]

As an important component of Autonomous Driving（AD） system, High-Definition Map（HDM） can provide highly accurate prior data of lane lines and road auxiliary facilities for AD system. The reliable evaluation of HDM accuracy is extremely necessary, but has been troubled by the evaluation methods used in mapping. Here, a method based on point set alignment and resampling is proposed to evaluate the relative accuracy of lane lines, and experiments are conducted based on relevant HDM data. First, the points on the verification curve are fitted and sampled, and the aligned point pairs are registered and then resampled, based on which the relative accuracy is calculated. The results showed that the relative limit errors of all the 4 groups of lane lines were verified to be less than 20 cm, meeting the relative accuracy requirements, of which the first group has the relative limit error of 15.9 cm. It can be concluded that the proposed method is more accurate and reliable in accuracy evaluation of HDM than traditional methods. [ABSTRACT FROM AUTHOR]

Changes in object morphology can be quantified using 3D optical scanning to generate 3D models of an object at different time points. This process requires registration techniques that align target and reference 3D models using mapping functions based on common object features that are unaltered over time. The goal of this study was to determine guidelines when selecting these localized features to ensure robust and accurate 3D model registration. For this study, an object of interest (tibia bone replica) was 3D scanned at multiple time points, and the acquired 3D models were aligned using a simple cubic registration block attached to the object. The size of the registration block and the number of planar block surfaces selected to calculate the mapping functions used for 3D model registration were varied. Registration error was then calculated as the average linear surface variation between the target and reference tibial plateau surfaces. We obtained very low target registration errors when selecting block features with an area equivalent to at least 4% of the scanning field of view. Additionally, we found that at least two orthogonal surfaces should be selected to minimize registration error. Therefore, when registering 3D models to measure multi-temporal morphological change (e.g., mechanical wear), we recommend selecting multiplanar features that account for at least 4% of the scanning field of view. For the first time, this study has provided guidelines for selecting localized object features that can provide accurate 3D model registration for 3D scanned objects. [ABSTRACT FROM AUTHOR]

Nonrigid registration presents a significant challenge in the domain of point cloud processing. The general objective is to model complex nonrigid deformations between two or more overlapping point clouds. Applications are diverse and span multiple research fields, including registration of topographic data, scene flow estimation, and dynamic shape reconstruction. To provide context, the first part of the paper gives a general introduction to the topic of point cloud registration, including a categorization of existing methods. Then, a general mathematical formulation for the point cloud registration problem is introduced, which is then extended to address also nonrigid registration methods. A detailed discussion and categorization of existing approaches to nonrigid registration follows. In the second part of the paper, we propose a new method that uses piecewise tricubic polynomials for modeling nonrigid deformations. Our method offers several advantages over existing methods. These advantages include easy control of flexibility through a small number of intuitive tuning parameters, a closed-form optimization solution, and an efficient transformation of huge point clouds. We demonstrate our method through multiple examples that cover a broad range of applications, with a focus on remote sensing applications—namely, the registration of airborne laser scanning (ALS), mobile laser scanning (MLS), and terrestrial laser scanning (TLS) point clouds. The implementation of our algorithms is open source and can be found our public repository.

The steep gradient of artificial slopes on forest roads reduces the natural survival rate of vegetation. Uncovered vegetation slopes are exposed, resulting in soil displacement including soil erosion and sedimentation. Therefore, it is necessary to establish an optimized slope management plan with high accuracy for quantifying or detecting the erosion and deposition of artificial slopes. In this context, we investigated the possibility of using a terrestrial laser scanning system (TLS) to estimate soil displacement activity on a cut slope on a forest road. The soil displacement was estimated using time series point cloud data captured by a TLS. The differences among the captured point cloud data were calculated using a digital evaluation model of difference methodology. To validate the performance of the TLS for soil displacement estimation, 10 soil displacement markers were installed in a cut slope. The study revealed that the TLS detected the differences in soil erosion and deposition activity on an area of a steep slope. The differences in soil erosion and the depth of soil sediment were estimated to be 1.36 and 0.3 cm, respectively. The results of this research indicate the feasibility of using a TLS to investigate the surface displacement on a slope area, despite the errors of the estimated erosion and deposition. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Mine Automation is the property of Industry & Mine Automation Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Chinese Journal of Liquid Crystal & Displays is the property of Chinese Journal of Liquid Crystal & Displays and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Object restoration is applied in multitudinous fields. It is common that the models that need to be restored have extrinsic reflective symmetry features (ERSF), the detections of which are often applied to their restorations. However, most of these symmetry detection approaches have limitations, especially for the incompletion models with a greater area of missing part and much more complex and obvious features. Therefore, this research proposes a novel object restoration method (ORM-ERSPD) based on extrinsic reflective symmetry plane (ERSP) detection, which can be divided into two steps: extrinsic reflective symmetry plane detection (ERSPD) and object restoration (OR). During ERSPD, the reflected mesh can be computed based on an initial ERSP and aligned to the selected mesh by applying the iterative closest point algorithm. Thus, the reflective middle point set can be obtained between the selected mesh and the aligned reflected mesh to fit for the final ERSP. In OR, the selected mesh is first mirrored, aligned and deformed to the missing part whose boundary is reflected on the complete part for selecting and expanding the mesh. Then, the Boolean operation between the reflected mesh and the input mesh is conducted. Finally, the proposed ORM-ERSPD is applied to a set of incompletion models with global and local ERSF. The results of this research demonstrate that ORM-ERSPD can extract ERSP effectively and robustly and, thus, complete OR successfully. [ABSTRACT FROM AUTHOR]

Copyright of Experimental Technology & Management is the property of Experimental Technology & Management Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The working precision of mobile robots in coal mines seriously depends on the accuracy of simultaneous localization and mapping (SLAM) technology. There are some problems such as feature missing and poor lighting conditions in long and straight underground roadway. The problems lead to the failure of the laser odometer and visual odometer. The result limits the effective application of traditional SLAM method in coal mine roadway. At present, the research of the SLAM method mainly focuses on the multi-sensor fusion mapping method. There is a lack of research on the improvement of the mapping precision of the laser SLAM method. In order to solve the above problems, facing the mapping requirements of mobile robot in coal mine roadway, a 3D map construction method of coal mine roadway mobile robot based on integrated factor graph optimization is proposed. The method adopts the strategy of front-end construction and back-end optimization. The method designs a front-end point cloud registration module and a back-end construction method based on filtering and graph optimization. Therefore, the mapping result is more accurate and adaptable. The environmental degradation in coal mine long and straight roadway leads to the low registration precision of 3D laser point cloud. In order to solve the above problem, integrating iterative closest point (ICP) and normal-distributions transform (NDT) algorithms, taking into account the geometric characteristics and probability distribution characteristics of point clouds, an integrated front-end point cloud registration module is designed, which realizes the accurate registration of point clouds. Inview of the back-end optimization problem of 3D laser SLAM, the back-end construction method based on pose map and factor map optimization is studied. The factor map optimization model integrating ICP and NDT relative pose factors is constructed to accurately estimate the pose of the mobile robot. The performance of the proposed method of 3D map construction under different working conditions is verified by using the open dataset KITTI and the simulated roadway point cloud dataset. The experimental results on the open dataset KITTI show the following points. In terms of global consistency, this method has similar performance with the traditional A-LOAM method based on feature point matching and the LeGO-LOAM method based on plane segmentation and feature point extraction. It is superior to the other two methods in the local precision of mapping. The experimental results on the simulated roadway point cloud dataset show the following points. This method has significant advantages, through factor map optimization, a 3D map with high consistency can be obtained. The precision and robustness of 3D map construction of coal mine roadway are improved. The problems of the feature point missing and laser odometer failure in long straight underground roadway are solved.

The Iterative Closest Point (ICP) is a matching technique used to determine the transformation matrix that best minimizes the distance between two point clouds. Although mostly used for 2D and 3D surface reconstruction, this technique is also widely used for mobile robot self-localization by means of matching partial information provided by an onboard LIDAR scanner with a known map of the facility. Once the estimated position of the robot is obtained, the scans gathered by the LIDAR can be analyzed to locate possible obstacles obstructing the planned trajectory of the mobile robot. This work proposes to speed up the obstacle detection process by directly monitoring outliers (discrepant points between the LIDAR scans and the full map) spotted after ICP matching instead of spending time performing an isolated task to re-analyze the LIDAR scans to detect those discrepancies. In this work, a computationally optimized ICP implementation has been adapted to return the list of outliers along with other matching metrics, computed in an optimal way by taking advantage of the parameters already calculated in order to perform the ICP matching. The evaluation of this adapted ICP implementation in a real mobile robot application has shown that the time required to perform self-localization and obstacle detection has been reduced by 36.7% when obstacle detection is performed simultaneously with the ICP matching instead of implementing a redundant procedure for obstacle detection. The adapted ICP implementation is provided in the SLAMICP library.

The Iterative Closest Point (ICP) algorithm is one of the most important methods for rigid registration between point sets. However, its performance begins to degenerate with the point data are overly contaminated by noise, outliers, and missing data. In this paper, we propose an adaptive weighted robust ICP method (AW-RICP). A sparse weight vector can be automatically learned by adaptive neighbors assigning process. The sparseness of the weight vector can be achieved by fitting the number of selected samples. The adaptive weight vector leads to the robustness of AW-RICP by eliminating the negative effect caused by point cloud pairs with largest registration errors. Further, the retained point pairs are assigned suitable weights to suppress the noises and outliers. The new error metric can effectively improve the robustness of ICP method. Additionally, we propose an efficient iterative solution to optimize our problem. Experiments on both synthetic and real data sets show that the proposed method can achieve superior performance with other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

The point clouds registration is a key step in data processing for the 3D laser scanner to obtain complete information of the object surface, and there are many algorithms. In order to overcome the disadvantages of slow calculation speed and low accuracy of existing point clouds registration algorithms, a fast point clouds registration algorithm based on the improved voxel filter and ISS-USC feature is proposed. Firstly, the improved voxel filter is used for down-sampling to reduce the size of the original point clouds data. Secondly, the intrinsic shape signature (ISS) feature point detection algorithm is used to extra feature points from the down-sampled point clouds data, and then the unique shape context (USC) descriptor is calculated to describe the extracted feature points. Next, the improved random sampling consensus (RANSAC) algorithm is used for coarse registration to obtain the initial position. Finally, the iterative closest point (ICP) algorithm based on KD tree is used for fine registration, which realizes the transform from the point clouds scanned by the 3D laser scanner at different angles to the same coordinate system. Through comparing with other algorithms and the registration experiment of the VGA connector for monitor, the experimental results verify the effectiveness and feasibility of the proposed algorithm, and it has fastest registration speed while maintaining high registration accuracy. [ABSTRACT FROM AUTHOR]

Treatment of facial palsy is essential because neglecting this disorder can lead to serious sequelae and further damage. For an objective evaluation and consistent rehabilitation training program of facial palsy patients, a clinician's evaluation must be simultaneously performed alongside quantitative evaluation. Recent research has evaluated facial palsy using 68 facial landmarks as features. However, facial palsy has numerous features, whereas existing studies use relatively few landmarks; moreover, they do not confirm the degree of improvement in the patient. In addition, as the face of a normal person is not perfectly symmetrical, it must be compared with previous images taken at a different time. Therefore, we introduce three methods to numerically approach measuring the degree of facial palsy after extracting 478 3D facial landmarks from 2D RGB images taken at different times. The proposed numerical approach performs registration to compare the same facial palsy patients at different times. We scale landmarks by performing scale matching before global registration. After scale matching, coarse registration is performed with global registration. Point-to-plane ICP is performed using the transformation matrix obtained from global registration as the initial matrix. After registration, the distance symmetry, angular symmetry, and amount of landmark movement are calculated for the left and right sides of the face. The degree of facial palsy at a certain point in time can be approached numerically and can be compared with the degree of palsy at other times. For the same facial expressions, the degree of facial palsy at different times can be measured through distance and angle symmetry. For different facial expressions, the simultaneous degree of facial palsy in the left and right sides can be compared through the amount of landmark movement. Through experiments, the proposed method was tested using the facial palsy patient database at different times. The experiments involved clinicians and confirmed that using the proposed numerical approach can help assess the progression of facial palsy. [ABSTRACT FROM AUTHOR]

This paper proposes MpIC, an on-manifold derivation of the probabilistic Iterative Correspondence (pIC) algorithm, which is a stochastic version of the original Iterative Closest Point. It is developed in the context of autonomous underwater karst exploration based on acoustic sonars. First, a derivation of pIC based on the Lie group structure of S E (3) is developed. The closed-form expression of the covariance modeling the estimated rigid transformation is also provided. In a second part, its application to 3D scan matching between acoustic sonar measurements is proposed. It is a prolongation of previous work on elevation angle estimation from wide-beam acoustic sonar. While the pIC approach proposed is intended to be a key component in a Simultaneous Localization and Mapping framework, this paper focuses on assessing its viability on a unitary basis. As ground truth data in karst aquifer are difficult to obtain, quantitative experiments are carried out on a simulated karst environment and show improvement compared to previous state-of-the-art approach. The algorithm is also evaluated on a real underwater cave dataset demonstrating its practical applicability. [ABSTRACT FROM AUTHOR]

Accurate localization of a robot in a known environment is a fundamental capability for successfully performing path planning, manipulation, and grasping tasks. Particle filters, also known as Monte Carlo localization (MCL), are a commonly used method to determine the robot's pose within its environment. For ground robots, noisy wheel odometry readings are typically used as a motion model to predict the vehicle's location. Such a motion model requires tuning of various parameters based on terrain and robot type. However, such an ego-motion estimation is not always available for all platforms. Scan matching using the iterative closest point (ICP) algorithm is a popular alternative approach, providing ego-motion estimates for localization. Iterative closest point computes a point estimate of the transformation between two poses given point clouds captured at these locations. Being a point estimate method, ICP does not deal with the uncertainties in the scan alignment process, which may arise due to sensor noise, partial overlap, or the existence of multiple solutions. Another challenge for ICP is the high computational cost required to align two large point clouds, limiting its applicability to less dynamic problems. In this paper, we address these challenges by leveraging recent advances in probabilistic inference. Specifically, we first address the run-time issue and propose SGD-ICP, which employs stochastic gradient descent (SGD) to solve the optimization problem of ICP. Next, we leverage SGD-ICP to obtain a distribution over transformations and propose a Markov Chain Monte Carlo method using stochastic gradient Langevin dynamics (SGLD) updates. Our ICP variant, termed Bayesian-ICP, is a full Bayesian solution to the problem. To demonstrate the benefits of Bayesian-ICP for mobile robotic applications, we propose an adaptive motion model employing Bayesian-ICP to produce proposal distributions for Monte Carlo Localization. Experiments using both Kinect and 3D LiDAR data show that our proposed SGD-ICP method achieves the same solution quality as standard ICP while being significantly more efficient. We then demonstrate empirically that Bayesian-ICP can produce accurate distributions over pose transformations and is fast enough for online applications. Finally, using Bayesian-ICP as a motion model alleviates the need to tune the motion model parameters from odometry, resulting in better-calibrated localization uncertainty. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel affine iterative closest point algorithm based on color information and correntropy, which can effectively deal with the registration problems with a large number of noise and outliers and small deformations in RGB-D datasets. Firstly, to alleviate the problem of low registration accuracy for data with weak geometric structures, we consider introducing color features into traditional affine algorithms to establish more accurate and reliable correspondences. Secondly, we introduce the correntropy measurement to overcome the influence of a large amount of noise and outliers in the RGB-D datasets, thereby further improving the registration accuracy. Experimental results demonstrate that the proposed registration algorithm has higher registration accuracy, with error reduction of almost 10 times, and achieves more stable robustness than other advanced algorithms.

As an important technology in 3D vision, point-cloud registration has broad development prospects in the fields of space-based remote sensing, photogrammetry, robotics, and so on. Of the available algorithms, the Iterative Closest Point (ICP) algorithm has been used as the classic algorithm for solving point cloud registration. However, with the point cloud data being under the influence of noise, outliers, overlapping values, and other issues, the performance of the ICP algorithm will be affected to varying degrees. This paper proposes a global structure and adaptive weight aware ICP algorithm (GSAW-ICP) for image registration. Specifically, we first proposed a global structure mathematical model based on the reconstruction of local surfaces using both the rotation of normal vectors and the change in curvature, so as to better describe the deformation of the object. The model was optimized for the convergence strategy, so that it had a wider convergence domain and a better convergence effect than either of the original point-to-point or point-to-point constrained models. Secondly, for outliers and overlapping values, the GSAW-ICP algorithm was able to assign appropriate weights, so as to optimize both the noise and outlier interference of the overall system. Our proposed algorithm was extensively tested on noisy, anomalous, and real datasets, and the proposed method was proven to have a better performance than other state-of-the-art algorithms.

Robotic inspection of complex geometry components using immersion ultrasonic techniques is relevant for many ultrasonic Non-Destructive Testing (NDT) applications in different industries. To image large component, ultrasonic probe is manipulated around the component immersed in water using a robotic guided system to create a tiled image of the entire component. Due to the mechanical vibrations of the high-speed robotic arm, the probe position coordinates provided by the robotic system are not precise enough to ensure an accurate reconstruction (stitching) of a composite image from all individual images. In this work, we propose a stitching method specifically designed to create a single 2D image of the surface of an inspected component from a stack of Total Focusing Method (TFM) images. This stitching method uses Iterative Closest Point (ICP) registration to estimate a 2D rigid transformation between two consecutive 2D images, by maximizing the overlap between the surface geometries extracted from each image. The capabilities of this imaging technique are illustrated by various simulated and experimental results carried out in a water tank. Significant improvements in surface image quality, leading to accurate surface reconstruction, are shown for vertical vibrations with displacements of more than two operating wavelengths and for rotational vibrations with deviation angles of less than 1°. The results also show that the resolving power of the ICP algorithm decreases for strong rotational vibrations. [ABSTRACT FROM AUTHOR]

Background: Although the surface registration technique has the advantage of being relatively safe and the operation time is short, it generally has the disadvantage of low accuracy. Purpose: This research proposes automated machine learning (AutoML)‐based surface registration to improve the accuracy of image‐guided surgical navigation systems. Methods: The state‐of‐the‐art surface registration concept is that first, using a neural network model, a new point‐cloud that matches the facial information acquired by a passive probe of an optical tracking system (OTS) is extracted from the facial information obtained by computerized tomography. Target registration error (TRE) representing the accuracy of surface registration is then calculated by applying the iterative closest point (ICP) algorithm to the newly extracted point‐cloud and OTS information. In this process, the hyperparameters used in the neural network model and ICP algorithm are automatically optimized using Bayesian optimization with expected improvement to yield improved registration accuracy. Results: Using the proposed surface registration methodology, the average TRE for the targets located in the sinus space and nasal cavity of the soft phantoms is 0.939 ± 0.375 mm, which shows 57.8% improvement compared to the average TRE of 2.227 ± 0.193 mm calculated by the conventional surface registration method (p < 0.01). The performance of the proposed methodology is evaluated, and the average TREs computed by the proposed methodology and the conventional method are 0.767 ± 0.132 and 2.615 ± 0.378 mm, respectively. Additionally, for one healthy adult, the clinical applicability of the AutoML‐based surface registration is also presented. Conclusion: Our findings showed that the registration accuracy could be improved while maintaining the advantages of the surface registration technique. [ABSTRACT FROM AUTHOR]

We discuss the shape estimation of moving target objects using distributed ranging sensors. Due to the inability to carefully design sensor locations or assign global positioning systems (GPS) to inexpensive sensors, it is often necessary to assume that the sensor locations and target object locations are unknown. Although methods have been developed that can be applied in such situations, the sensing results are assumed to include no noise and cannot be applied to practical situations in which sensing noise exists. We propose a method of estimating the whole shape of a moving target object in the presence of sensing noise. Our method analyzes continuous reports on the measured distance of a target object from distributed sensors and determines the sensing directions of sensors using a novel algorithm, which we developed inspired by the iterative closest point (ICP) algorithm. On the basis of the obtained sensing directions, the whole shape of the object can be estimated. We conducted extensive numerical simulations and an experiment using actual laser sensors to demonstrate the effectiveness and feasibility of our method. [ABSTRACT FROM AUTHOR]

Although researchers have investigated a variety of approaches to the development of three-dimensional (3D) point cloud matching algorithms, the results have been limited by low accuracy and slow speed when registering large numbers of point cloud data. To address this problem, a new fast point cloud registration algorithm based on a 3D neighborhood point feature histogram (3DNPFH) descriptor is proposed for fast point cloud registration. With a 3DNPFH, the 3D key-point locations are first transformed into a new 3D coordinate system, and the key points generated from similar 3D surfaces are then close to each other in the newly generated space. Subsequently, a neighborhood point feature histogram (NPFH) was designed to encode neighborhood information by combining the normal vectors, curvature, and distance features of a point cloud, thus forming a 3DNPFH (3D + NPFH). The descriptor searches radially for 3D key point locations in the new 3D coordinate system, reducing the search coordinate system for the corresponding point pairs. The "NPFH" descriptor is then coarsely aligned using the random sample consensus (RANSAC) algorithm. Experiment results show that the algorithm is fast and maintains high alignment accuracy on several popular benchmark datasets, as well as our own data. [ABSTRACT FROM AUTHOR]

Camera pose estimation is crucial for 3D surface reconstruction and augmented reality applications. For systems equipped with RGB-D sensors, the corresponding transformation between frames can be effectively estimated using the iterative closest point (ICP) algorithms. Edge points, which cover most of the geometric structures in a frame, are good candidates for control points in ICP. However, the depth of object contour points is hard to accurately measure using commercial RGB-D sensors. Inspired by the model-agnostic meta-learning (MAML) algorithm, this work proposes a meta-ICP algorithm to jointly estimate the optimal transformation for multiple tasks, which are constructed by sampled datapoints. To increase task sampling efficiency, an edge-based task set partition algorithm is introduced for constructing complementary task sets. Moreover, to prevent ICP from being trapped in local minima, a dynamic model adaptation scheme is adopted to disturb the trapped tasks. Experimental results reveal that the probability of unstable estimations can be effectively reduced, indicating a much narrower error distribution of repeated experiments when adopting re-sampled points. With the proposed scheme, the overall absolute trajectory error can be improved by more than 30% as compared to the related edge-based methods using frame-to-frame pose estimation.

In 3D reconstruction applications, an important issue is the matching of point clouds corresponding to different perspectives of a particular object or scene, which is addressed by the use of variants of the Iterative Closest Point (ICP) algorithm. In this work, we introduce a cloud-partitioning strategy for improved registration and compare it to other relevant approaches by using both time and quality of pose correction. Quality is assessed from a rotation metric and also by the root mean square error (RMSE) computed over the points of the source cloud and the corresponding closest ones in the corrected target point cloud. A wide and plural set of experimentation scenarios was used to test the algorithm and assess its generalization, revealing that our cloud-partitioning approach can provide a very good match in both indoor and outdoor scenes, even when the data suffer from noisy measurements or when the data size of the source and target models differ significantly. Furthermore, in most of the scenarios analyzed, registration with the proposed technique was achieved in shorter time than those from the literature. [ABSTRACT FROM AUTHOR]

In the world, there is a growing need for lower limb prostheses due to a rising number of amputations caused primarily, by diabetic foot. Researchers enable functional and comfortable prostheses through prosthetic design by integrating new technologies applied to the traditional handcrafted method for prosthesis fabrication that is still current. That is why computer vision shows to be a promising tool for the integration of 3D reconstruction that may be useful for prosthetic design. This work has the objective to design, prototype, and test a functional system to scan plaster cast molds, which may serve as a platform for future technologies for lower limb reconstruction applications. The image capture system comprises 5 stereoscopic color and depth cameras, each with 4 DOF mountings on an enveloping frame, as well as algorithms for calibration, segmentation, registration, and surface reconstruction. The segmentation metrics of dice coefficient and Hausdorff distance (HD) show strong visual similarity with an average similarity of 87% and average error of 6.40 mm, respectively. Moving forward, the system was tested on a known 3D printed model obtained from a computer tomography scan to which comparison results via HD show an average error of ≤1.93 mm thereby making the system competitive against the systems reviewed from the state-of-the-art. [ABSTRACT FROM AUTHOR]