Trie for similarity matching in large video databases

  • Authors:

  • Sanghyun Park;Ki-Ho Hyun

  • Affiliations:

  • Department of Computer Science and Engineering, Pohang University of Science and Technology (POSTECH), Pohang, South Korea;School of Computer and Information Engineering, YoungSan University, South Korea

  • Venue:
  • Information Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

Similarity matching in video databases is of growing importance in many new applications such as video clustering and digital video libraries. In order to provide efficient access to relevant data in large databases, there have been many research efforts in video indexing with diverse spatial and temporal features. However, most of the previous works relied on sequential matching methods or memory-based inverted file techniques, thus making them unsuitable for a large volume of video databases. In order to resolve this problem, this paper proposes an effective and scalable indexing technique using a trie, originally proposed for string matching, as an index structure. For building an index, we convert each frame into a symbol sequence using a window order heuristic and build a disk-resident trie from a set of symbol sequences. For query processing, we perform a depth-first traversal on the trie and execute a temporal segmentation. To verify the superiority of our approach, we perform several experiments with real and synthetic data sets. The results reveal that our approach consistently outperforms the sequential scan method, and the performance gain is maintained even with a large volume of video databases.