基于改进的几何散列表的形状检索方法

文中介绍了一个基于内容的图像检索系统的设计和实现,它利用改进的几何散列技术能够获得快速而且准确的相似形状检索。系统包括四个主要部分:特征获取模块,查询管理模块,搜索引擎和一个散列表。特征信息收藏在散列表中,查询管理器接收用户的查询并从查询图像中提取出轮廓。特征获取模块对图像轮廓进行变换和量化,形成散列表的入口。给定一个视觉查询,查询代理通过使用多数投票算法对散列表进行搜索,得到一个形状具有潜在相似性的图像表。大量的实验表明该算法提供了一个可行的并且实用的相似性形状检索方法。     

利用成对几何直方图改进基于轮廓的图像检索

图像形状特征的提取和描述方法是基于形状的图像检索的重要研究内容.针对已有的基于形状的图像检索中目标形状描述方法的不足来进行了改进.为此,引入了用于描述目标轮廓的成对几何特征(pairwise attributes)即有向相对角和有向相对位置.然后应用到基于轮廓的图像检索中去,来描述图像的形状.实验结果发现用该成对几何特征所描述的形状属性来检索数据库中的图像具有较高的效率.     

轮廓检测的图像检索方法

在图像检索领域中,形状特征是图像的最重要视觉特征之一,利用形状特征进行检索可提高检索的准确性,但形状边界的自动提取一直是图像处理领域多年的难题。为了提高图像精度和准确性,提出一种基于轮廓检测的图像检索方法,首先用色彩聚类的方法对图像进行预处理,对有意义的聚类区域进行边缘追踪,然后采用基于Snake轮廓检测的算法完成图像分割,提取底层形状特征并用傅立叶描述子加以描述,进行相似度匹配。引入支持向量机的相关反馈算法来提高检索精度。实验结果表明了方法的有效性。     

基于草图查询的语义对象图像检索

针对图像低层特征和高层语义之间存在的语义鸿沟问题,提出一种结合草图查询和相关反馈的语义对象图像检索系统.该系统首先根据用户输入的手绘草图,利用形状(轮廓、区域和骨架)特征从对象库中初步检索出语义对象并保存其区域组合;然后根据用户选择的反馈对象并结合查询草图提取用户检索对象的语义特征(形状、区域及拓扑特征),最后采用寻找最优区域配对的方法在系统特征库中进行检索.实验结果表明,本文方法不但对用户需求的语义对象有较好的检索效果,而且还能较准确地在结果图像中框选出用户感兴趣的语义对象.     

基于目标形状的图像检索

针对已有的基于形状的图像检索中目标形状描述方法的不足对其进行改进。首先对目标图像进行一系列预处理,得到图像的外部轮廓,利用改进的霍夫变换提取目标轮廓的线性特征;然后引入成对几何特征即有向相对角和有向相对位置来描述图像的形状;最后利用直方图相交算法衡量图像特征间的相似度。实验证明,利用本文改进的方法所描述的形状属性来检索数据库中的图像具有较高的效率。     

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

本文主要提出了一个在形状轮廓的傅立叶描述子基础上，进行基于形状特征的图像检索的理论方法。该方法首先对图像进行预处理，利用多闽值颜色分割法提取出图像的前景对象，再采用轮廓跟踪法得到该对象的形状轮廓特征，并采用傅立叶描述子对轮廓加以描述。最后利用欧几里得距离进行相似性比较。为了验证方法的有效性，本文建立了一个基于形状检索系统的框架，实现结果和算法分析表明，该理论方法的算法复杂度为0（n^2logn），对基于形状检索的图像检索系统是有效和合理的。     

基于视觉点特征的图像检索技术研究

基于视觉点特征的图像检索是图像检索(Content Based Image Retrieval,简称CBIR)的一个子集,指利用图像中对图像的内容有显著影响的一些点特征对图像进行查询,试图在理解图像内容的基础上,检索出与示例相类似的图像。目前,CBIR技术在商标查询、罪犯比对等领域有着很重要的应用。本文主要集中在对图像的感兴趣点特征提取技术上,针对边缘方向直方图法存在的问题,提出一种基于Canny边缘提取及轮廓序列矩法,首先对图像进行预处理,然后采用Canny边缘提取方法提取图像的轮廓,最后,将该轮廓的3个矩作为最后的特征向量进行检索。实验证明,提出的算法检索效果较好。     

利用傅里叶变换边缘曲线法进行W型轮廓的快速匹配

W型轮廓标靶是一种用于汽车四轮定位的定位标靶,在一幅定位图像中能够快速地检索出与其一致的目标轮廓非常重要。传统的Hu矩、成对几何直方图算法运算速度慢,鲁棒性差。而一些适用于商标图像检索的傅里叶描述子却可以很好地适用于快速轮廓匹配,但是由于在一幅图像中进行目标轮廓的检索引入了过多的轮廓干扰,因此利用形状图像的傅里叶变换提取出轮廓的频谱特征,通过检查目标轮廓对模板轮廓频谱特征的干扰性大小来进行轮廓的相似性度量,并进行算法简化,从而达到轮廓快速匹配的目的。并且其抗干扰能力强,轮廓查找效率高。这说明利用傅里叶变换边缘曲线法进行轮廓形状匹配具有很好的适用性。     

基于轮廓的图像检索

提出了一种针对多纹理图像的基于轮廓和纹理分割的检索策略.首先提取一幅图像中各个纹理基元的轮廓,计算轮廓的Fourier形状描绘子,根据形状描绘子对轮廓聚类分组.此时,原图像被分割成几组不同形状的纹理基元轮廓,采用Gabor小波变换分别提取各组纹理基元轮廓的特征,从而将原图像表示为Gabor小波特征空间中的特征点集.最后,采用对噪音不敏感的改进Hausdorff距离计算各特征点集之间的距离,便可实现多纹理图像的检索.与已有方法相比,实验结果表明,该方法具有更好的检索精度.     

综合颜色和轮廓曲线特征的图像检索方法研究

传统的基于内容图像检索（CBIR）及跟踪算法主要利用图像的颜色、纹理等特征进行相似性比较,但大量的实验和应用也表明利用颜色和纹理进行图像相似性比较在空间结构和对象形状上难以精确控制,致使图像检索经常出现一些不可预料的结果。为了提高图像在形状、颜色及纹理上的检索精度,提出了一种综合颜色和图像轮廓曲线特征的检索方法。该方法分割图像并提取图像中感兴趣对象的轮廓,对提取的轮廓进行仿射变换及最小值化处理,经处理后的轮廓带有边缘的完整信息,具有几何不变性;利用聚类的颜色信息,提取主聚类的直方图,所提取的直方图不仅包含了主聚类的颜色信息也包含了该聚类的空间位置信息。利用检索对象与被检索对象的颜色距离直方图及轮廓曲线距离偏差的加权平均度量检索及被检索对象的相似性。实验结果表明,针对基于感兴趣对象的图像检索问题,给出了一种具有高度检索精度的算法。     

Fast Retrieval of Isolated Visual Shapes

Similarity-based retrieval from databases of isolated visual shapes has become an important information retrieval problem. The goal of the current work is to achieve high retrieval speed with reasonable retrieval effectiveness, and support for partial and occluded shape queries. In the proposed method, histograms of local shape parts are coded as index vectors. To increase retrieval accuracy, a rich set of parts at all scales of the shape is used; specifically, the parts are defined as connected sequences of regions in curvature scale space. To increase efficiency, structural indexing is used to compare the index vectors of the query and database shapes. In experimental evaluations, the method retrieved at least one similar shape in the top three retrieved items 99–100% of the time, depending on the database. Average retrieval times ranged from 0.7 ms on a 131-shape database to 7 ms on a 1310-shape database. The method is thus suitable for fast, approximate shape retrieval in comparison with more accurate but more costly structural matching.     

Structural feature indexing for retrieval of partially visible shapes

Efficient and robust information retrieval from large image databases is an essential functionality for the reuse, manipulation, and editing of multimedia documents. Structural feature indexing is a potential approach to efficient shape retrieval from large image databases, but the indexing is sensitive to noise, scales of observation, and local shape deformations. It has now been confirmed that efficiency of classification and robustness against noise and local shape transformations can be improved by the feature indexing approach incorporating shape feature generation techniques (Nishida, Comput. Vision Image Understanding 73 (1) (1999) 121-136). In this paper, based on this approach, an efficient, robust method is presented for retrieval of model shapes that have parts similar to the query shape presented to the image database. The effectiveness is confirmed by experimental trials with a large database of boundary contours obtained from real images, and is validated by systematically designed experiments with a large number of synthetic data.     

基于局部颜色空间特征的图像检索

基于图像中主要物体的尺寸动态地对图像分块来获得颜色的空间分布特征,并选取了符合人眼感知特性的HSV颜色空间进行非均匀量化,提取各个分块的主色及其所占的百分比作为颜色综合特征矢量,根据所提出的综合特征矢量给出相应的相似度计算方法,同时构造出相似矩阵进行基于颜色内容的图像检索,能通过调整各个分块的权值来进一步提高检索的精度,最后将文中提出的方法与传统的全局直方图方法相比较,可知文中的方法因为利用了动态分块的方法,考虑了颜色的空间信息以及权值的调整,从而取得了比较好的检索结果。     

一种新的基于分块颜色和形状的图像检索方法

基于图像单一特征的检索方法只能反映图像的部分属性，应用范围受到限制。本文在分析图像颜色和形状特征的基础上，根据各自的特点，提出了一种新的基于分块颜色和形状的图像检索方法。首先，在图像分块的基础上提取颜色和特征点；其次，根据特征点提取图像的形状信息；最后，以颜色和形状作为综合特征，采用相应的匹配算法进行图像检索。实验证明该方法不仅准确度高，而且还可应用于基于对象或区域的图像查询中。     

Aviation maintenance technician scheduling with personnel satisfaction based on interactive multi-swarm bacterial foraging optimization

This study focuses on the challenges of aviation maintenance technician (AMT) scheduling and constructs a model based on personnel satisfaction and the parallel execution of aircraft maintenance tasks. To obtain the scheduling scheme from the constructed NP-hard model, an interactive multi-swarm bacterial foraging optimization (IMSBFO) algorithm is proposed using multi-swarm coevolution, structural recombination, and three information interactive mechanisms among individuals. Moreover, considering the distributed feature of the AMT scheduling problem, a specific mechanism is designed to convert continuous solution to a binary AMT scheduling scheme. Finally, a series of comparative experiments highlight the efficiency and superiority of our proposed IMSBFO algorithm, and the optimal scheduling scheme owns the delicate balance between the work and rest time.     

基于LBP值对空间统计特征的纹理描述符

针对基于内容图像检索应用背景下局部二值模式(LBP)描述符缺乏空间描述能力及所需特征矢量维数较长的不足, 提出一种基于LBP值对空间统计特征构建的改进纹理描述符(ILBP)。ILBP描述符首先利用LBP微模式编码方法将原始图像转换为LBP伪灰度图像, 然后再提取出多个关于LBP值对空间分布关系统计值构成描述图像特征的特征矢量。在基于内容的图像检索原型测试平台上完成大量实验。实验结果表明, 与LBP及其各类变种描述符相比, ILBP描述符在进一步增强LBP描述符描述能力的同时大幅度压缩特征矢量维数, 具有更好的查询正确率和查询效率。     

Integrating symbolic images into a multimedia database system using classification and abstraction approaches

Symbolic images are composed of a finite set of symbols that have a semantic meaning. Examples of symbolic images include maps (where the semantic meaning of the symbols is given in the legend), engineering drawings, and floor plans. Two approaches for supporting queries on symbolic-image databases that are based on image content are studied. The classification approach preprocesses all symbolic images and attaches a semantic classification and an associated certainty factor to each object that it finds in the image. The abstraction approach describes each object in the symbolic image by using a vector consisting of the values of some of its features (e.g., shape, genus, etc.). The approaches differ in the way in which responses to queries are computed. In the classification approach, images are retrieved on the basis of whether or not they contain objects that have the same classification as the objects in the query. On the other hand, in the abstraction approach, retrieval is on the basis of similarity of feature vector values of these objects. Methods of integrating these two approaches into a relational multimedia database management system so that symbolic images can be stored and retrieved based on their content are described. Schema definitions and indices that support query specifications involving spatial as well as contextual constraints are presented. Spatial constraints may be based on both locational information (e.g., distance) and relational information (e.g., north of). Different strategies for image retrieval for a number of typical queries using these approaches are described. Estimated costs are derived for these strategies. Results are reported of a comparative study of the two approaches in terms of image insertion time, storage space, retrieval accuracy, and retrieval time. Received June 12, 1998 / Accepted October 13, 1998     

Super-vector coding features extracted from both depth buffer and view-normal-angle images for part-based 3D shape retrieval

We have witnessed 3D shape models abundant in many application fields including 3D CAD/CAM, augmented/mixed reality (AR/MR), and entertainment. Creating 3D shape models from scratch is still very expensive. Efficient and accurate methods for shape retrieval is essential for 3D shape models to be reused. To retrieve similar 3D shape models, one must provide an arbitrary 3D shape as a query. Most of the research on 3D shape retrieval has been conducted with a “whole” shape as a query (aka whole-to-whole shape retrieval), while a “part” shape (aka part-to-whole shape retrieval) is more practically requested as a query especially by mechanical engineering with 3D CAD/CAM applications. A “part” shape is naturally constructed by a 3D range scanner as an input device. In this paper, we focus on the efficient method for part-to-whole shape retrieval where the “part” shape is assumed to be given by a 3D range scanner. Specifically, we propose a Super-Vector coding feature with SURF local features extracted from the View-Normal-Angle image, or the image synthesized by taking account of the angle between the view vector and the surface normal vector, together with the depth-buffered image, for part-to-whole shape retrieval. In addition, we propose a weighted whole-to-whole re-ranking method taking advantage of global information based on the result of part-to-whole shape retrieval. Through experiments we demonstrate that our proposed method outperforms the previous methods with or without re-ranking.     

Euler vector for search and retrieval of gray-tone images.

A new combinatorial characterization of a gray-tone image called Euler Vector is proposed. The Euler number of a binary image is a well-known topological feature, which remains invariant under translation, rotation, scaling, and rubber-sheet transformation of the image. The Euler vector comprises a 4-tuple, where each element is an integer representing the Euler number of the partial binary image formed by the gray-code representation of the four most significant bit planes of the gray-tone image. Computation of Euler vector requires only integer and Boolean operations. The Euler vector is experimentally observed to be robust against noise and compression. For efficient image indexing, storage and retrieval from an image database using this vector, a bucket searching technique based on a simple modification of Kd-tree, is employed successfully. The Euler vector can also be used to perform an efficient four-dimensional range query. The set of retrieved images are finally ranked on the basis of Mahalanobis distance measure. Experiments are performed on the COIL database and results are reported. The retrieval success can be improved significantly by augmentiong the Euler vector by a few additional simple shape features. Since Euler vector can be computed very fast, the proposed technique is likely to find many applications to content-based image retrieval.