Compression of Search Range of VP-Tree for Multimedia Data Retrieval Applications
Compression of Search Range of VP-Tree for Multimedia Data Retrieval Applications
复制标题
多媒体数据检索应用VP树搜索范围的压缩
DOI：
10.1109/dcc.2012.58
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
et al.
中科院分区：
文献类型：
--
作者：
Masami Shishibori;et al.
本文提出了一种改进VP-tree在视频索引和搜索中的应用的方法。VP-tree是一种用于多媒体数据库检索和数据检索的基于度量空间的索引方法。该方法主要利用三角不等式来压缩搜索范围，从而提高搜索性能。使用1万个视频文件的测试结果表明，与使用AESA （approximate and elimination search Algorithm）算法的现有方法相比，该方法的搜索时间缩短了5 - 12%。
This paper presents an approach for improving the use of VP-tree in video indexing and search. VP-tree is one of the metric space-based indexing methods used in multimedia database search and data retrieval. The proposed approach focuses on the trigonometric inequality for compressing the search range, thus, improving the search performance. A test result of using 10, 000 video files shows that this method reduced search time by 5 - 12%, compared to the existing method using the AESA (Approximating and Eliminating Search Algorithm) algorithm.