• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Digital library services for three-dimensional models.
【24h】

Digital library services for three-dimensional models.

机译：三维模型的数字图书馆服务。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

With the growth in computing, storage and networking infrastructure, it is becoming increasingly feasible for multimedia professionals---such as graphic designers in commercial, manufacturing, scientific and entertainment areas---to work with 3D digital models of the objects with which they deal in their domain. Unfortunately most of these models exist in individual repositories, and are not accessible to geographically distributed professionals who are in need of them.; Building an efficient digital library system presents a number of challenges. In particular, the following issues need to be addressed: (1) What is the best way of representing 3D models in a digital library, so that the searches can be done faster? (2) How to compress and deliver the 3D models to reduce the storage and bandwidth requirements? (3) How can we represent the user's view on similarity between two objects? (4) What search types can be used to enhance the usability of the digital library and how can we implement these searches, what are the trade-offs?; In this research, we have developed a digital library architecture for 3D models that addresses the above issues as well as other technical issues. We have developed a prototype for our 3D digital library (3DLIB) that supports compressed storage, along with retrieval of 3D models. The prototype also supports search and discovery services that are targeted for 3-D models. The key to 3DLIB is a representation of a 3D model that is based on "surface signatures". This representation captures the shape information of any free-form surface and encodes it into a set of 2D images. We have developed a shape similarity search technique that uses the signature images to compare 3D models. One advantage of the proposed technique is that it works in the compressed domain, thus it eliminates the need for uncompressing in content-based search. Moreover, we have developed an efficient discovery service consisting of a multi-level hierarchical browsing service that enables users to navigate large sets of 3D models. To implement this targeted browsing (find an object that is similar to a given object in a large collection through browsing) we abstract a large set of 3D models to a small set of representative models (key models). The abstraction is based on shape similarity and uses specially tailored clustering techniques. The browsing service applies clustering recursively to limit the number of key models that a user views at any time.; We have evaluated the performance of our digital library services using the Princeton Shape Benchmark (PSB) and it shows significantly better precision and recall, as compared to other approaches.
机译：随着计算，存储和网络基础设施的增长，多媒体专业人员（例如商业，制造，科学和娱乐领域的图形设计师）使用与之相关的对象的3D数字模型变得越来越可行。处理他们的领域。不幸的是，这些模型中的大多数都存在于单独的存储库中，而需要它们的地理上分散的专业人员无法访问这些模型。建立有效的数字图书馆系统提出了许多挑战。特别是，需要解决以下问题：（1）在数字图书馆中表示3D模型的最佳方法是什么，以便可以更快地进行搜索？ （2）如何压缩和交付3D模型以减少存储和带宽需求？ （3）如何表示用户对两个对象之间相似性的看法？ （4）可以使用哪些搜索类型来增强数字图书馆的可用性，我们如何实现这些搜索，需要进行哪些取舍？在这项研究中，我们为3D模型开发了一种数字图书馆体系结构，可以解决上述问题以及其他技术问题。我们为3D数字图书馆（3DLIB）开发了一个原型，该原型支持压缩存储以及3D模型的检索。该原型还支持针对3D模型的搜索和发现服务。 3DLIB的关键是基于“表面特征”的3D模型的表示。该表示形式捕获任何自由曲面的形状信息，并将其编码为一组2D图像。我们已经开发了一种形状相似性搜索技术，该技术使用签名图像来比较3D模型。所提出的技术的一个优点是它在压缩域中工作，因此消除了在基于内容的搜索中进行解压缩的需要。此外，我们已经开发了一种高效的发现服务，该服务由多层次的分层浏览服务组成，该服务使用户能够导航大量3D模型。为了实现这种有针对性的浏览（通过浏览来查找与大集合中的给定对象相似的对象），我们将大量的3D模型抽象为少量的代表性模型（关键模型）。抽象基于形状相似性，并使用专门定制的聚类技术。浏览服务以递归方式应用群集，以限制用户随时查看的关键模型的数量。我们已经使用普林斯顿形状基准（PSB）评估了我们数字图书馆服务的性能，并且与其他方法相比，它显示出更高的精度和召回率。

著录项

  • 作者

    Anan, Hesham.;

  • 作者单位

    Old Dominion University.;

  • 授予单位 Old Dominion University.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2004
  • 页码 100 p.
  • 总页数 100
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号