摘要序,它可以携带自身状态和代码在网络中移动到另一环境中去,并在该环境中-恢
摘要
序,它可以携带自身状态和代码在网络中移动到另一环境中去,并在该环境中-恢 复执行。半适应性最优搜索策略利用了搜索过程中的反馈信息,因此比非适应性 最优搜索策略效率更高。
关键词:三维模型榆索、特征向量、最优搜索理论、时间资源
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