SHREC ' 08词条:使用对象分区进行三维形状搜索

A. I. Wagan, A. Godil, Xiaolan Li
{"title":"SHREC ' 08词条:使用对象分区进行三维形状搜索","authors":"A. I. Wagan, A. Godil, Xiaolan Li","doi":"10.1109/SMI.2008.4547986","DOIUrl":null,"url":null,"abstract":"In this paper we propose a novel algorithm for 3D shape searching based on the visual similarity by cutting the object into sections. This method rectifies some of the shortcomings of the visual similarity based methods, so that it can better account for concave areas of an object and parts of the object not visible because of occlusion. As the first step, silhouettes of the 3D object are generated by partitioning the object into number of parts with cutting planes perpendicular to the view direction. Then Zernike moments are applied on the silhouettes to generate shape descriptors. The distance measure is based on minimizing the distance among all the combinations of shape descriptors and then these distances are used for similarity based searching. We have performed experiments on the Princeton shape benchmark and the Purdue CAD/CAM database, and have achieved results comparable to some of the best algorithms in the 3D shape searching literature.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"275 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"SHREC’08 entry: 3D shape searching using object partitioning\",\"authors\":\"A. I. Wagan, A. Godil, Xiaolan Li\",\"doi\":\"10.1109/SMI.2008.4547986\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a novel algorithm for 3D shape searching based on the visual similarity by cutting the object into sections. This method rectifies some of the shortcomings of the visual similarity based methods, so that it can better account for concave areas of an object and parts of the object not visible because of occlusion. As the first step, silhouettes of the 3D object are generated by partitioning the object into number of parts with cutting planes perpendicular to the view direction. Then Zernike moments are applied on the silhouettes to generate shape descriptors. The distance measure is based on minimizing the distance among all the combinations of shape descriptors and then these distances are used for similarity based searching. We have performed experiments on the Princeton shape benchmark and the Purdue CAD/CAM database, and have achieved results comparable to some of the best algorithms in the 3D shape searching literature.\",\"PeriodicalId\":118774,\"journal\":{\"name\":\"2008 IEEE International Conference on Shape Modeling and Applications\",\"volume\":\"275 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE International Conference on Shape Modeling and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SMI.2008.4547986\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Shape Modeling and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMI.2008.4547986","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文提出了一种基于视觉相似性的三维形状搜索算法。该方法纠正了基于视觉相似性的方法的一些缺点,使其能够更好地解释物体的凹区域和物体因遮挡而不可见的部分。作为第一步,通过垂直于视图方向的切割平面将物体划分为若干部分来生成三维物体的轮廓。然后在轮廓上应用泽尼克矩来生成形状描述符。距离度量是基于最小化所有形状描述符组合之间的距离,然后将这些距离用于基于相似性的搜索。我们在普林斯顿形状基准和普渡CAD/CAM数据库上进行了实验,并取得了与3D形状搜索文献中一些最佳算法相当的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SHREC’08 entry: 3D shape searching using object partitioning
In this paper we propose a novel algorithm for 3D shape searching based on the visual similarity by cutting the object into sections. This method rectifies some of the shortcomings of the visual similarity based methods, so that it can better account for concave areas of an object and parts of the object not visible because of occlusion. As the first step, silhouettes of the 3D object are generated by partitioning the object into number of parts with cutting planes perpendicular to the view direction. Then Zernike moments are applied on the silhouettes to generate shape descriptors. The distance measure is based on minimizing the distance among all the combinations of shape descriptors and then these distances are used for similarity based searching. We have performed experiments on the Princeton shape benchmark and the Purdue CAD/CAM database, and have achieved results comparable to some of the best algorithms in the 3D shape searching literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信