基于内容的图像检索的发展最新趋势

基于内容的图像检索目前主要集中于底层特征的相似度匹配的研究,文中阐述了基于内容的图像检索发展的最新趋势:基于语义内容的图像检索和语义的描述方法。文章首先提出了语义层次化的基于内容检索的系统框架,然后介绍了图像高层语义的处理方法,最后展望了基于MPEG-7的统一规范的图像语义的描述方法。     

彩色图像检索方法

对彩色图像的检索进行了研究,提出了彩色图像检索的方法.该方法首先对彩色图像进行聚类,再使用聚类后图像的主颜色进行颜色相似度计算,使用基于奇异值向量的主颜色矩阵进行空间相似度计算,最后给出了基于主颜色的颜色信息和空间分布信息的图像内容相似度计算方法.进行检索时,可根据检索要求自适应地改变颜色和空间分布的权重,增加了系统的有效性.实验结果表明,该方法实现简单,能够更加灵活、准确地描述图像的颜色特征,从而有效提高了图像检索的准确率.     

基于相似性度量方法的图像检索

图像检索的目的是找出检索对象集中的所有与指定样本图像相似的图像.基于内容的图像检索近年来得到了广泛的研究,人们已经提出了许多基于特征的图像检索算法,在以往的算法中表达图像特征的相似度通常采用距离法,但是这种距离法存在很多不足之处.为了克服这些不足,介绍了一种特征矩阵的构造方法并利用特征矩阵来计算图像的相似度,以此来进行图像检索.     

基于内容的视频检索研究

基于内容的检索能使用户根据媒体特征对媒体内容进行检索和查询．由于多媒体数据中含有丰富的视频数据，并且是随时间动态变化的其特征很难用一般的静态特征来描述，为了取得视频数据的特征．对视频数据的处理非常重要，本文将介绍基于内容的视频检索中相似索引的处理技术和方法。     

图像检索中的关键技术

传统的基于数值／字符的信息检索技术并不能满足海量的图像检索要求，因此，基于内容的图像检索技术（CBIR，content-based Image retrieval）得到了广泛研究，本主要讨论CBIR研究中的一些关键问题：图像的内容特征及其提取，特征之间的相似度计算，查询条件的表达等，最后指出了一些可值得深入研究的方向。     

基于内容的视频检索技术

基于内容的视频检索系统是将视频结构化并依赖视频数据中的视觉特征以及时空特征进行相似度衡量的系统.讨论目前国内外基于内容视频检索领域的研究现状和发展趋势,并研究对基于内容的视频检索的关键技术和方法.     

基于面积分布的3D模型检索技术

基于内容的3D模型检索技术难以提取形状特征,该文通过提取表面面积分布来表示3D模型的形状特征,采用主分量分析方法确保特征满足平移不变性、旋转不变性、对称不变性。以切分块内三角面片面积和与总面积的比值作为特征,确保缩放不变性。二次型形式的距离公式计算的相似度能够有效地区分特征分量的空间位置。实验表明,基于面积分布的检索技术具有较好的检索效果。     

视频检索中镜头相似度的融合

基于内容的视频检索系统中,最常用的方法是示例查询,即用户提交一段视频,系统返回一系列相似视频.在这一过程中,定义镜头的相似度是一个重要的问题.本文介绍了在不同层次上利用多种特征进行镜头相似度融合的方法.特征层次上,对任意两个镜头,给依据不同的特征计算得到的相似度赋予不同的加权系数,进行加权得到融合后的镜头相似度.在决策层次上,运用Dempster-Shafer证据理论融合镜头相似度.首先,运用多种特征计算得到相似度的多种排序结果;然后,指定期望得到的检索结果数;最后应用证据理论对相似度的多种排序结果进行融合处理,得到最终的镜头相似度排序结果.本文最后进行了检索实验,结果表明,融合后的相似度结果更接近人的主观判断,证明了融合效果的有效性.     

综合颜色特征的彩色图像检索方法

基于内容的图像检索技术已成为当前的研究热点,文章提出了一种综合利用两种颜色特征进行图像检索的新方法。首先,在变换空间建立色度直方图表示图像的颜色分布特征。为进行图像间的相似性度量,对Swain定义的直方图相似性度量作了改进,为弥补全局直方图不包含颜色空间分布关系的缺点,文章提取了另一种颜色特征,即分块的颜色矩,其距离度量为特征矢量的比值相似度。最后,综合利用上述两个特征对图像进行共同检索。通过对真实图像数据的检索实验表明:综合两种特征检索图像比单一特征检索效果更好。     

基于内容的图像检索技术与医学图像检索

在分析基于内容的图像检索技术特点的基础上，提出了4种基于内容的图像检索方法，并对每种方法的实现特别是特征抽取进行了一定的研究。根据医学图像的使用特点，对基于内容的医学图像检索技术进行了初步的研究；对医学图像特征的抽取，应将重点放在形状特征和纹理特征的抽取上；同时，对医学图像进行检索，还可以使用颜色空间分布特征，来进一步进行相似匹配。     

Batch Nearest Neighbor Search for Video Retrieval

To retrieve similar videos to a query clip from a large database, each video is often represented by a sequence of high- dimensional feature vectors. Typically, given a query video containing m feature vectors, an independent nearest neighbor (NN) search for each feature vector is often first performed. After completing all the NN searches, an overall similarity is then computed, i.e., a single content-based video retrieval usually involves m individual NN searches. Since normally nearby feature vectors in a video are similar, a large number of expensive random disk accesses are expected to repeatedly occur, which crucially affects the overall query performance. Batch nearest neighbor (BNN) search is stated as a batch operation that performs a number of individual NN searches. This paper presents a novel approach towards efficient high-dimensional BNN search called dynamic query ordering (DQO) for advanced optimizations of both I/O and CPU costs. Observing the overlapped candidates (or search space) of a pervious query may help to further reduce the candidate sets of subsequent queries, DQO aims at progressively finding a query order such that the common candidates among queries are fully utilized to maximally reduce the total number of candidates. Modelling the candidate set relationship of queries by a candidate overlapping graph (COG), DQO iteratively selects the next query to be executed based on its estimated pruning power to the rest of queries with the dynamically updated COG. Extensive experiments are conducted on real video datasets and show the significance of our BNN query processing strategy.     

Automatic content based image retrieval using semantic analysis

We present a new text-to-image re-ranking approach for improving the relevancy rate in searches. In particular, we focus on the fundamental semantic gap that exists between the low-level visual features of the image and high-level textual queries by dynamically maintaining a connected hierarchy in the form of a concept database. For each textual query, we take the results from popular search engines as an initial retrieval, followed by a semantic analysis to map the textual query to higher level concepts. In order to do this, we design a two-layer scoring system which can identify the relationship between the query and the concepts automatically. We then calculate the image feature vectors and compare them with the classifier for each related concept. An image is relevant only when it is related to the query both semantically and content-wise. The second feature of this work is that we loosen the requirement for query accuracy from the user, which makes it possible to perform well on users’ queries containing less relevant information. Thirdly, the concept database can be dynamically maintained to satisfy the variations in user queries, which eliminates the need for human labor in building a sophisticated initial concept database. We designed our experiment using complex queries (based on five scenarios) to demonstrate how our retrieval results are a significant improvement over those obtained from current state-of-the-art image search engines.     

Integrated Video and Text for Content-based Access to Video Databases

This paper introduces a new approach to realize video databases. The approach consists of a VideoText data model based on free text annotations associated with logical video segments and a corresponding query language. Traditional database techniques are inadequate for exploiting queries on unstructured data such as video, supporting temporal queries, and ranking query results according to their relevance to the query. In this paper, we propose to use information retrieval techniques to provide such features and to extend the query language to accommodate interval queries that are particularly suited to video data. Algorithms are provided to show how user queries are evaluated. Finally, a generic and modular video database architecture which is based on VideoText data model is described.     

PICASSO: A graphical query language

PICASSO (PICture Aided Sophisticated Sketch Of database queries) is a graphics-based database query language designed for use with a universal relation database system. The primary objective of PICASSO is ease of use. Graphics are used to provide a simple method of expressing queries and to provide visual feedback to the user about the system's interpretation of the query. Inexperienced users can use the graphical feedback to aid them in formulating queries whereas experienced users can ignore the feedback. Inexperienced users can pose queries without knowing the details of underlying database schema and without learning the formal syntax of SQL-like query language. This paper presents the syntax of PICASSO queries and compares PICASSO queries with similar queries in standard relational query languages. Comparisons are also made with System/U, a non-graphical universal relation system on which PICASSO is based. The hypergraph semantics of the universal relation are used as the foundation for PICASSO and their integration with a graphical workstation enhances the usability of database systems.     

A knowledge-based approach for retrieving images by content

A knowledge based approach is introduced for retrieving images by content. It supports the answering of conceptual image queries involving similar-to predicates, spatial semantic operators, and references to conceptual terms. Interested objects in the images are represented by contours segmented from images. Image content such as shapes and spatial relationships are derived from object contours according to domain specific image knowledge. A three layered model is proposed for integrating image representations, extracted image features, and image semantics. With such a model, images can be retrieved based on the features and content specified in the queries. The knowledge based query processing is based on a query relaxation technique. The image features are classified by an automatic clustering algorithm and represented by Type Abstraction Hierarchies (TAHs) for knowledge based query processing. Since the features selected for TAH generation are based on context and user profile, and the TAHs can be generated automatically by a clustering algorithm from the feature database, our proposed image retrieval approach is scalable and context sensitive. The performance of the proposed knowledge based query processing is also discussed     

基于非监督纹理分割下的图像查询

随着图像数据库的广泛应用,基于图像纹理的查询已经变成了一项重要也是复杂的工作。为了更简便地查询图像,文中基于图像纹理的非监督分割,提出了新的图像分类方法。通过对每一纹理图像进行这种非监督纹理分割,提取纹理的特征向量,然后基于这些参数,运用假设检验进行纹理的分类和融合。通过对MT Vistex和Brodatz数据库中选取的纹理图像进行分类测试,证明该方法是十分有效的。     

Decidable containment of recursive queries

One of the most important reasoning tasks on queries is checking containment, i.e., verifying whether one query yields necessarily a subset of the result of another one. Query containment is crucial in several contexts, such as query optimization, query reformulation, knowledge-base verification, information integration, integrity checking, and cooperative answering. Containment is undecidable in general for Datalog, the fundamental language for expressing recursive queries. On the other hand, it is known that containment between monadic Datalog queries and between Datalog queries and unions of conjunctive queries are decidable. It is also known that containment between unions of conjunctive two-way regular path queries, which are queries used in the context of semistructured data models containing a limited form of recursion in the form of transitive closure, is decidable. In this paper, we combine the automata-theoretic techniques at the base of these two decidability results to show that containment of Datalog in union of conjunctive two-way regular path queries is decidable in 2EXPTIME. By sharpening a known lower bound result for containment of Datalog in union of conjunctive queries we show also a matching lower bound.     

Solving Local Cost Estimation Problem for Global Query Optimization in Multidatabase Systems

To meet users' growing needs for accessing pre-existing heterogeneous databases, a multidatabase system (MDBS) integrating multiple databases has attracted many researchers recently. A key feature of an MDBS is local autonomy. For a query retrieving data from multiple databases, global query optimization should be performed to achieve good system performance. There are a number of new challenges for global query optimization in an MDBS. Among them, a major one is that some local optimization information, such as local cost parameters, may not be available at the global level because of local autonomy. It creates difficulties for finding a good decomposition of a global query during query optimization. To tackle this challenge, a new query sampling method is proposed in this paper. The idea is to group component queries into homogeneous classes, draw a sample of queries from each class, and use observed costs of sample queries to derive a cost formula for each class by multiple regression. The derived formulas can be used to estimate the cost of a query during query optimization. The relevant issues, such as query classification rules, sampling procedures, and cost model development and validation, are explored in this paper. To verify the feasibility of the method, experiments were conducted on three commercial database management systems supported in an MDBS. Experimental results demonstrate that the proposed method is quite promising in estimating local cost parameters in an MDBS.     

Discovering and understanding word level user intent in Web search queries

Identifying and interpreting user intent are fundamental to semantic search. In this paper, we investigate the association of intent with individual words of a search query. We propose that words in queries can be classified as either content or intent, where content words represent the central topic of the query, while users add intent words to make their requirements more explicit. We argue that intelligent processing of intent words can be vital to improving the result quality, and in this work we focus on intent word discovery and understanding. Our approach towards intent word detection is motivated by the hypotheses that query intent words satisfy certain distributional properties in large query logs similar to function words in natural language corpora. Following this idea, we first prove the effectiveness of our corpus distributional features, namely, word co-occurrence counts and entropies, towards function word detection for five natural languages. Next, we show that reliable detection of intent words in queries is possible using these same features computed from query logs. To make the distinction between content and intent words more tangible, we additionally provide operational definitions of content and intent words as those words that should match, and those that need not match, respectively, in the text of relevant documents. In addition to a standard evaluation against human annotations, we also provide an alternative validation of our ideas using clickthrough data. Concordance of the two orthogonal evaluation approaches provide further support to our original hypothesis of the existence of two distinct word classes in search queries. Finally, we provide a taxonomy of intent words derived through rigorous manual analysis of large query logs.