车辆路径问题的禁忌搜索算法研究

简要回顾了车辆路径问题的禁忌搜索算法的发展现状,提出了一种改进的禁忌搜索算法。该算法将路径问题按不同的车辆-顾客分配结构分解成若干子问题,然后用禁忌搜索算法求解每个子问题,最后从所有子问题的最优解中选出全局最优解。理论分析和实验结果表明该算法比以往的算法有以下优点：拓展了搜索空间,提高了最优解的效果;是一种将问题进行空间分解的并行算法,可采用多台计算机同时运算以减少整体运行时间。     

基于局部禁忌搜索策略的连续空间蚁群算法

针对蚁群算法容易陷入局部最优解及搜索时间长等不足,引入一种基于连续空间的禁忌搜索算法,并将其与蚁群算法相结合,提出了一种引入禁忌搜索策略的蚁群算法,以求解连续对象优化问题。经测试验证了该算法不仅跳出局部最优解的能力更强,而且能较快地收敛到全局最优解,表明算法的有效性。     

一种偏好于查询子流形的半监督图像检索算法

在基于反馈的图像检索中,由于被用户标记为相关和不相关的图像数较少,使得检索问题变成了一个典型的小样本问题.流形可表达数据在低维空间中的内在几何结构,流形正则化的目的是利用这种几何结构来约束解空间,以使最优解能反映数据本身的几何分布.为了解决反馈检索中的小样本问题,本文在流形正则化框架下提出一个新的半监督图像检索算法.在新算法中,流形正则化项只依赖于文中定义的查询子流形,而不依赖于数据集的全局结构.在两个图像集上的实验结果对比表明,本文提出的新算法在检索效果上优于现有的4种state-of-the-art算法.     

基于禁忌搜索算法求解随机约束满足问题

为了求解具有增长取值域的随机约束满足问题（CSP）,提出了一种基于禁忌搜索并与模拟退火相结合的算法。首先,利用禁忌搜索得到一组启发式的初始赋值,即由一个随机初始化的可行解通过邻域构造一组候选解,再利用禁忌表使候选解向最小化目标函数值的方向移动;如果得到的最优赋值不是问题的解,就把它作为启发式的初始赋值,再执行模拟退火对这组赋值进行修正直到得到全局最优解。数值实验结果表明,所提算法在接近问题的理论相变阈值时仍然能有效地找到问题的解,与其他局部搜索算法相比,表现出了显著的优越性,可用于随机CSP的算法设计。     

禁忌搜索算法

随着网络应用不断广泛,网络数据也呈几何级增长。基于内容的图像搜索算法成为一个很好的解决方案。该文为图像提取方法提供了一个新的高效的框架,该算法框架相对于以前所使用的基于流形的方法具有明显的优势:本方法框架可以直接对图像数据评定相关性并返回相关性最高的图像数据,而以往的基于流形的方法必须要从特征空间到一个不清晰的语义流形空间做一个映射,并对这个映射进行学习。     

混合流水车间调度的变邻域禁忌搜索算法

针对混合流水车间系统的最小化Makespan调度问题,提出一种基于关键路径理论的变邻域禁忌搜索算法,讨论其关键技术。在该算法中,提出基于关键路径的毗邻域概念,防止搜索算法陷入局部最优解,采用变邻域搜索策略,在无法改进解时,实现对移动毗邻域的搜索。仿真结果表明,该算法获得的调度结果优于简化禁忌搜索和启发式算法。     

基于双禁忌对象的并行禁忌搜索算法

禁忌搜索算法是解决组合优化问题的一种主要方法,是克服NP完全问题的一个有效途径。随着计算网格的发展,将禁忌搜索算法引入到这种分布式并行计算环境中,具有广泛的应用价值。提出了一个基于双禁忌对象的禁忌搜索算法,在此算法的基础上,利用并行化分散搜索策略来提高算法的求解精度。实验结果表明该并行禁忌搜索算法性能较高。     

基于选择关系嵌入算法的图像检索方法

结合流形学习和相关反馈技术的图像检索方法关键是结合低层可视化信息,从少量用户反馈信息中学习用户语义,以获得语义子空间流形。为获得更真实的语义子空间,文中在区分对待低层可视化和用户反馈信息的同时,基于低层可视化信息选择学习反馈信息中的类内和类间关系,提出一种选择关系嵌入算法应用于图像检索。该方法可保留更真实的语义流形结构,从而提高在低维空间中的检索精度。实验结果表明文中方法可将图像映射到更广范围的低维空间,在反馈迭代两次之后检索精度提高最高可达16。3%。     

用于求解单机调度问题的混合禁忌搜索算法

针对工件不同释放时间和实际加工时间之和的学习效应情况,研究单机调度总完工时间最小化问题。根据问题的NP-hard特性,证明2个优先规则,结合禁忌搜索算法与优先规则,提出一个混合禁忌搜索算法,提高了算法跳出局部最优的能力,既保留了优异的基因又扩大了领域的搜索范围。实验结果表明,与基准算法相比,该算法在求解质量上有更好的表现,而且随着工件规模的增加优势更加明显。     

一种改进的禁忌搜索算法求解背包问题

提出一种改进的禁忌搜索算法来求解背包问题.该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局部最优解的变异算子.改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象.通过对具体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能.     

基于黎曼流形稀疏编码的图像检索算法

针对视觉词袋（Bag-of-visual-words,BOVW）模型直方图量化误差大的缺点,提出基于稀疏编码的图像检索算法.由于大多数图像特征属于非线性流形结构,传统稀疏编码使用向量空间对其度量必然导致不准确的稀疏表示.考虑到图像特征空间的流形结构,选择对称正定矩阵作为特征描述子,构建黎曼流形空间.利用核技术将黎曼流形结构映射到再生核希尔伯特空间,非线性流形转换为线性稀疏编码,获得图像更准确的稀疏表示.实验在Corel1000和Caltech101两个数据集上进行,与已有的图像检索算法对比,提出的图像检索算法不仅提高了检索准确率,而且获得了更好的检索性能.     

Learning a hierarchical image manifold for Web image classification

Image classification is an essential task in content-based image retrieval.However,due to the semantic gap between low-level visual features and high-level semantic concepts,and the diversification of Web images,the performance of traditional classification approaches is far from users’ expectations.In an attempt to reduce the semantic gap and satisfy the urgent requirements for dimensionality reduction,high-quality retrieval results,and batch-based processing,we propose a hierarchical image manifold with novel distance measures for calculation.Assuming that the images in an image set describe the same or similar object but have various scenes,we formulate two kinds of manifolds,object manifold and scene manifold,at different levels of semantic granularity.Object manifold is developed for object-level classification using an algorithm named extended locally linear embedding(ELLE) based on intra-and inter-object difference measures.Scene manifold is built for scene-level classification using an algorithm named locally linear submanifold extraction(LLSE) by combining linear perturbation and region growing.Experimental results show that our method is effective in improving the performance of classifying Web images.     

基于语义学习的图像多模态检索

针对语义鸿沟问题,在语义学习的基础上设计图像的多模态检索系统。该系统结合3种查询方式进行图像检索。基于视觉特征的查询通过特征提取与相似度匹配进行排位。基于标签的查询建立在图像自动标注的基础上,但在语义空间之外的泛化能力较差。基于语义图例的查询能够在很大程度上克服这个缺陷,通过在显式或隐式的语义空间上进行查询,使检索结果更符合人类感知。实验结果表明,与基于纹理特征的图像检索相比,基于语义图例的检索具有更高的精度及召回率。     

HBIR: Hypercube-Based Image Retrieval

In this paper, we propose a mapping from low level feature space to the semantic space drawn by the users through relevance feedback to enhance the performance of current content based image retrieval (CBIR) systems. The proposed approach makes a rule base for its inference and configures it using the feedbacks gathered from users during the life cycle of the system. Each rule makes a hypercube (HC) in the feature space corresponding to a semantic concept in the semantic space. Both short and long term strategies are taken to improve the accuracy of the system in response to each feedback of the user and gradually bridge the semantic gap. A scoring paradigm is designed to determine the effective rules and suppress the inefficient ones. For improving the response time, an HC merging approach and, for reducing the conflicts, an HC splitting method is designed. Our experiments on a set of 11000 images from the Corel database show that the proposed approach can better describe the semantic content of images for image retrieval with respect to some existing approaches reported recently in the literature. Moreover, our approach can be better trained and is not saturated in long time, i.e., any feedback improves the precision and recall of the system. Another strength of our method is its ability to address the dynamic nature of the image database such that it can follow the changes occurred instantaneously and permanently by adding and dropping images.     

Image retrieval using nonlinear manifold embedding

The huge number of images on the Web gives rise to the content-based image retrieval (CBIR) as the text-based search techniques cannot cater to the needs of precisely retrieving Web images. However, CBIR comes with a fundamental flaw: the semantic gap between high-level semantic concepts and low-level visual features. Consequently, relevance feedback is introduced into CBIR to learn the subjective needs of users. However, in practical applications the limited number of user feedbacks is usually overwhelmed by the large number of dimensionalities of the visual feature space. To address this issue, a novel semi-supervised learning method for dimensionality reduction, namely kernel maximum margin projection (KMMP) is proposed in this paper based on our previous work of maximum margin projection (MMP). Unlike traditional dimensionality reduction algorithms such as principal component analysis (PCA) and linear discriminant analysis (LDA), which only see the global Euclidean structure, KMMP is designed for discovering the local manifold structure. After projecting the images into a lower dimensional subspace, KMMP significantly improves the performance of image retrieval. The experimental results on Corel image database demonstrate the effectiveness of our proposed nonlinear algorithm.     

Bridging the Gap: Query by Semantic Example

A combination of query-by-visual-example (QBVE) and semantic retrieval (SR), denoted as query-by-semantic-example (QBSE), is proposed. Images are labeled with respect to a vocabulary of visual concepts, as is usual in SR. Each image is then represented by a vector, referred to as a semantic multinomial, of posterior concept probabilities. Retrieval is based on the query-by-example paradigm: the user provides a query image, for which 1) a semantic multinomial is computed and 2) matched to those in the database. QBSE is shown to have two main properties of interest, one mostly practical and the other philosophical. From a practical standpoint, because it inherits the generalization ability of SR inside the space of known visual concepts (referred to as the semantic space) but performs much better outside of it, QBSE produces retrieval systems that are more accurate than what was previously possible. Philosophically, because it allows a direct comparison of visual and semantic representations under a common query paradigm, QBSE enables the design of experiments that explicitly test the value of semantic representations for image retrieval. An implementation of QBSE under the minimum probability of error (MPE) retrieval framework, previously applied with success to both QBVE and SR, is proposed, and used to demonstrate the two properties. In particular, an extensive objective comparison of QBSE with QBVE is presented, showing that the former significantly outperforms the latter both inside and outside the semantic space. By carefully controlling the structure of the semantic space, it is also shown that this improvement can only be attributed to the semantic nature of the representation on which QBSE is based.     

Complementary relevance feedback-based content-based image retrieval

We propose a complementary relevance feedback-based content-based image retrieval (CBIR) system. This system exploits the synergism between short-term and long-term learning techniques to improve the retrieval performance. Specifically, we construct an adaptive semantic repository in long-term learning to store retrieval patterns of historical query sessions. We then extract high-level semantic features from the semantic repository and seamlessly integrate low-level visual features and high-level semantic features in short-term learning to effectively represent the query in a single retrieval session. The high-level semantic features are dynamically updated based on users’ query concept and therefore represent the image’s semantic concept more accurately. Our extensive experimental results demonstrate that the proposed system outperforms its seven state-of-the-art peer systems in terms of retrieval precision and storage space on a large scale imagery database.     

融合相关反馈和流形学习的语义图像检索方法研究

融合相关反馈和流形学习的图像检索方法．既可以解决基于内容图像检索的“语义鸿沟”问题．又可以解决因为用户反馈标记样例较少所导致的较难学习用户语义概念问题。深入研究近年来比较有代表性的方法,包括ARE和MMP,并在具体的系统中比较二者的性能;此外。进一步分析此类方法面临的挑战和实际应用时需迫切解决的问题。     

基于目标区域的语义图像检索

提出了一种基于高层语义的图像检索方法,该方法首先将图像分割成区域,提取每个区域的颜色、形状、位置特征,然后使用这些特征对图像对象进行聚类,得到每幅图像的语义特征向量;采用模糊C均值算法对图像进行聚类,在图像检索时,查询图像和聚类中心比较,然后在距离最小的类中进行检索。实验表明,提出的方法可以明显提高检索效率,缩小低层特征和高层语义之间的“语义鸿沟”。