基于空间分布差异度的分块彩色图像检索方法

传统的基于颜色直方图的彩色图像检索方法具有计算简单和尺度变化不敏感的优点,但传统的方法普遍存在丢失图像空间信息和特征维数较高的缺点。为克服上述缺陷,提出了一种基于空间分布差异度的分块颜色直方图图像检索新方法。该算法首先将图像进行划分,并计算图像各子块间的相似度;然后,对分块的图像进行空间分布差异度的计算,并由此确定各分块的权值系数;最后,对各子块的相似度进行加权累加从而得到整幅图像的相似度。实验表明,该算法能克服传统方法的弊端,并具有较好的平均查找性能。     

一种新的基于色彩的图像检索方法

在分析已有的基于色彩的图像检索方法存在问题的基础上 ,提出一种新的基于色彩的图像检索方法 .该方法对每个图像单独进行颜色量化 ,计算其颜色直方图并排序 ,根据颜色在图像中出现的频率和图像中各种颜色的对比强度确定图像之间的相似度 .使用的图像特征占用存储空间非常小 ,比较速度快 .测试了该方法识别图像和检索相似图像的能力 ,效果明显优于直方图距离方法     

一处新的基于色彩的图像检索方法

在分析已有的基于色彩的图像检索方法存在问题的基础上，提出一种新的基于色彩的图像检索方法，该方法对每个图像单独进行颜色量化，计算其颜色直方图并排序，根据颜色在图像中出现的频率和图像中各种颜色的对比强度确定图象之间的相似度，使用的图像特征占用存储空间非常小，比较速度快，测试了该方法识别图像和检索相似图像的能力，效果明显优于直方图距离方法。     

一种基于最大相似子阵的彩色图像检索算法

颜色是图像的重要特征之一,被广泛用于图像检索。传统的颜色直方图检索算法丢弃了色彩的空间位置信息,影响了算法的检索精度。针对这一问题,提出了一种基于最大相似子阵的彩色图像检索算法,即采用奇数方阵分割图像以捕捉颜色的空间分布特征,从而得到颜色矩阵,通过求解两个颜色矩阵的最大相似子阵实现相似度计算。研究结果表明,所提算法能够准确描述图像的颜色特征,相似度计算非常有效,相比全局直方图有较好的检索精度。     

基于颜色块的半径和角度直方图的图像检索

提出一种基于颜色块的半径直方图和角度直方图的图像检索方法。该方法将图像内容看成由若干颜色块组成的集合,根据每一块颜色块的半径直方图和角度直方图来计算图像间内容的相似度,并进行检索。对Corel图像库的10类图像进行测试,每类取20幅作为查询事例。实验结果表明,该方法与全局直方图、结构量化直方图相比,其平均查准率分别提高了10.3%, 11.9%。     

一种基于颜色聚合向量的图像检索方法

颜色直方图被广泛地应用在基于内容的图像检索中，其优点是效率高，对于视点细微的变化不敏感。然而直方图只是图像的一个粗糙特征，对于视觉上完全不相似的图像，其直方图有可能非常相似。该文在颜色直方图的基础上进行了改进，采用一种基于颜色聚合向量的图像检索方法，极大地提高了检索精度。     

基于HSI色彩空间累加直方图的图像检索算法

本文给出了一种基于HSI色彩空间累加直方图进行图像检索的方法。该方法使用符合人类视觉特性的HSI颜色模型将颜色空间压缩为72种具有代表性的颜色,设计了一种具有重叠方式的图像分块方法;然后统计每块区域内的颜色直方图得到该图像的HSI颜色空间直方图,再计算各块的累加直方图,并根据相似度计算方法计算每块子图像的累加直方图和图像库中图像对应块的累加直方图的相似度;最后根据各块子图像的重要性进行加权,得出最后的检索结果。实验表明,该方法实现简单,能够更加灵活、准确地描述图像的颜色特征,从而有效提高了检索的精度。     

基于颜色特征图片的检索技术

基于内容的图像检索方法是目前有效查询大量图片资料的关键技术，并广泛的应用于多媒体数据库中。本文阐述了一种基于颜色特征的图片检索技术，将颜色直方图或者颜色集作为颜色特征存入图片数据库中；然后描述了图像相似度的计算方法；最后介绍查询技术，用示例接口查询或者用户主观颜色查询。     

基于颜色和形状特征的图像检索方法

提出了一种基于颜色和形状特征的图像检索方法。在对HSV颜色模型量化的基础上,提取颜色直方图作为图像的颜色特征。在提取形状特征时,结合颜色量化结果,利用图像分割提取图像的形状特征,利用两特征的加权距离计算图像之间的相似度,而后进行图像检索。实验结果表明,该方法取得了较好的检索效果。     

一种基于位平面综合特征的彩色图像检索方案

传统的基于颜色直方图的彩色图像检索方法存在严重不足.首先是丢失颜色空间分布信息及特征维数过高,更重要的是无法有效检索含噪声图像.为克服此缺陷,提出了一种基于位平面综合特征的彩色图像检索算法.首先,结合光照、锐化、模糊等噪声攻击特点,从原始彩色图像中提取出重要位平面;然后选取重要位平面的加权颜色直方图作为颜色特征,选取重要位平面的空间信息熵作为空间特征;再综合利用上述颜色、空间两个特征计算图像间内容的相似度,并进行彩色图像检索.仿真实验表明,算法能够准确和高效地查找出用户所需内容的彩色图像,并且具有较好的查准率和查全率(特别对于含噪声图像).     

Multiresolution similarity search in image databases

Typically searching image collections is based on features of the images. In most cases the features are based on the color histogram of the images. Similarity search based on color histograms is very efficient, but the quality of the search results is often rather poor. One of the reasons is that histogram-based systems only support a specific form of global similarity using the whole histogram as one vector. But there is more information in a histogram than the distribution of colors. This paper has two contributions: (1) a new generalized similarity search method based on a wavelet transformation of the color histograms and (2) a new effectiveness measure for image similarity search. Our generalized similarity search method has been developed to allow the user to search for images with similarities on arbitrary detail levels of the color histogram. We show that our new approach is more general and more effective than previous approaches while retaining a competitive performance.     

一种基于颜色统计聚类的医学图像检索技术

基于颜色检索的基本思想是将图像间的距离归结为其颜色直方图间的相似性度量,从而图像检索也就转化为颜色直方图的匹配。目前基于颜色检索的算法主要集中在不同颜色空间进行全局颜色聚类或融合其他可视特征(纹理,颜色空间信息等)联合检索两个方向上。该文在具体的结肠镜图像检索系统研究中,根据医学图像的特点,提出一种在HSV空间的颜色统计聚类的检索方法,取得了良好的检索效果。     

彩色图象的联合分布表示及检索技术

随着图象数据的大量涌现,基于内容的图象检索技术已成为图象数据库领域的研究热点,在图象检索系统中,由于颜色直方图方法简单方便,所以它已成为CBIR系统中最常用的一种技术方法,然而,经典的颜色直方图方法存在诸多缺陷,例如它不能表示图象中的空间分布信息。为此,人们提出了直方图细化技术,即将图象的颜色分布表示扩充成为颜色和其他相关特征的联合分布。为了进一步提高图象检索能力,在分析图象特征的基础上,给出了两种加权直方图模型;其一是将图象的颜色分布和细节信号能量的分布集成到单个直方图之中;另一种模型是将图象颜色及其边界强度的联合分布集成到一个直方图中。这两种方法不仅保持了经典直方图简单方便的特点;同时又有效地将空间信息集成到直方图中,实验结果表明,这些加权直方图表示均具有较强的图象辨别能力。     

一种鲁棒的多特征彩色图像检索新方法

为了提高彩色图像检索的准确性,以回归型支持向量机(SVR)理论为基础,结合重要的图像边缘信息,提出了一种鲁棒的多特征彩色图像检索新方法。该方法首先利用回归型支持向量机(SVR)理论,对原始图像进行去噪处理及彩色边缘提取;然后将整个彩色边缘划分成局部网格区域,并分别计算出每个网格区域的颜色直方图和纹理直方图;最后综合利用上述网格区域的颜色直方图和纹理直方图来计算图像间内容的相似度,并进行彩色图像检索。实验结果表明,该方法不仅能够准确、快速的检索出用户所需图像,而且对光照、锐化、模糊等噪声攻击均具有较好的鲁棒性。     

Tree-structured image difference for fast histogram and distance between histograms computation

In this paper we present a new method for fast histogram computing and its extension to bin to bin histogram distance computing. The idea consists in using the information of spatial differences between images, or between regions of images (a current one and a reference one), and encoding it into a specific data structure: a tree. The histogram of the current image or of one of its regions is then computed by updating the histogram of the reference one using the temporal data stocked into the tree. With this approach, we never need to store any of the current histograms, except the reference image ones, as a preprocessing step. We compare our approach with the well-known Integral Histogram one, and obtain better results in terms of processing time while reducing the memory footprint. We show theoretically and with experimental results the superiority of our approach in many cases. We also extend our idea to the computation of the Bhattacharyya distance between two histograms, using a similar incremental approach that also avoid current histogram computations: we just need histograms of the reference image, and spatial differences between the reference and the current image to compute this distance using an updating process. Finally, we demonstrate the advantages of our approach on a real visual tracking application using a particle filter framework by improving its correction step computation time.     

Efficient color histogram indexing for quadratic form distancefunctions

In image retrieval based on color, the weighted distance between color histograms of two images, represented as a quadratic form, may be defined as a match measure. However, this distance measure is computationally expensive and it operates on high dimensional features (O(N)). We propose the use of low-dimensional, simple to compute distance measures between the color distributions, and show that these are lower bounds on the histogram distance measure. Results on color histogram matching in large image databases show that prefiltering with the simpler distance measures leads to significantly less time complexity because the quadratic histogram distance is now computed on a smaller set of images. The low-dimensional distance measure can also be used for indexing into the database     

OM-based video shot retrieval by one-to-one matching

This paper proposes a new approach for shot-based retrieval by optimal matching (OM), which provides an effective mechanism for the similarity measure and ranking of shots by one-to-one matching. In the proposed approach, a weighted bipartite graph is constructed to model the color similarity between two shots. Then OM based on Kuhn–Munkres algorithm is employed to compute the maximum weight of a constructed bipartite graph as the shot similarity value by one-to-one matching among frames. To improve the speed efficiency of OM, two improved algorithms are also proposed: bipartite graph construction based on subshots and bipartite graph construction based on the same number of keyframes. Besides color similarity, motion feature is also employed for shot similarity measure. A motion histogram is constructed for each shot, the motion similarity between two shots is then measured by the intersection of their motion histograms. Finally, the shot similarity is based on the linear combination of color and motion similarity. Experimental results indicate that the proposed approach achieves better performance than other methods in terms of ranking and retrieval capability.

Robust image retrieval based on color histogram of local feature regions

Color histograms lack spatial information and are sensitive to intensity variation, color distortion and cropping. As a result, images with similar histograms may have totally different semantics. The region-based approaches are introduced to overcome the above limitations, but due to the inaccurate segmentation, these systems may partition an object into several regions that may have confused users in selecting the proper regions. In this paper, we present a robust image retrieval based on color histogram of local feature regions (LFR). Firstly, the steady image feature points are extracted by using multi-scale Harris-Laplace detector. Then, the significant local feature regions are ascertained adaptively according to the feature scale theory. Finally, the color histogram of local feature regions is constructed, and the similarity between color images is computed by using the color histogram of LFRs. Experimental results show that the proposed color image retrieval is more accurate and efficient in retrieving the user-interested images. Especially, it is robust to some classic transformations (additive noise, affine transformation including translation, rotation and scale effects, partial visibility, etc.).     

一种基于彩色边缘综合特征的图像检索算法

图像特征的提取与表达是基于内容的图像检索技术基础。边缘是重要的视觉感知信息,也是图像最基本的特征之一,其在图像分析和理解中有重要价值。文中以视觉重要的图像边缘轮廓为基础,提出一种基于彩色边缘综合特征的图像检索算法。该算法首先利用Canny检测算子提取出原始图像的彩色边缘轮廓。然后构造出能全面反映边缘轮廓内容的3种直方图,即加权颜色直方图、角度直方图和梯度方向直方图。最后综合利用上述3种彩色边缘直方图计算图像间的内容相似度,并进行彩色图像检索。仿真实验表明,该算法能够准确和高效地查找出用户所需内容的彩色图像,并且具有较好的查准率和查全率。