Compression of Search Range of VP-Tree for Multimedia Data Retrieval Applications

Author

Lee, Samuel Sangkon ; Shishibori, Masami ; Han, Chia Y.

Author_Institution

Dept. of Comput. Sci. & Eng., Jeonju Univ., Jeonju, South Korea

fYear

2012

fDate

10-12 April 2012

Firstpage

403

Lastpage

403

Abstract

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.

Keywords

indexing; multimedia databases; tree data structures; video retrieval; VP-tree; metric space-based indexing method; multimedia data retrieval application; multimedia database search; search performance; search range compression; trigonometric inequality; vantage point; video file; video indexing; video search; Approximation algorithms; Educational institutions; Extraterrestrial measurements; Indexing; Search problems; AESA algorithm; multimedia database; search range compression; trigonometric inequality; vantage point; vp-tree;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference (DCC), 2012

Conference_Location

Snowbird, UT

ISSN

1068-0314

Print_ISBN

978-1-4673-0715-4

Type

conf

DOI

10.1109/DCC.2012.58

Filename

6189284