An Improvement Video Search Method for VP-Tree by using a Trigonometric Inequality


Samuel Sangkon Lee, Masami Shishibori, Chia Y. Han, Journal of Information Processing Systems Vol. 9, No. 2, pp. 315-332, Jun. 2013  

https://doi.org/10.3745/JIPS.2013.9.2.315
Keywords: Vantage Point; VP-Tree; Trigonometric Inequality; Search Algorithm; Range Search; Nearest Neighbor Search; AESA algorithm; Multimedia Database
Fulltext:

Abstract

This paper presents an approach for improving the use of VP-tree in video indexing and searching. A vantage-point tree or VP-tree is one of the metric space-based indexing methods used in multimedia database searches and data retrieval. Instead of relying on the Euclidean distance as a measure of search space, the proposed approach focuses on the trigonometric inequality for compressing the search range, which thus, improves the search performance. A test result of using 10,000 video files shows that this method reduced the search time by 5-12%, as compared to the existing method that uses the AESA algorithm.


Statistics
Show / Hide Statistics

Statistics (Past 3 Years)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Lee, S., Shishibori, M., & Han, C. (2013). An Improvement Video Search Method for VP-Tree by using a Trigonometric Inequality. Journal of Information Processing Systems, 9(2), 315-332. DOI: 10.3745/JIPS.2013.9.2.315.

[IEEE Style]
S. S. Lee, M. Shishibori, C. Y. Han, "An Improvement Video Search Method for VP-Tree by using a Trigonometric Inequality," Journal of Information Processing Systems, vol. 9, no. 2, pp. 315-332, 2013. DOI: 10.3745/JIPS.2013.9.2.315.

[ACM Style]
Samuel Sangkon Lee, Masami Shishibori, and Chia Y. Han. 2013. An Improvement Video Search Method for VP-Tree by using a Trigonometric Inequality. Journal of Information Processing Systems, 9, 2, (2013), 315-332. DOI: 10.3745/JIPS.2013.9.2.315.