An Efficient Mechanism for 3D Model Retrieval

Liang Ji, Gangshan Wu, Wenjun Dai
{"title":"An Efficient Mechanism for 3D Model Retrieval","authors":"Liang Ji, Gangshan Wu, Wenjun Dai","doi":"10.1109/ICAT.2006.35","DOIUrl":null,"url":null,"abstract":"Shape matching is one of the crucial problems in 3D model retrieval system. A usual approach is to exhaustively search through the database comparing each database model with the query model. This approach is inefficient especially for a large database. In this paper, an efficient mechanism for 3D model retrieval is proposed. In the preprocessing stage, a set of reference models are selected from the database using cluster analysis, and distances between database models and reference models are computed and stored. Then in the query stage, for a certain query model, searching is accelerated by reducing the large amount of model comparisons using triangle inequality based on the reference distances computed before. The proposed retrieval mechanism is implemented and experiment result shows that retrieval efficiency is greatly improved than the usual approach without any precision loss","PeriodicalId":133842,"journal":{"name":"16th International Conference on Artificial Reality and Telexistence--Workshops (ICAT'06)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"16th International Conference on Artificial Reality and Telexistence--Workshops (ICAT'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAT.2006.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Shape matching is one of the crucial problems in 3D model retrieval system. A usual approach is to exhaustively search through the database comparing each database model with the query model. This approach is inefficient especially for a large database. In this paper, an efficient mechanism for 3D model retrieval is proposed. In the preprocessing stage, a set of reference models are selected from the database using cluster analysis, and distances between database models and reference models are computed and stored. Then in the query stage, for a certain query model, searching is accelerated by reducing the large amount of model comparisons using triangle inequality based on the reference distances computed before. The proposed retrieval mechanism is implemented and experiment result shows that retrieval efficiency is greatly improved than the usual approach without any precision loss
一种有效的三维模型检索机制
形状匹配是三维模型检索系统的关键问题之一。一种常用的方法是将每个数据库模型与查询模型进行比较,穷举地搜索数据库。这种方法效率很低,特别是对于大型数据库。本文提出了一种有效的三维模型检索机制。预处理阶段通过聚类分析从数据库中选择一组参考模型,计算并存储数据库模型与参考模型之间的距离。然后在查询阶段,针对某一查询模型,基于之前计算的参考距离,利用三角不等式减少大量的模型比较,从而加快搜索速度。实验结果表明,该方法在不损失精度的前提下,检索效率大大提高
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信