首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
Research in content-based 3D retrieval has already started, and several approaches have been proposed which use in different manner a similarity assessment to match the shape of the query against the shape of the objects in the database. However, the success of these solutions are far from the success obtained by their textual counterparts. A major drawback of most existing 3D retrieval solutions is their inability to support partial queries, that is, a query which does not need to be formulated by specifying a whole query shape, but just a part of it, for example a detail of its overall shape, just like documents are retrieved by specifying words and not whole texts. Recently, researchers have focused their investigation on 3D retrieval which is solved by partial shape matching. However, at the extent of our knowledge, there is still no 3D search engine that provides an indexing of the 3D models based on all the interesting subparts of the models. In this paper we present a novel approach to 3D shape retrieval that uses a collection-aware shape decomposition combined with a shape thesaurus and inverted indexes to describe and retrieve 3D models using part-in-whole matching. The proposed method clusters similar segments obtained trough a multilevel decomposition of models, constructing from such partition the shape thesaurus. Then, to retrieve a model containing a sub-part similar to a given query, instead of looking on a large set of subparts or executing partial matching between the query and all models in the collection, we just perform a fast global matching between the query and the few entries in the thesaurus. With this technique we overcame the time complexity problems associated with partial queries in large collections.  相似文献   

3.
In this paper, we address the problem of document re-ranking in information retrieval, which is usually conducted after initial retrieval to improve rankings of relevant documents. To deal with this problem, we propose a method which automatically constructs a term resource specific to the document collection and then applies the resource to document re-ranking. The term resource includes a list of terms extracted from the documents as well as their weighting and correlations computed after initial retrieval. The term weighting based on local and global distribution ensures the re-ranking not sensitive to different choices of pseudo relevance, while the term correlation helps avoid any bias to certain specific concept embedded in queries. Experiments with NTCIR3 data show that the approach can not only improve performance of initial retrieval, but also make significant contribution to standard query expansion.  相似文献   

4.
5.
Design reuse oriented partial retrieval of CAD models   总被引:1,自引:0,他引:1  
As a huge number of 3D CAD models is generated each year, retrieval of 3D CAD models is becoming more and more important for achieving design reuse. However, the existing methods for partial retrieval of 3D CAD models are very few and far from the requirements of design reuse. In this paper, we present an approach to partial retrieval of 3D CAD models for design reuse. The criteria for determining whether a subpart of 3D CAD models is reusable for design is defined first. Based on the criteria defined, all the design reusable subparts involved in the 3D CAD models in the library are automatically extracted and stored in the library as reference models. Moreover, each design reusable subpart in the library is represented by all its local matching regions in a hierarchical way so as to support multi-mode partial retrieval. In our approach, three partial retrieval modes including normal retrieval, exact retrieval and relaxed retrieval are defined to meet various partial retrieval requirements of design reuse such as the incomplete and vague queries during the early design stage. And the multi-mode partial retrieval is achieved by performing multi-mode matching and similarity assessment between the query and the design reusable subparts in the library indexed by bitmap. Experimental results are presented to demonstrate the effectiveness of the approach.  相似文献   

6.
7.
Sketch-based 3D model retrieval is very important for applications such as 3D modeling and recognition. In this paper, a sketch-based retrieval algorithm is proposed based on a 3D model feature named View Context and 2D relative shape context matching. To enhance the accuracy of 2D sketch-3D model correspondence as well as the retrieval performance, we propose to align a 3D model with a query 2D sketch before measuring their distance. First, we efficiently select some candidate views from a set of densely sampled views of the 3D model to align the sketch and the model based on their View Context similarities. Then, we compute the more accurate relative shape context distance between the sketch and every candidate view, and regard the minimum one as the sketch-model distance. To speed up retrieval, we precompute the View Context and relative shape context features of the sample views of all the 3D models in the database. Comparative and evaluative experiments based on hand-drawn and standard line drawing sketches demonstrate the effectiveness and robustness of our approach and it significantly outperforms several latest sketch-based retrieval algorithms.  相似文献   

8.
9.
10.
A survey of content based 3D shape retrieval methods   总被引:8,自引:3,他引:5  
Recent developments in techniques for modeling, digitizing and visualizing 3D shapes has led to an explosion in the number of available 3D models on the Internet and in domain-specific databases. This has led to the development of 3D shape retrieval systems that, given a query object, retrieve similar 3D objects. For visualization, 3D shapes are often represented as a surface, in particular polygonal meshes, for example in VRML format. Often these models contain holes, intersecting polygons, are not manifold, and do not enclose a volume unambiguously. On the contrary, 3D volume models, such as solid models produced by CAD systems, or voxels models, enclose a volume properly. This paper surveys the literature on methods for content based 3D retrieval, taking into account the applicability to surface models as well as to volume models. The methods are evaluated with respect to several requirements of content based 3D shape retrieval, such as: (1) shape representation requirements, (2) properties of dissimilarity measures, (3) efficiency, (4) discrimination abilities, (5) ability to perform partial matching, (6) robustness, and (7) necessity of pose normalization. Finally, the advantages and limitations of the several approaches in content based 3D shape retrieval are discussed.
Remco C. Veltkamp (Corresponding author)Email:
  相似文献   

11.
Adaptation to the characteristics of specific images and the preferences of individual users is critical to the success of an image retrieval system but insufficiently addressed by the existing approaches. In this paper, we propose an elegant and effective approach to data-adaptive and user-adaptive image retrieval based on the idea of peer indexing—describing an image through semantically relevant peer images. Specifically, we associate each image with a two-level peer index that models the “data characteristics” of the image as well as the “user characteristics” of individual users with respect to this image. Based on two-level image peer indexes, a set of retrieval parameters including query vectors and similarity metric are optimized towards both data and user characteristics by applying the pseudo feedback strategy. A cooperative framework is proposed under which peer indexes and image visual features are integrated to facilitate data- and user-adaptive image retrieval. Simulation experiments conducted on real-world images have verified the effectiveness of our approach in a relatively restricted setting.  相似文献   

12.
13.
Content-based 3D object retrieval has become an active topic in many research communities. In this paper, we propose a novel visual similarity-based 3D shape retrieval method (CM-BOF) using Clock Matching and Bag-of-Features. Specifically, pose normalization is first applied to each object to generate its canonical pose, and then the normalized object is represented by a set of depth-buffer images captured on the vertices of a given geodesic sphere. Afterwards, each image is described as a word histogram obtained by the vector quantization of the image’s salient local features. Finally, an efficient multi-view shape matching scheme (i.e., Clock Matching) is employed to measure the dissimilarity between two models. When applying the CM-BOF method in non-rigid 3D shape retrieval, multidimensional scaling (MDS) should be utilized before pose normalization to calculate the canonical form for each object. This paper also investigates several critical issues for the CM-BOF method, including the influence of the number of views, codebook, training data, and distance function. Experimental results on five commonly used benchmarks demonstrate that: (1) In contrast to the traditional Bag-of-Features, the time-consuming clustering is not necessary for the codebook construction of the CM-BOF approach; (2) Our methods are superior or comparable to the state of the art in applications of both rigid and non-rigid 3D shape retrieval.  相似文献   

14.
With the rapidly increasing of 3D models, the 3D model retrieval methods have been paid significant research attention. Most of the existing methods focus on taking advantage of one kind of feature. These methods can not achieve ideal retrieval results for different classes of 3D models. In this paper, we propose a novel 3D model retrieval algorithm by combining topological and view-based features. To preserve the topological structure of the 3D model, a multiresolutional reeb graph (MRG) is constructed according to the salient topological points. The view-based features are extracted from the images, which are rendered at each of the topological points. To preserve the spatial structure information of the images, we modify the bag-of-features (BOF) method by using the combined shell-sector model. We take the view-based features as the attribute information of the corresponding MRG nodes. The comparison between two 3D models is transformed to the problem of computing the similarity of the corresponding MRGs. Finally, we calculate the similarity between the query model and the models in the databases by adapting the earth mover distance method. Experimental results on two standard benchmarks show that our algorithm can achieve satisfactory retrieval performance.  相似文献   

15.

Social Book Search is an Information Retrieval (IR) approach that studies the impact of the Social Web on book retrieval. To understand this impact, it is necessary to develop a stronger classical baseline run by considering the contribution of query formulation, document representation, and retrieval model. Such a stronger baseline run can be re-ranked using metadata features from the Social Web to see if it improves the relevance of book search results over the classical IR approaches. However, existing studies neither considered collectively the contribution of the three mentioned factors in the baseline retrieval nor devised a re-ranking formula to exploit the collective impact of the metadata features in re-ranking. To fill these gaps in the literature, this research work first performs baseline retrieval by considering all three factors. For query formulation, it uses topic sets obtained from the discussion threads of LibraryThing. For book representation in indexing, it uses metadata from social websites including Amazon and LibraryThing. For the role of the retrieval model, it experiments with traditional, probabilistic, and fielded models. Second, it devises a re-ranking solution that exploits ratings, tags, reviews, and votes in reordering the baseline search results. Our best-performing retrieval methods outperform existing approaches on several topic sets and relevance judgments. The findings suggest that using all topic fields formulates the best search queries. The user-generated content gives better book representation if made part of the search index. Re-ranking the classical/baseline results improves relevance. The findings have implications for information science, IR, and Interactive IR.

  相似文献   

16.
针对三维模型检索中单一特征检索效果差的难题,首先提出了三维模型的3类特征向量提取算法,即刻画模型表面特性的扩展高斯球面特征向量、反映模型内部结构的Radon变换球面分布特征向量、代表模型投影层次的视图分层压缩感知特征向量。其次,以样本模型的查询结果分类信息熵作为指标并结合监督学习过程,给出了一种多特征融合的加权系数估算方法。最后,设计了融合多特征的模型间相似度度量,完成基于查询示例的模型检索过程。仿真实验表明,提出的3类特征向量具有较好的可区分性,多特征融合检索算法的查全率与查准率有明显提升。  相似文献   

17.
Computer graphics has now matured in medical applications from 2D and 3D presentations for diagnosis and the planning of surgery and therapy to become the key step in making hand-held models of custom prostheses. The system described here delivers 3D shape information to create skeletal models, plan corrective surgery, and directly manufacture prostheses. Implants and anatomic models are manufactured using computed tomography (CT) image data and a system to generate Instructions for numerically controlled machines. The system combines clinical imaging, an algorithm for 3D edge detection, computer communications, and computer-aided and manufacturing (CAD/CAM). This integration of technologies brings recent advances in computer-aided design and manufacturing to the local community CT scanning clinic in a cost-effective manner. Via computer communications, several hundred remote medical imaging centers can have their CT scanners connected on-line to CAD/CAM facilities that one could not support alone. Operators of the remote CT scanners bear only the cost of computer communications equipment to being their patients this service. We use the clinical course of several patients in whom prostheses have been implanted to describe this technology.  相似文献   

18.
民族服饰图像具有不同民族风格的服装款式、配饰和图案,导致民族服饰图像细粒度检索准确率较低.因此,文中提出细粒度民族服饰图像检索的全局-局部特征提取方法.首先,基于自定义的民族服饰语义标注,对输入图像进行区域检测,分别获得前景、款式、图案和配饰图像.然后在全卷积网络结构的基础上构建多分支的全局-局部特征提取模型,对不同区...  相似文献   

19.
谢辉  陆月明 《计算机应用》2013,33(2):460-462
针对基于文本的图像搜索结果的排序不能很好满足用户查询期望的问题,提出两种基于内容的图像搜索结果重排序方法:基于相似性积分的重排序算法(SI算法)和基于Dijkstra算法的重排序算法(D算法)。这两种方法把图像作为节点,利用图像的颜色和形状特征计算图像间的相似性,并将相似性作为边的权重构建相似性图,SI算法根据每个节点图像相似性积分的大小来进行排序,D算法则利用Dijkstra算法从指定图像开始对所有图像节点进行遍历排序。实验结果表明,两种方法都能很好地改善图像搜索排序结果,其中SI算法适合使用在初始查准率在0.5~0.9的情况;而D算法不要求初始查准率,但对图像间相似性值的精确度要求高,可以用于用户指定一张查询相关图像的重排序。  相似文献   

20.
基于子图同构的三维CAD模型局部匹配   总被引:4,自引:4,他引:0  
针对整体相似性检索算法无法实施精确的局部结构匹配的问题,提出一种基于子图同构的三维CAD模型局部结构匹配算法.该算法通过提取CAD模型的B-Rep信息,将其表示为以面作为节点的属性邻接图.在局部匹配过程中,用户输入的局部结构被表示成"子图".待匹配的整体CAD模型被表示成"大图";则在整体CAD模型中.检索局部结构的问题就被转换成在"大图"中寻找同构"子图"的问题.子图同构是NP完全问题,通过利用CAD模型的面特征将图顶点有效细分,并利用已匹配顶点之间的邻接关系动态裁剪搜索空间,实现了快速的同构匹配.实验结果表明,该算法能实现精确的局部结构匹配,并且检索效率能满足实际应用要求.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号