A denoising algorithm was proposed for point cloud with high-density noise. The algorithm utilized geometric metrics on the statistical manifold and applied the idea of clustering K-means based on local statistical characteristics between noise and valid data. First, by calculating the expectation and covariance matrix of the data points, the point cloud with high-density noise was projected onto the Gaussian distribution family manifold, aiming to form the parameter point cloud. Afterwards, the geometry metrics were assigned to the manifold, and the K-means algorithm was applied to cluster the parameter point cloud, so as to classify the valid data and noise. Furthermore, in order to analyze the robustness of the means with different metrics, the approximate values of their influence functions were calculated, respectively. Finally, simulation analysis was conducted using the algorithm based on geometric metrics to verify the effectiveness in point cloud denoising.
1 January 2022 in Journal of Mechanical Engineering
In an automatic ultrasonic testing system constituted by an ultrasonic probe and a six-axis manipulator, the manipulator needs to run from a static state to the target velocity. To prevent equipment damage caused by sudden acceleration or deceleration, it is necessary to plan the position and pose of the end effector of the manipulator at each detected point. In this manuscript, an algorithm for planning the position and pose of the manipulator is proposed based on the information geometry structure of special orthogonal groups. As the linear operation of the orthogonal matrix corresponding to the manipulator pose is not closed, the manipulator pose at each detected point was calculated using the straightness of the Lie algebra of the special orthogonal group. The matrix information geometry algorithm enabled not only the manipulator to accelerate and decelerate uniformly along the detection trajectory, but also the angular acceleration of the end effector to accelerate uniformly at first, then keep a uniform velocity, and finally decelerate uniformly. The platform motion experiments with the Turin TKB070S six-axis manipulator are carried out to verify the effectiveness of the matrix information geometry algorithm for planning the pose of the manipulator.
A matrix information-geometric method was developed to detect the change-points of rigid body motions. Note that the set of all rigid body motions is the special Euclidean group , so the Riemannian mean based on the Lie group structures of reflects the characteristics of change-points. Once a change-point occurs, the distance between the current point and the Riemannian mean of its neighbor points should be a local maximum. A gradient descent algorithm is proposed to calculate the Riemannian mean. Using the Baker–Campbell–Hausdorff formula, the first-order approximation of the Riemannian mean is taken as the initial value of the iterative procedure. The performance of our method was evaluated by numerical examples and manipulator experiments.
Point cloud denoising is essential for improving 3D data quality, yet traditional K-means methods relying on Euclidean distance struggle with non-uniform noise. This paper proposes a K-means algorithm leveraging Total Bregman Divergence (TBD) to better model geometric structures on manifolds, enhancing robustness against noise. Specifically, TBDs—Total Logarithm, Exponential, and Inverse Divergences—are defined on symmetric positive-definite matrices, each tailored to capture distinct local geometries. Theoretical analysis demonstrates the bounded sensitivity of TBD-induced means to outliers via influence functions, while anisotropy indices quantify structural variations. Numerical experiments validate the method’s superiority over Euclidean-based approaches, showing effective noise separation and improved stability. This work bridges geometric insights with practical clustering, offering a robust framework for point cloud preprocessing in vision and robotics applications.
Point cloud denoising is essential for improving 3D data quality, yet traditional K-means methods relying on Euclidean distance struggle with non-uniform noise. This paper proposes a K-means algorithm leveraging Total Bregman Divergence (TBD) to better model geometric structures on manifolds, enhancing robustness against noise. Specifically, TBDs - Total Logarithm, Exponential, and Inverse Divergences - are defined on symmetric positive-definite matrices, each tailored to capture distinct local geometries. Theoretical analysis demonstrates the bounded sensitivity of TBD-induced means to outliers via influence functions, while anisotropy indices quantify structural variations. Numerical experiments validate the methods superiority over Euclidean-based approaches, showing effective noise separation and improved stability. The work bridges geometric insights with practical clustering, offering a robust framework for point cloud preprocessing in vision and robotics applications.