Skeleton Extraction Algorithm Based on Partial Intrinsic Symmetry

Fangjun Yi,Renyi Zhou

2019 IEEE 4th International Conference on Signal and Image Processing (ICSIP)(2019)

Cited 0|Views3
No score
Abstract
Compared with perfect global symmetry, partial intrinsic symmetry region is more common in three-dimensional and high-dimensional data sets. In this paper, point clouds are used as input, and K-Isomap algorithm is employed to construct the graph and calculate edge weights. According to the constraint of geodesic distance and election strategies, we obtain the sets of support point pairs reflecting locally implied symmetric regions. Aiming to achieve the more precise symmetrical region represented by the sets of point pairs, Symmetrical Weighting Degree is defined based on the distances between the pair of points in the sets, and we propose two methods for calculating the Symmetrical Weighting Degree for different dimensions. Then, two algorithms for obtaining potential skeleton points are introduced in view of the set of points on the shortest path between points pair. The potential skeleton points are voted on. Finally, by filtering to obtain the points with higher votes, we connect them to form skeleton utilizing K-Nearest Neighbor algorithm. We illustrate the algorithm by applying it on three-dimensional and high-dimensional data, which verifies its outstanding performances in detailed structures preservation, local symmetry centers extraction, robustness and so on.
More
Translated text
Key words
partial intrinsic symmetry,K-nearest neighbor algorithm,symmetrical weighting degree,geodesic distance,support point pairs
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined