基于纹理的图像检索

基于特征的图像检索在多媒体数据库管理和多媒体通信传输中得到越来越多的重视。介绍了基于纹理特征的特征提取方法 ,并对提取出的特征进行维数缩减。对真实图像库的检索实验表明 ,用此方法检索出的图像更符合人的视觉特性。     

基于纹理的图像检索

为得到纹理特征提取的合适的算法,首先研究了基于灰度共生矩阵的纹理特征的提取方法,将彩色图像变换灰度图像,然后进行四个方向的纹理特征提取,包括能量、熵、惯性矩、相关量四个向量元素作为纹理特征值,并研究了基于Gabor小波的纹理特征的提取。首先将Gabor小波作为母小波,将图像进行二维的Gabor小波变换,将Gabor小波系数的均值和标准方差作为纹理特征值;将两种方法进行比较,查全率和查准率作为测量标准,实验表明基于Gabor小波变换的纹理特征方法在频域具有比较好的检索效果。     

综合颜色与纹理的图像检索

提出了组合颜色和纹理特征的图像检索方法,通过对颜色进行量化然后提取颜色特征,计算图像之间的颜色距离.用Gabor变换提取图像的纹理特征然后根据L2距离计算图像的纹理距离,利用颜色特征和纹理特征的加权来求检索图像和查询图像的相似度,根据相似度的大小来进行图像的检索.实验结果表明,基于组合特征的图像检索方法优于单纯的图像检索方法.     

基于多纹理特征的商标图像检索

提出了一种基于多纹理特征的商标图像检索方法。首先对图像纹理特征进行分析,从人眼视觉角度选用粗糙度和方向性这2个纹理特征量;从统计分析的角度出发,基于图像灰度共生矩阵描述了二阶矩、熵、对比度和均匀性这4个纹理特征量。这6个纹理特征量从不同角度刻画了图像特征,对其归一化后用欧氏距离进行图像相似性度量。通过实验,证明了该方法可以取得比较满意的检索结果。     

基于纹理和形状特征的医学图像检索研究

本文使用纹理和形状特征进行基于内容的医学图像检索,并对算法作出一些改进。最后,综合利用纹理和形状特征对医学图像进行检索,证明了纹理特征和形状特征对医学图像来说具有互补性。     

一种基于Curvelet相关图纹理图像检索方法

纹理是图像普遍存在且难以描述的特征,但是更容易引起人们视觉上的关注,它蕴含有丰富的信息,所以基于纹理的检索具有重要的应用价值。提出了一种新的基于Curvelet相关图纹理图像检索方法。该方法通过对纹理图像进行Curvelet分解进行多尺度分析;利用变换后粗尺度反映图像轮廓、细尺度反映图像纹理信息特性,阈值处理后采用不同的量化等级;计算Curvelet系数相关图,反映了不同系数所占比例和相互之间的空间相关性,由此构造图像的特征向量。通过对Brodatz纹理图像库实验,结果表明该方法相较于原有的Curvelet方法能够更有效地进行纹理图像检索。     

基于纹理特征与BP神经网络的一类图像检索

1 引言随着网络通信及多媒体技术的发展,特别是因特网的广泛应用,图像作为一种越来越重要的信息载体得到了广泛的应用。融合图像理解技术,直接针对静止图像或视频帧的图像特征进行处理,在高度信息化的今天,已成为内容图像库中图像信息组织和管理不可     

基于颜色相关图和纹理矩的图像检索

基于内容的图像检索的关键就是准确地提取图像特征。目前常见的图像特征的分类有颜色、纹理和形状。提出了改进的图像相关图算法以及纹理矩算法,并采取有效的方法来结合这两种算法实现高效的图像检索,图像相关图不仅反映了图像的灰度统计信息,而且还反映了图像的空间特征和灰度的渐变度。纹理矩是通过计算图像局部区域的力矩来反映图像的纹理特征。二者相结合整合了图像颜色和纹理信息。实验证明,改进的图像相关图以及纹理矩算法优于传统算法,二者通过在有限的空间维度下的结合在很大程度上提高了检索精度。     

基于属性关系直方图统计的线状纹理图像检索方法

提出一种基于属性关系图ARG描述的线状纹理图像检索方法。针对一般的ARG图匹配算法运算量大、检索速度慢的问题，在用ARG描述线状纹理特征的基础上，通过计算纹理基元属性关系直方图之间的归一化距离来衡量图像的相似度，大大提高了运算速度。应用于鞋底花纹图像库的实验结果表明，该方法对于线状纹理特征具有较强的描述能力，对于平移、旋转和伸缩具有较好的不变性、检索速度和检索结果均能满足应用要求。     

纹理相似性度量研究及基于纹理特征的图像检索

纹理相似性研究是纹理合成和基于内容检索研究中的一个重要组成部分.在相似性判断中,采用与人类视觉感知相对应的纹理特征,将比使用其他无明确含义的纹理特征,对系统的进一步改善有着更为重要的指导意义.在Tamura,Amadasun和Haralick等人提出的纹理特征的基础上分析了与人类视觉特征有较为明确对应关系的19个纹理特征,不同纹理之间的相似性由这19个纹理特征构成的归一化特征向量之间的加权欧氏距离决定.对大量纹理图像的相似性进行了度量,实验结果表明所选的纹理特征有较强的描述能力.使用了主成分分析算法来压缩特征向量的维数,结果表明,6维特征主分量已经可以给出较好的纹理相似性度量.     

Ontology-based similarity for product information retrieval

Product development of today is becoming increasingly knowledge intensive. Specifically, design teams face considerable challenges in making effective use of increasing amounts of information. In order to support product information retrieval and reuse, one approach is to use case-based reasoning (CBR) in which problems are solved “by using or adapting solutions to old problems.” In CBR, a case includes both a representation of the problem and a solution to that problem. Case-based reasoning uses similarity measures to identify cases which are more relevant to the problem to be solved. However, most non-numeric similarity measures are based on syntactic grounds, which often fail to produce good matches when confronted with the meaning associated to the words they compare. To overcome this limitation, ontologies can be used to produce similarity measures that are based on semantics. This paper presents an ontology-based approach that can determine the similarity between two classes using feature-based similarity measures that replace features with attributes. The proposed approach is evaluated against other existing similarities. Finally, the effectiveness of the proposed approach is illustrated with a case study on product–service–system design problems.     

Adaptive tree similarity learning for image retrieval

Learning-enhanced relevance feedback is one of the most promising and active research directions in content-based image retrieval in recent years. However, the existing approaches either require prior knowledge of the data or converge slowly and are thus not coneffective. Motivated by the successful history of optimal adaptive filters, we present a new approach to interactive image retrieval based on an adaptive tree similarity model to solve these difficulties. The proposed tree model is a hierarchical nonlinear Boolean representation of a user query concept. Each path of the tree is a clustering pattern of the feedback samples, which is small enough and local in the feature space that it can be approximated by a linear model nicely. Because of the linearity, the parameters of the similartiy model are better learned by the optimal adaptive filter, which does not require any prior knowledge of the data and supports incremental learning with a fast convergence rate. The proposed approach is simple to implement and achieves better performance than most approaches. To illustrate the performance of the proposed approach, extensive experiments have been carried out on a large heterogeneous image collection with 17,000 images, which render promising results on a wide variety of queries.An early version of part of the system was reported in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition 2001.     

Multivariate image similarity in the compressed domain using statistical graph matching

We address the problem of image similarity in the compressed domain, using a multivariate statistical test for comparing color distributions. Our approach is based on the multivariate Wald-Wolfowitz test, a nonparametric test that assesses the commonality between two different sets of multivariate observations. Using some pre-selected feature attributes, the similarity measure provides a comprehensive estimate of the match between different images based on graph theory and the notion of minimal spanning tree (MST). Feature extraction is directly provided from the JPEG discrete cosine transform (DCT) domain, without involving full decompression or inverse DCT. Based on the zig-zag scheme, a novel selection technique is introduced that guarantees image's enhanced invariance to geometric transformations. To demonstrate the performance of the proposed method, the application on a diverse collection of images has been systematically studied in a query-by-example image retrieval task. Experimental results show that a powerful measure of similarity between compressed images can emerge from the statistical comparison of their pattern representations.     

基于度量直方图的医学图像检索

研究了医学图像灰度分布的特性,利用相邻灰度的相关性提出了基于度量直方图的医学图像检索方法及其度量空间上的距离函数MHD0;该方法减少了传统直方图特征的维教,克服了SAM索引的缺点。通过对CT图像数据库的检索实验,验证了该方法在性能和速度上都超过了传统直方图检索方法。     

基于增强微结构和上下文相似度的图像检索

针对图像检索中多特征综合描述子维度过高且综合权值难以确定的缺点,提出一种新的基于增强微结构和上下文相似度的图像检索方法。首先,使用一种新的局部模式映射来创建过滤图;然后,基于该图上的颜色共生关系提取增强微结构描述子,该描述子综合了多种特征而维度与单特征相同,检索时使用此描述子计算图像对间的规范距离得出初始的有序相似图像序列;最后,结合迭代上下文相似度对检索序列进行重新排序。当迭代次数为50且考虑前24幅结果图像时,在Corel-5000和Corel-10000图像集上的实验结果显示,所提方法与同类型的多重基元直方图(MTH)和微结构描述子(MSD)方法相比,检索查准率分别提高了13.14%、7.09%和11.03%、6.8%。结果表明新方法能在维度不变的情况下综合多种特征并充分利用上下文信息,从而有效提高图像检索的准确率。     

基于语义关系图的跨模态张量融合网络的图像文本检索

跨模态图像文本检索的难点是如何有效地学习图像和文本间的语义相关性。现有的大多数方法都是学习图像区域特征和文本特征的全局语义相关性或模态间对象间的局部语义相关性,而忽略了模态内对象之间的关系和模态间对象关系的关联。针对上述问题,提出了一种基于语义关系图的跨模态张量融合网络（CMTFN-SRG）的图像文本检索方法。首先,采用图卷积网络（GCN）学习图像区域间的关系并使用双向门控循环单元（Bi-GRU）构建文本单词间的关系;然后,将所学习到的图像区域和文本单词间的语义关系图通过张量融合网络进行匹配以学习两种不同模态数据间的细粒度语义关联;同时,采用门控循环单元（GRU）学习图像的全局特征,并将图像和文本的全局特征进行匹配以捕获模态间的全局语义相关性。将所提方法在Flickr30K和MS-COCO两个基准数据集上与多模态交叉注意力（MMCA）方法进行了对比分析。实验结果表明,所提方法在Flickr30K测试集、MS-COCO1K测试集以及MS-COCO5K测试集上文本检索图像任务的Recall@1分别提升了2.6%、9.0%和4.1%,召回率均值（mR）分别提升了0.4、1.3和0.1个百分点,可见该方法能有效提升图像文本检索的精度。     

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

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

Medical social network content analysis for medical image retrieval purpose

Background and objective: Medical social networking platforms provide virtual spaces ensuring the interaction between different healthcare participants. As a part of the exchange, these spaces allow subscribers to upload medical images, describing different medical cases for an analysis or an interpretation proposal. Facing this expected huge amount of uploaded images generated daily, it is needed to engage new mechanisms to effectively deal with this circumstance, for enhancing the search function process of medical images, based on what is uploaded. To overcome this issue, setting up of images visual searching based on a content-based medical image retrieval scheme is the solution. More clearly, such mechanism will help and motivate medical social networking subscribers to find visually similar stored images. Methods: To ensure this task, the development of this mechanism, technically, is based mainly on a fusion of three visual features, which offers a flexible and more precision. It is reinforced by a weighted distance approach through attributing weights for feature vectors to scale up the performance. Indeed, the displayed results of this system can be updated based on user's intention by a user interactive feedback mechanism to indicate the truly relevant images. Results: We provide the theoretical performance of our scheme. Extensive experiments were conducted on a categorically classified collection containing 500 images. We conduct a practical evaluation on this dataset classes, putting returned results in a comparative study with other models results, existing in the literature. Conclusions: The proposed scheme preserves the efficiency of the search task. As theoretically and experimentally established, our scheme offers an effective image retrieval model that can support different subscribers' expectations. The relevance feedback mechanism can keep the dynamism of the system, thus offering a continuous searching result evolution. Experimentation outcomes indicate better findings compared with the other models.     

Multiple-instance content-based image retrieval employing isometric embedded similarity measure

In image-based retrieval, global or local features sufficiently discriminative to summarize the image content are commonly extracted first. Traditional features, such as color, texture, shape or corner, characterizing image content are not reliable in terms of similarity measure. A good match in the feature domain does not necessarily map to image pairs with similar relationship. Applying these features as search keys may retrieve dissimilar false-positive images, or leave similar false-negative ones behind. Moreover, images are inherently ambiguous since they contain a great amount of information that justifies many different facets of interpretation. Using a single image to query a database might employ features that do not match user's expectation and retrieve results with low precision/recall ratios. How to automatically extract reliable image features as a query key that matches user's expectation in a content-based image retrieval (CBIR) system is an important topic.The objective of the present work is to propose a multiple-instance learning image retrieval system by incorporating an isometric embedded similarity measure. Multiple-instance learning is a way of modeling ambiguity in supervised learning given multiple examples. From a small collection of positive and negative example images, semantically relevant concepts can be derived automatically and employed to retrieve images from an image database. Each positive and negative example images are represented by a linear combination of fractal orthonormal basis vectors. The mapping coefficients of an image projected onto each orthonormal basis constitute a feature vector. The Euclidean-distance similarity measure is proved to remain consistent, i.e., isometric embedded, between any image pairs before and after the projection onto orthonormal axes. Not only similar images generate points close to each other in the feature space, but also dissimilar ones produce feature points far apart.The utilization of an isometric-embedded fractal-based technique to extract reliable image features, combined with a multiple-instance learning paradigm to derive relevant concepts, can produce desirable retrieval results that better match user's expectation. In order to demonstrate the feasibility of the proposed approach, two sets of test for querying an image database are performed, namely, the fractal-based feature extraction algorithm vs. three other feature extractors, and single-instance vs. multiple-instance learning. Both the retrieval results, execution time and precision/recall curves show favorably for the proposed multiple-instance fractal-based approach.     

互信息启发的相似度组合图像检索算法

图像的视觉特征与用户描述之间的差距一直是影响基于内容的图像检索准确度的最主要因素。对多种相似度进行组合来检索图像是近几年图像检索领域涌现出的一个研究热点,也是缩小这种差距的一种有效途径。如何选择更好的组合方法则是该领域很多研究者关注的核心问题。提出一种新的相似度组合算法。该算法基于互信息度量相对熵的原理,计算连续变量相似度与离散变量相似性之间的相关性,对多种相似度进行选择,以“和规则”组合相似度。在公用数据集上进行检索实验,该算法优于当前其他的“和规则”下的组合方法。