首页> 外文会议>IAPR International Conference on Discrete Geometry for Computer Imagery >Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph
【24h】

Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph

机译:通用对象发现作为全局对象相似图中最大权重派系的本地搜索

获取原文

摘要

In this paper, we consider the task of discovering the common objects in images. Initially, object candidates are generated in each image and an undirected weighted graph is constructed over all the candidates. Each candidate serves as a node in the graph while the weight of the edge describes the similarity between the corresponding pair of candidates. The problem is then expressed as a search for the Maximum Weight Clique (MWC) in this graph. The MWC corresponds to a set of object candidates sharing maximal mutual similarity, and each node in the MWC represents a discovered common object across the images. Since the problem of finding the MWC is NP-hard, most research of the MWC problem focuses on developing various heuristics for finding good cliques within a reasonable time limit. We utilize a recently very popular class of heuristics called local search methods. They search for the MWC directly in the discrete domain of the solution space. The proposed approach is evaluated on the PASCAL VOC image dataset and the YouTube-Objects video dataset, and it demonstrates superior performance over recent state-of-the-art approaches.
机译:在本文中,我们考虑了发现图像中常见对象的任务。最初,在每个图像中生成候选对象,并在所有候选对象上构建无向加权图。每个候选对象都充当图中的一个节点,而边缘的权重描述了相应的候选对象对之间的相似性。然后,该问题表示为在此图中搜索“最大重量团”(MWC)。 MWC对应于一组共享最大相似度的候选对象,并且MWC中的每个节点代表跨图像发现的公共对象。由于找到MWC的问题是NP难题,因此大多数关于MWC问题的研究都集中于开发各种启发式方法,以在合理的时限内找到良好的集团。我们利用了一种非常流行的启发式方法,称为本地搜索方法。他们直接在解决方案空间的离散域中搜索MWC。在PASCAL VOC图像数据集和YouTube-Objects视频数据集上对提出的方法进行了评估,并且与最近的最新方法相比,它展示了优越的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号