首页> 外文期刊>IEEE Transactions on Knowledge and Data Engineering >Hierarchical Indexing Structure for Efficient Similarity Search in Video Retrieval
【24h】

Hierarchical Indexing Structure for Efficient Similarity Search in Video Retrieval

机译:视频检索中有效相似搜索的分层索引结构

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

摘要

With the rapid increase in both centralized video archives and distributed WWW video resources, content-based video retrieval is gaining its importance. To support such applications efficiently, content-based video indexing must be addressed. Typically, each video is represented by a sequence of frames. Due to the high dimensionality of frame representation and the large number of frames, video indexing introduces an additional degree of complexity. In this paper, we address the problem of content-based video indexing and propose an efficient solution, called the ordered VA-file (OVA-file) based on the VA-file. OVA-file is a hierarchical structure and has two novel features: 1) partitioning the whole file into slices such that only a small number of slices are accessed and checked during k nearest neighbor (kNN) search and 2) efficient handling of insertions of new vectors into the OVA-file, such that the average distance between the new vectors and those approximations near that position is minimized. To facilitate a search, we present an efficient approximate kNN algorithm named ordered VA-LOW (OVA-LOW) based on the proposed OVA-file. OVA-LOW first chooses possible OVA-slices by ranking the distances between their corresponding centers and the query vector, and then visits all approximations in the selected OVA-slices to work out approximate kNN. The number of possible OVA-slices is controlled by a user-defined parameter delta. By adjusting delta, OVA-LOW provides a trade-off between the query cost and the result quality. Query by video clip consisting of multiple frames is also discussed. Extensive experimental studies using real video data sets were conducted and the results showed that our methods can yield a significant speed-up over an existing VA-file-based method and (distance with high query result quality. Furthermore, by incorporating temporal correlation of video content, our methods achieved much more efficient performance
机译:随着集中式视频档案和分布式WWW视频资源的快速增长,基于内容的视频检索正变得越来越重要。为了有效地支持此类应用程序,必须解决基于内容的视频索引问题。通常,每个视频由一系列帧表示。由于帧表示的高维度和大量的帧,视频索引引入了额外的复杂度。在本文中,我们解决了基于内容的视频索引问题,并提出了一种有效的解决方案,称为基于VA文件的有序VA文件(OVA文件)。 OVA文件是一种分层结构,具有两个新颖的功能:1)将整个文件划分为多个片,以便在进行k个最近邻(kNN)搜索时仅访问和检查少量片,以及2)有效地插入新文件向量到OVA文件中,以使新向量与该位置附近的近似向量之间的平均距离最小。为了方便搜索,我们基于提出的OVA文件提出了一种有效的近似kNN算法,称为有序VA-LOW(OVA-LOW)。 OVA-LOW首先通过对可能的OVA切片进行排序,方法是排列它们对应的中心与查询向量之间的距离,然后访问所选OVA切片中的所有近似值,以得出近似的kNN。可能的OVA切片的数量由用户定义的参数增量控制。通过调整增量,OVA-LOW可以在查询成本和结果质量之间进行权衡。还讨论了由多个帧组成的视频剪辑查询。使用真实视频数据集进行了广泛的实验研究,结果表明,与现有的基于VA文件的方法相比,我们的方法可以显着提高速度,并且(具有高查询结果质量的距离。此外,通过结合视频的时间相关性内容,我们的方法取得了更高的效率

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号