最优检索问题 使用计算机,基于最优搜索理论的三维模型检索技术研究-计算机系统结构专业论文.docx...

摘要序,它可以携带自身状态和代码在网络中移动到另一环境中去,并在该环境中-恢

摘要

序,它可以携带自身状态和代码在网络中移动到另一环境中去,并在该环境中-恢 复执行。半适应性最优搜索策略利用了搜索过程中的反馈信息,因此比非适应性 最优搜索策略效率更高。

关键词:三维模型榆索、特征向量、最优搜索理论、时间资源

AbstractAbstract

Abstract

Abstract

The strucmres of 3D shapes call be easily acquired by the advanced modeling and vis由alizing techniques.This leads to an exponentially growth of 3D models in the database.To overcome the disadvantages of text·based retrieval,researchers develop a nulnber of Content Based Retrieval(CBRl systems.The main idea for content-based retrieval is tO create a set of features that can efficiently describe 3D models.We often use high-dimension feature vectors to achieve this goal,however,the large amount cBmputafion will make exhaustive retrieval infeasible.Thus it is a big challenge to find a11 efficient way to search 3D models under a limited resource.rnle search resource

uStlally refers to the time and money spent in the retrieval.

To find an eft]cient strategy for 3D model retrieval task,we refer to optimal search theory.Optimal,.search theory is a theory of finding the”best”way to detect a pre—claimed object,usually called the”target”.Pioneered by G Kimball and B.

Koopman in 1940’S,optimal search theory is developed from the statistical decision

theory in Operations Research.Now it has been widely used in military,industrial,

agriculture,criminology,market investigation,census,medical research,and SO on.We may categorize optimal search problems according to whether the space and time are discrete or continuous,and whether the target is stationary or mobile.In this thesis,we s“dy the situation with stationary target in the discrete space.

Firstly,we consider the 3D model retrieval problem under a limited time resource.

We aSsunle that the total search time was bounded and hence the retrieval task will not succeed for sure.In this case.we derive the optimal strategy wim which the task could succeed with the highest detection probability.In particular,we give the method to compute the initi

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值