Skeleton Extraction Algorithm Based On Partial Insic Symmetry

Fangjun Yi,Renyi Zhou

2019 IEEE 4TH INTERNATIONAL CONFERENCE ON SIGNAL AND IMAGE PROCESSING (ICSIP 2019)(2019)

引用 0|浏览0
暂无评分
摘要
Compared with perfect global symmetry, partial intrinsic symmetry region is more common in threedimensional 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 11)r 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 highdimensional data, which verities its outstanding performances in detailed structures preservation, local symmetry centers extraction, robustness and so on.
更多
查看译文
关键词
partial intrinsic symmetry, K-nearest neighbor algorithm, symmetrical weighting degree, geodesic distance, support point pairs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要