{"title":"基于骨架树的非刚性三维形状检索","authors":"Yiran Zhu, Jiaqi Kang, Chenlei Lv, Shu Xu, Yanping Xue, Xingce Wang, Zhongke Wu","doi":"10.1145/3356422.3356436","DOIUrl":null,"url":null,"abstract":"We propose a skeleton tree based method for classifying and retrieving non-rigid shapes. Firstly, based on the extracted skeletons of a non-rigid shape and geodesic distance computation, the center point in skeleton is defined and detected. Then, a skeleton tree is constructed based on the connection between the center point and other discrete points in skeleton. After that, a correspondence between the skeleton tree and the area distribution of the non-rigid shape is established. The skeleton tree features are achieved. The advantages of our method can be summarized as follows: (1) Scale-Invariant; (2) Low computational complexity; (3) Automatic topology repair. The experimental results show that our method is more accurate than existing methods.","PeriodicalId":197051,"journal":{"name":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Skeleton Tree based Non-rigid 3D Shape Retrieval\",\"authors\":\"Yiran Zhu, Jiaqi Kang, Chenlei Lv, Shu Xu, Yanping Xue, Xingce Wang, Zhongke Wu\",\"doi\":\"10.1145/3356422.3356436\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a skeleton tree based method for classifying and retrieving non-rigid shapes. Firstly, based on the extracted skeletons of a non-rigid shape and geodesic distance computation, the center point in skeleton is defined and detected. Then, a skeleton tree is constructed based on the connection between the center point and other discrete points in skeleton. After that, a correspondence between the skeleton tree and the area distribution of the non-rigid shape is established. The skeleton tree features are achieved. The advantages of our method can be summarized as follows: (1) Scale-Invariant; (2) Low computational complexity; (3) Automatic topology repair. The experimental results show that our method is more accurate than existing methods.\",\"PeriodicalId\":197051,\"journal\":{\"name\":\"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3356422.3356436\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3356422.3356436","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We propose a skeleton tree based method for classifying and retrieving non-rigid shapes. Firstly, based on the extracted skeletons of a non-rigid shape and geodesic distance computation, the center point in skeleton is defined and detected. Then, a skeleton tree is constructed based on the connection between the center point and other discrete points in skeleton. After that, a correspondence between the skeleton tree and the area distribution of the non-rigid shape is established. The skeleton tree features are achieved. The advantages of our method can be summarized as follows: (1) Scale-Invariant; (2) Low computational complexity; (3) Automatic topology repair. The experimental results show that our method is more accurate than existing methods.