Among the noncompact matrix Lie groups, the special Euclidean group and the unipotent matrix group play important roles in both theoretic and applied studies. The Riemannian means of a finite set of the given points on the two matrix groups are investigated, respectively. Based on the left invariant metric on the matrix Lie groups, the geodesic between any two points is gotten. And the sum of the geodesic distances is taken as the cost function, whose minimizer is the Riemannian mean. Moreover, a Riemannian gradient algorithm for computing the Riemannian mean on the special Euclidean group and an iterative formula for that on the unipotent matrix group are proposed, respectively. Finally, several numerical simulations in the 3‐dimensional case are given to illustrate our results.
1 June 2013 in Applied Mathematics and Computation
A Riemannian gradient algorithm based on geometric structures of a manifold consisting of all positive definite matrices is proposed to calculate the numerical solution of the linear matrix equation. In this algorithm, the geodesic distance on the curved Riemannian manifold is taken as an objective function and the geodesic curve is treated as the convergence path. Also the optimal variable step sizes corresponding to the minimum value of the objective function are provided in order to improve the convergence speed. Furthermore, the convergence speed of the Riemannian gradient algorithm is compared with that of the traditional conjugate gradient method in two simulation examples. It is found that the convergence speed of the provided algorithm is faster than that of the conjugate gradient method.
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.
A non-iterative method for the difference of means is presented to calculate the log-Euclidean distance between a symmetric positive-definite matrix and the mean matrix on the Lie group of symmetric positive-definite matrices. Although affine-invariant Riemannian metrics have a perfect theoretical framework and avoid the drawbacks of the Euclidean inner product, their complex formulas also lead to sophisticated and time-consuming algorithms. To make up for this limitation, log-Euclidean metrics with simpler formulas and faster calculations are employed in this manuscript. Our new approach is to transform a symmetric positive-definite matrix into a symmetric matrix via logarithmic maps, and then to transform the results back to the Lie group through exponential maps. Moreover, the present method does not need to compute the mean matrix and retains the usual Euclidean operations in the domain of matrix logarithms. In addition, for some randomly generated positive-definite matrices, the method is compared using experiments with that induced by the classical affine-invariant Riemannian metric. Finally, our proposed method is applied to denoise the point clouds with high density noise via the K-means clustering algorithm.
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.