基于颜色直方图的图像检索技术

使用颜色空间分布熵来表示图像的颜色空间分布特征,结合图像的颜色直方图特征,采用加权综合法和比例系数法表示图像的综合特征,设计了基于颜色直方图和图像空间分布熵的图像检索算法.利用查全率和查准率对算法进行了评价.通过实验分析比较可知,所设计的方法具有较好的查准率和查全率.     

改进的基于直方图和空间特征的图像检索

在主要面积直方图算法的基础上,分析了图像灰度连通区域的空间分布特征,并结合主要面积直方图进行图像检索,进一步提高了算法的检索性能.同时,结合人眼视觉特性,对图像的灰度进行了量化,在不降低检索性能的基础上降低了计算和时间复杂度.     

基于图像检索的三种相似性测量算法的比较

文中在分析和总结现有的技术和系统的基础上,对基于颜色特征的图像检索进行初步探讨。在对颜色的基本属性及各种颜色空间进行研究后,实现了颜色直方图、颜色矩等颜色特征的提取,实现并比较了相似性计算中几个距离算法。通过MFC平台,实现了自己的基于颜色特征的图像检索系统(CBIR)。该系统能够从文件夹存储的图像中提取颜色特征,与样本图像的颜色特征进行比较,实现了多种颜色特征提取算法,速度比较快,查准率、查全率较好。     

基于兴趣点局部分布特征的图像检索方法

提出了一种基于兴趣点颜色和空间分布特征的图像检索方法。该方法把图像内容看作为由若干兴趣点组成的集合,首先利用小波系数的空间方向树特性来检测兴趣点,然后利用基于兴趣点的环形颜色直方图和空间离散度来描述图像的特征,最后用加权特征距离来估计图像内容的相似度。同时,通过利用环形颜色直方图和空间离散度作为图像特征保证了该算法能够对图像的尺度变化、旋转变化和平移变化具有很好的抑制能力。在含有1000幅图像的数据库上所做的一系列实验表明,该算法与其它基于兴趣点的方法相比,能够更准确和高效地查找出用户所需的图像,明显地提高了检索精度。     

基于颜色空间分布熵的图像检索

颜色直方图是基于内容的图像检索(CBIR)中的一种重要特征,然而其完全丢失了图像颜色的空间分布信息.文中采用颜色空间熵描述图像颜色的空间分布特征,为了消除熵的对称性对图像检索的影响,提出了改进算法.通过实验比较表明了该方法在进行图像检索时是有效的,并具有较高的检索性能.     

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

以图像颜色聚合向量为基础,并结合图像显著特征,提出了一种基于加权颜色聚合向量的图像检索方法.首先,提取图像的显著性图,并进行归一化处理,得到加权矩阵;然后,对图像进行颜色聚合向量提取,并根据加权矩阵进行加权处理;最后通过计算两幅图像之间的加权颜色聚合向量相似度,进行图像检索.该方法既系统兼顾了图像的颜色分布特征和高层视觉特征,又具有较高的计算速度;实验结果证明,该算法的检索精度明显高于传统的基于颜色统计特征的检索精度.     

基于特征元素的图像检索方法

该文提出了一种基于特征元素的新的图像俭索算法。持征元素与特征向量相比更注重根据人的主观感知来表达图像的视觉特征.在特征元素的基础上,该文先定义了图像间的相似性度量,即特征元素间的距离,又分别实现了对不同特征元素类别的距离计算。检索实验表明,基于特征元素的图像检索算法能够取得更符合人们视觉感知的结果。     

基于图像信息熵与空间分布熵的彩色图像检索方法

在分析基于颜色直方图及信息熵进行图像检索的基础上,提出了一种改进的基于信息熵的图像检索算法,该方法同以往的基于信息熵的图像检索算法相比具有更强的鲁棒性．同时,文中又提出利用空间分布熵描述图像颜色的空间分布信息,并给出了一种基于图像信息熵与空间分布熵的彩色图像检索算法．试验结果表明,该方法效果良好,大大提高了图像检索的速度．     

一种基于颜色视觉敏感度的特征提取算法

特征选择技术对于图像检索系统有效实现相关目标的识别具有重要的意义.依据视觉生理学和视觉心理学关于不同颜色间存在敏感度差异的理论,并利用Stevens法则和HSV颜色空间的六棱锥模型,提出了一种构造颜色敏感度函数的算法.新算法以主观信息量多少为评价标准,通过系数补偿,实现了显著程度不同颜色间特征幅值的平衡,从而提高了检索特征与感知特征的一致性.实验结果证明了新算法能够稳定、有效地提升图像检索系统的性能.     

基于颜色分布特征的图像检索

颜色直方图是基于内容的图像检索（CBIR）中的一种重要特征，然而其完全丢弃了图像颜色的空间分布信息，为了有效地利用图像颜色的空间分布信息，提出采用颜色分布熵（CDE）描述图像颜色的分布特征，并根据人的视觉特性及信息熵的特性，提出了进一步的改进算法。同以往的方法进行比较结果表明，该方法在图像的相似性检索时是很有效的，并具有较高的检索效率。     

Saliency detection using joint spatial-color constraint and multi-scale segmentation

In this paper, a novel method is proposed to detect salient regions in images. To measure pixel-level saliency, joint spatial-color constraint is defined, i.e., spatial constraint (SC), color double-opponent (CD) constraint and similarity distribution (SD) constraint. The SC constraint is designed to produce global contrast with ability to distinguish the difference between “center and surround”. The CD constraint is introduced to extract intensive contrast of red-green and blue-yellow double opponency. The SD constraint is developed to detect the salient object and its background. A two-layer structure is adopted to merge the SC, CD and SD saliency into a saliency map. In order to obtain a consistent saliency map, the region-based saliency detection is performed by incorporating a multi-scale segmentation technique. The proposed method is evaluated on two image datasets. Experimental results show that the proposed method outperforms the state-of-the-art methods on salient region detection as well as human fixation prediction.     

基于双引导滤波的红外和可见光图像融合算法

图像融合是将多幅图像中有用或互补信息整合成一幅图像的过程。本文提出了一种基于引导滤波多尺度分解的红外和可见光图像融合算法。在传统的引导滤波图像融合算法的基础之上,利用双引导滤波器代替均值滤波器将源图像分解为小尺度纹理细节、大尺度边缘和基础图像;直接利用纹理细节及边缘层图像构建显著性映射图,用其代替额外的特征提取操作,可很好地突出源图像显著性信息的同时大大降低算法复杂度;利用显著性映射图、Sigmoid函数构造权重图,将源图像中具有视觉意义的信息注入到融合图像中;利用色彩模型转换融合方式,可更好保留图像的色彩信息。定性和定量实验结果证明,相比于传统的基于引导滤波的图像融合算法,本文算法的融合效果得到进一步提升。     

局部和全局特征融合的红外图像显著性检测

为了更好地凸显复杂环境的红外目标特征,提出 一种融合局部和全局特征的红外图像 显著性检测方法。在获取图像超像素的基础上,提取每个区域空间距离加权的邻域对比度特 征,并考虑区域大小和位置的影响,构建局部显著图;然后提取每个区域空间距离加权的全 局灰度特征,构建全局显著图;最后融合局部和全局显著图,实现图像显著性检测。实验结 果 表明,本文方法的显著图结果目标区域一致高亮且边缘清晰,同时背景杂波抑制效果好。无 论 主观评价还是客观指标,本文方法都优于当前流行的图像显著性检测方法。     

基于显著性和ORB的红外和可见光图像配准算法

针对红外与可见光图像配准过程过受灰度差异影响大、特征点难配准的问题,提出基于显著性检测和ORB特征点的图像配准算法。首先利用优化的HC-GHS显著性检测算法得到图像的显著性结构图；其次利用ORB算法在显著性结构图上进行特征点检测,利用泰勒级数筛选出鲁棒性强的特征点,并根据特征点的方向进行分组匹配的策略；最后利用汉明距离实现特征点的匹配。实验表明本文算法能准确实现红外与可见光图像之间的配准,在红外噪声干扰、尺度变化下都具有良好效果。     

Saliency-based content-aware lifestyle image mosaics

In this paper, a novel content-aware lifestyle image mosaic technique is proposed based on image saliency. The image saliency is used in the whole process of creating mosaics. Firstly, a novel energy map for variable-size tile decomposition is proposed by combining Neighborhood Inhomogeneity Factor and Graph-Based Visual Saliency. The target image is divided into small tiles with variable sizes based on the energy map. Secondly, saliency-weighted image retrieval is introduced to choose the tile images from a certain image database. Different aspect ratio between the tile and the corresponding tile image may lead to obvious distortion. Therefore, before filled into the tile, the chosen tile image is resized by seam carving to change its aspect ratio. At last, color correction is done on the mosaic result to improve the color similarity. Compared with other mosaic methods, the proposed technique creates much better mosaics in visual aspect.     

Patchwise scaling method for content-aware image resizing

Image resizing becomes more and more important in content-aware image displaying. This paper proposes a patchwise scaling method to resize an image to emphasize the important areas and preserve the globally visual effect (smoothness, coherence and integrity). This method for resizing image is based on optimizing the image distance presented in this paper. The image distance is defined based on so-called local bidirectional similarity measurement and smoothness measurement to quantify the quality of resizing outputs. The original image is divided into small important patches and unimportant patches based on an important map. The important map is generated automatically using a novel combination of image edge and saliency measurement. A scaling factor is computed for each small patch. The resized image is produced by iteratively optimizing, which is based on our image distance, the scaling factor for each small patch. Experiments of different type images demonstrate that our method can be effectively used in image processing applications to locally shrink and enlarge important areas while preserving image quality.     

Saliency detection in the compressed domain for adaptive image retargeting

Saliency detection plays important roles in many image processing applications, such as regions of interest extraction and image resizing. Existing saliency detection models are built in the uncompressed domain. Since most images over Internet are typically stored in the compressed domain such as joint photographic experts group (JPEG), we propose a novel saliency detection model in the compressed domain in this paper. The intensity, color, and texture features of the image are extracted from discrete cosine transform (DCT) coefficients in the JPEG bit-stream. Saliency value of each DCT block is obtained based on the Hausdorff distance calculation and feature map fusion. Based on the proposed saliency detection model, we further design an adaptive image retargeting algorithm in the compressed domain. The proposed image retargeting algorithm utilizes multioperator operation comprised of the block-based seam carving and the image scaling to resize images. A new definition of texture homogeneity is given to determine the amount of removal block-based seams. Thanks to the directly derived accurate saliency information from the compressed domain, the proposed image retargeting algorithm effectively preserves the visually important regions for images, efficiently removes the less crucial regions, and therefore significantly outperforms the relevant state-of-the-art algorithms, as demonstrated with the in-depth analysis in the extensive experiments.     

融合颜色特征和对比度特征的图像显著性检测

图像显著性检测能够获取一幅图像的视觉显著性区域,是计算机视觉的研究热点之一。提出一种结合颜色特征和对比度特征的图像显著性检测方法。首先构造图像在HSV空间的颜色函数以获取图像颜色特征;然后使用SLIC超像素分割算法对图像进行预处理,基于超像素块的对比度特征计算图像显著性;最后将融合颜色特征和对比度特征的显著图经过导向滤波优化形成最终的显著图。使用本文算法在公开数据集MSRA-1000上进行图像显著性检测,并与其他6种算法进行比较。实验结果表明本文算法结合了图像像素点和像素块的信息,检测的图像显著性区域轮廓更加完整,优于其他方法。     

A depth perception and visual comfort guided computational model for stereoscopic 3D visual saliency

With the emerging development of three-dimensional (3D) related technologies, 3D visual saliency modeling is becoming particularly important and challenging. This paper presents a new depth perception and visual comfort guided saliency computational model for stereoscopic 3D images. The prominent advantage of the proposed model is that we incorporate the influence of depth perception and visual comfort on 3D visual saliency computation. The proposed saliency model is composed of three components: 2D image saliency, depth saliency and visual comfort based saliency. In the model, color saliency, texture saliency and spatial compactness are computed respectively and fused to derive 2D image saliency. Global disparity contrast is considered to compute depth saliency. Particularly, we train a visual comfort prediction function to distinguish stereoscopic image pair as high comfortable stereo viewing (HCSV) or low comfortable stereo viewing (LCSV), and devise different computational rules to generate a visual comfort based saliency map. The final 3D saliency map is obtained by using a linear combination and enhanced by a “saliency-center bias” model. Experimental results show that the proposed 3D saliency model outperforms the state-of-the-art models on predicting human eye fixations and visual comfort assessment.