A wavelet based multiresolution algorithm for rotation invariant feature extraction

The present work aims at proposing a new wavelet representation formula for rotation invariant feature extraction. The algorithm is a multilevel representation formula involving no wavelet decomposition in standard sense. Using the radial symmetry property, that comes inherently in the new representation formula, we generate the feature vectors that are shown to be rotation invariant. We show that, using a hybrid data mining technique, the algorithm can be used for rotation invariant content based image retrieval (CBIR). The proposed rotation invariant retrieval algorithm, suitable for both texture and nontexture images, avoids missing any relevant images but may retrieve some other images which are not very relevant. We show that the higher precision can however be achieved by pruning out irrelevant images.     

基于Contourlet旋转不变特征的遥感图像检索

除了具有纹理属性外,遥感图像中还包含大量的结构性边缘特征,如何有效捕捉这些特征中的信息进行检索,成为提高遥感图像检索效率的关键。文章依据Contourlet在离散域的多尺度几何分析的功能,提出一种利用Contourlet子带能量分布特性提取原始图像在多个尺度下的边缘方向信息进行检索的方法。针对Contourlet变换捕获不同特征方向能力的差别,文章采用正交补偿法加以改正,并通过傅里叶算子的处理,实现基于结构性边缘特征旋转不变的图像检索。实验结果表明,该检索算法对含有丰富规则边缘特征的遥感图像更为有效。     

Extraction of major object features using VQ clustering for content-based image retrieval

An image representation method using vector quantization (VQ) on color and texture is proposed in this paper. The proposed method is also used to retrieve similar images from database systems. The basic idea is a transformation from the raw pixel data to a small set of image regions, which are coherent in color and texture space. A scheme is provided for object-based image retrieval. Features for image retrieval are the three color features (hue, saturation, and value) from the HSV color model and five textural features (ASM, contrast, correlation, variance, and entropy) from the gray-level co-occurrence matrices. Once the features are extracted from an image, eight-dimensional feature vectors represent each pixel in the image. The VQ algorithm is used to rapidly cluster those feature vectors into groups. A representative feature table based on the dominant groups is obtained and used to retrieve similar images according to the object within the image. This method can retrieve similar images even in cases where objects are translated, scaled, and rotated.     

一种基于灰度共生矩阵的云图检索方法

卫星云图检索可帮助气象预报人员快速定位历史相似天气．根据云图纹理特征区分度较大的特点提出一种采用纹理特征对卫星云图进行相似性检索的方法。针时找到一个普遍适用的纹理特征非常困难的问题．提出一种根据特征值的方差分布情况从大量备选特征中快速找出适合某类图像检索所需的纹理特征值的方法,并以灰度共生矩阵的特征值提取为例．对卫星云图进行相似性检索。检索流程为：首先对云图进行云地分离的预处理．然后从云图的灰度共生矩阵中提取有效的检索特征生成特征值．并与历史云图库对应的特征库进行相似距离计算．最后根据距离的排序顺序输出最终的检索结果。实验表明．该方法能有效地从历史云图库中检索出具有相似视觉特征的云图．说明该方法可以用于卫星云图的相似性检索。     

用不变矩和边界方向进行形状检索

基于形状的图像检索一直以来是图像内容检索的一个难点问题，而目前采用周长、面积、边角率等描述形状的方法不能使形状检索达到理想的效果．本文提出了一种新的针对图像形状的检索方法．首先，用Canny算子对图像进行平滑处理，提取图像边界方向直方图特征、其次，用不变矩来描述图像形状的区域特征，不变矩特征不受图像的缩放、平移和旋转的影响．最后，为了克服不变矩只关心对象区域，而对图像边界忽视的缺点，提出了不变矩与边界方向特征相结合的方法，使得检索取得更好的效果．本文通过对医学图像的形状检索实验，给出了实验结果和结论．     

K均值聚类分割的多特征图像检索方法

从图像数据库中快速、准确地检索出所需要的图像,具有广泛的应用前景。针对使用单一图像特征难以准确表达图像之间的差异问题,提出了一种利用颜色聚类分割和形状特征提取的图像检索算法。选择符合人眼视觉特征的HSV空间,分别重组最能描述图像颜色特征的H分量和形状特征的V分量;用K均值聚类算法对两个分量进行聚类分割,得到目标物体;提取目标物体的Hu不变矩和傅里叶描述子来描述形状特征;用欧式距离进行相似度测量并用于图像检索中。采用不同类型图像进行实验,结果表明该算法优于使用单一特征和一般分割方法的图像检索技术。     

Indexing shapes in image databases using the centroid–radii model

In content-based image retrieval systems, the content of an image such as color, shapes and textures are used to retrieve images that are similar to a query image. Most of the existing work focus on the retrieval effectiveness of using content for retrieval, i.e., study the accuracy (in terms of recall and precision) of using different representations of content. In this paper, we address the issue of retrieval efficiency, i.e., study the speed of retrieval, since a slow system is not useful for large image databases. In particular, we look at using the shape feature as the content of an image, and employ the centroid–radii model to represent the shape feature of objects in an image. This facilitates multi-resolution and similarity retrievals. Furthermore, using the model, the shape of an object can be transformed into a point in a high-dimensional data space. We can thus employ any existing high-dimensional point index as an index to speed up the retrieval of images. We propose a multi-level R-tree index, called the Nested R-trees (NR-trees) and compare its performance with that of the R-tree. Our experimental study shows that NR-trees can reduce the retrieval time significantly compared to R-tree, and facilitate similarity retrieval. We note that our NR-trees can also be used to index high-dimensional point data commonly found in many other applications.     

一种基于形状特征的颅骨图像检索方法

提出了一种基于内容的颅骨图像检索方法，介绍了基于内容的医学图像检索系统结构，阐述了图像预处理方法和特征参数提取过程。实验表明，该方法能检索出有相同病理特征的相似颅骨图像。     

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.     

距离分布直方图及其在商标图案检索中的应用

形状是描述图象的重要视觉特征,它可以通过像素点分布在空间不同的区域而表现出来,针对二值图象提出了一种基于区域的形状特征,即距离分布直方图,它的基本思想就是通过统计图象中像素点的距离区域的分布情况来获得形状特征。其中,基准点的选择和距离区域的划分是两具重要的部分,实验结果表明,距离分布直方图能够有效地刻画出二值图象的形状特征,并且具有非常好的平移。尺度和旋转不变性,将其应用于商标图案检索,其检索结果符合人眼的视觉感受。     

Image Annotation and Retrieval for Weakly Labeled Images Using Conceptual Learning

One of the most promising new technologies for widespread application is image annotation and retrieval. Nevertheless, this task is very difficult to accomplish as target images differ significantly in appearance and belong to a wide variety of categories. In this paper, we propose a new image annotation and retrieval method for miscellaneous weakly labeled images, by combining higher-order local auto-correlation (HLAC) features and a framework of probabilistic canonical correlation analysis. The distance between images can be defined in the intrinsic space for annotation using conceptual learning of images and their labels. Because this intrinsic space is highly compressed compared to the image feature space, our method achieves both faster and more accurate image annotation and retrieval. The HLAC features are powerful global features with additive and position invariant properties. These properties work well with images, which have an arbitrary number of objects at arbitrary locations. The proposed method is shown to outperform existing methods using a standard benchmark dataset.     

New Spiking Cortical Model for Invariant Texture Retrieval and Image Processing

Based on the studies of existing local-connected neural network models, in this brief, we present a new spiking cortical neural networks model and find that time matrix of the model can be recognized as a human subjective sense of stimulus intensity. The series of output pulse images of a proposed model represents the segment, edge, and texture features of the original image, and can be calculated based on several efficient measures and forms a sequence as the feature of the original image. We characterize texture images by the sequence for an invariant texture retrieval. The experimental results show that the retrieval scheme is effective in extracting the rotation and scale invariant features. The new model can also obtain good results when it is used in other image processing applications.      

基于形状特征和颜色的服装图像检索

提出将基于内容的图像检索用于电子购物中,首先利用不变矩的形状特征检索,为提高检索效果引入离心率特征,接着再利用改进的颜色直方图进行检索。通过实验证明该方法的有效性和可行性。     

基于组合欧拉向量与边缘方向直方图的图像检索方法

在图像数据库中,如何有效检索和查询图像是一个重要的研究内容.文中提出一种结合组合欧拉向量与边缘方向直方图( EOH)的图像检索方法.首先,从边缘图像中提取组合欧拉向量特征进行图像检索(EEXO算法),其次,为更好地区分不同形状但欧拉特征相近的图像,将EEXO算法与EOH算法相结合提出EEXOEOH图像检索算法.实验结果表明,EEXOEOH算法与其它4种算法相比,具有较好的检索效率.     

基于内容的图像检索算法研究

在基于内容的图像检索中,图像特征的提取和匹配是两个关键性环节.相对于传统的方法(采用图像的单一特征和相似性计算标准的方法),提出了提取多种图像特征,并对不同的特征采用不同的相似性计算标准方法进行图像检索,采用动态权值的方法对检索出的图像的给出最终排名,实验结果表明,该方法具有更好的适应性和鲁棒性.     

基于文本与语义相关性分析的图像检索

为了更加有效地检索到符合用户复杂语义需求的图像，提出一种基于文本描述与语义相关性分析的图像检索算法。该方法将图像检索分为两步：基于文本语义相关性分析的图像检索和基于SIFT特征的相似图像扩展检索。根据自然语言处理技术分析得到用户文本需求中的关键词及其语义关联，在选定图像库中通过语义相关性分析得到“种子”图像；接下来在图像扩展检索中，采用基于SIFT特征的相似图像检索，利用之前得到的“种子”图像作为查询条件，在网络图像库中进行扩展检索，并在结果集上根据两次检索的图像相似度进行排序输出，最终得到更加丰富有效的图像检索结果。为了证明算法的有效性，在标准数据集Corel5K和网络数据集Deriantart8K上完成了多组实验，实验结果证明该方法能够得到较为精确地符合用户语义要求的图像检索结果，并且通过扩展算法可以得到更加丰富的检索结果。     

形状和颜色混合不变量在图像检索中的应用

多视觉特征的图像检索是当前基于内容的图像检索领域的重要方向.已有的多特征的检索主要通过线性加权的方法对特征进行组合,但这种组合方式仅实现了代数意义上的合并,未能真正利用和发掘特征间存在的相互关系,并且权重值不容易确定,检索结果易受权重值的影响.针对这一问题,提出一种形状-颜色混合不变特征的构造方法,特征提取的过程包含同时对形状、颜色信息的抽取,直接构造出能够同时对形状仿射变换和颜色对角-偏移变换具有不变性的特征,也称作形状-颜色矩不变量.首先分别在图像的2维几何空间、3维颜色空间定义形状核、颜色核,然后对形状核、颜色核的乘积进行多重积分,最后做规范化,就得到一个不变量.理论上,通过选择不同的形状核、颜色核可以推导出无穷多的不变量.实验结果表明,该方法优于加权组合特征的方法;与加权特征、局部特征相比,形状-颜色矩不变量对于同一物体不同成像条件下的近复制图像、整体属性相似的图像、大体类似的物体图像等表现出较高的检索性能及效率.     

基于纹理和高斯密度特征的图像检索算法

直接从DCT域中提取图像的特征是提高图像的检索效率的方法.直接从压缩域中提取图像的高斯密度,即计算图像在8个方向上的分段累加值,形成一个8*4的二维向量,再结合图像的纹理特征来进行图像检索.为了验证算法的可行性,建立了10000幅图像的图像库.实验结果表明,该方法能够准确地检索出目标图像,有效地提高了图像检索的精度和速度.     

基于内容的图像检索相关反馈算法的改进

基于内容的图像检索研究(Content-based Image Retrieval, CBIR)的目的是实现自动地、智能地检索图像,研究的对象是使查询者可以方便、快速、准确地从图像数据库中查找特定图像的方法和技术.本文在改进传统的相关反馈算法基础上,引入可更新的特征库,可以将用户反馈的信息逐步嵌入到这个可更新特征库中.实验结果证实了本文改进算法的有效性.