首页> 外文期刊>International Journal of Image and Graphics >Similarity-based subsequence search in image sequence databases
【24h】

Similarity-based subsequence search in image sequence databases

机译:图像序列数据库中基于相似度的子序列搜索

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

摘要

This paper proposes an indexing technique for fast retrieval of similar image subsequences using the multi-dimensional time warping distance. The time warping distance is a more suitable similarity measure as compared to the L{sub}p distance in many applications where sequences may be of different lengths and/or different sampling rates. Our indexing scheme employs a disk-based suffix tree as an index structure and uses a lower-bound distance function to filter out dissimilar subsequence without false dismissals. It applies the normalization for an easier control of relative weighting of feature dimensions and the discretization to compress the index tree. Experiments on medical and synthetic image sequences verified that the proposed method significantly outperforms the naive method and scales well in a large volume of image sequence databases.
机译:本文提出了一种利用多维时间规整距离快速检索相似图像子序列的索引技术。在许多应用中,序列可能具有不同的长度和/或不同的采样率,相比于Lp距离,时间扭曲距离是更合适的相似性度量。我们的索引方案采用基于磁盘的后缀树作为索引结构,并使用下限距离函数来筛选出不相似的子序列而不会导致错误解雇。它应用归一化以便更轻松地控制要素尺寸的相对权重和离散化以压缩索引树。在医学和合成图像序列上的实验证明,该方法明显优于单纯方法,并且在大量图像序列数据库中具有良好的伸缩性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号