...
首页> 外文期刊>Image and Vision Computing >Shape retrieval with eigen-CSS search
【24h】

Shape retrieval with eigen-CSS search

机译:通过特征CSS搜索进行形状检索

获取原文
获取原文并翻译 | 示例
           

摘要

Shape retrieval programs are comprised of two components: shape representation and matching algorithm. Building the representation on scale space filtering and the curvature function of a closed boundary curve, curvature scale space (CSS) has been demonstrated to be a robust 2D shape representation. The adoption of the CSS image as the default in the MPEG-7 standard, using a matching algorithm utilizing maxima of the CSS image contours, makes this feature of interest perforce. In this paper, we propose a framework in two stages for a novel approach to both representing and matching the CSS feature. Our contribution consists of three steps, each of which effects a profound speedup on CSS image matching. Each step is a well-known technique in other domains, but the proposed concatenation of steps leads to a novel approach to this subject which captures shape information more efficiently and decreases distracting noise. First, using experience derived from medical imaging, we define a set of marginal-sum features summarizing the CSS image. Second, the standard algorithm using CSS maxima involves a complicated and time-consuming search, since the zero of arc length is not known in any new contour. Here, we obviate this search via a phase normalization transform in the spatial dimension of the reduced marginal-CSS feature. Remarkably, this step also makes the method rotation- and reflection-invariant. Finally, the resulting feature space is amenable to dimension reduction via subspace projection methods, with a dramatic speedup in time, and as well orders of magnitude reduction in space. The first stage of the resultant program, using a general-purpose eigenspace, has class-categorization accuracy compatible with the original contour maxima program. In a second stage, we generate specialized eigenspaces for each shape category, with little extra runtime complexity because search can still be carried out in reduced dimensionality. In a leave-one-out categorization using the MPEG-7 contour database, a classification success rate of 94.1% over 1400 objects in 70 classes is achieved with very fast matching, and 98.6% in the top-2 classes. A leave-all-in test achieves 99.8% correct categorization. The method is rotation invariant, and is simple, fast, and effective.
机译:形状检索程序由两个组件组成:形状表示和匹配算法。在比例空间过滤和闭合边界曲线的曲率函数上建立表示后,曲率缩放空间(CSS)已被证明是鲁棒的2D形状表示。通过使用利用CSS图像轮廓最大值的匹配算法,在MPEG-7标准中采用CSS图像作为默认值,使此功能值得关注。在本文中,我们提出了一个分两个阶段的框架,用于表示CSS特征的新方法。我们的贡献包括三个步骤,每个步骤都极大地提高了CSS图像匹配的速度。每个步骤在其他领域都是众所周知的技术,但是建议的步骤串联会导致针对该主题的新颖方法,该方法可以更有效地捕获形状信息并减少干扰噪声。首先,利用从医学成像中获得的经验,我们定义了一组边缘和特征,这些特征概括了CSS图像。第二,使用CSS最大值的标准算法涉及复杂且耗时的搜索,因为在任何新轮廓中都不知道弧长的零。在这里,我们通过减少边际CSS特征的空间维度中的相位归一化变换来避免这种搜索。值得注意的是,此步骤还使方法旋转和反射不变。最后,所得到的特征空间可以通过子空间投影方法进行尺寸缩减,具有显着的时间加速,并且空间减少了数量级。使用通用特征空间的结果程序的第一阶段具有与原始轮廓最大值程序兼容的类分类精度。在第二阶段,我们为每个形状类别生成专用的特征空间,而运行时的复杂性却很少,这是因为搜索仍然可以在降低的维数中进行。在使用MPEG-7等高线数据库进行一劳永逸的分类中,通过非常快速的匹配,在70个类别中的1400个对象上的分类成功率为94.1%,而在前2个类别中的分类成功率为98.6%。保留所有功能测试可实现99.8%的正确分类。该方法是旋转不变的,简单,快速,有效。

著录项

  • 来源
    《Image and Vision Computing》 |2009年第6期|748-755|共8页
  • 作者单位

    School of Computing Science, Simon Fraser University, 8888 University Drive, Vancouver, BC, Canada V5A 1S6;

    School of Computing Science, Simon Fraser University, 8888 University Drive, Vancouver, BC, Canada V5A 1S6 Cancer Control Research, BC Cancer Research Centre, Vancouver, Canada V5Z 1L3;

    School of Computing Science, Simon Fraser University, 8888 University Drive, Vancouver, BC, Canada V5A 1S6;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    shape; 2D contour; scale-space; matching; retrieval; curvature; CSS; eigen-analysis;

    机译:形状;2D轮廓比例空间匹配;恢复;曲率CSS;特征分析;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号