Trie for similarity matching in large video databases

Sanghyun Park, Ki Ho Hyun

Research output: Contribution to journalArticle

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)641-652
Number of pages12
JournalInformation Systems
Volume29
Issue number8
DOIs
Publication statusPublished - 2004 Dec 1

Fingerprint

Query processing
Data storage equipment
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture

Cite this

Park, Sanghyun ; Hyun, Ki Ho. / Trie for similarity matching in large video databases. In: Information Systems. 2004 ; Vol. 29, No. 8. pp. 641-652.
@article{3b14b68554b84c2fa8c47f98018c3d73,
title = "Trie for similarity matching in large video databases",
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.",
author = "Sanghyun Park and Hyun, {Ki Ho}",
year = "2004",
month = "12",
day = "1",
doi = "10.1016/S0306-4379(03)00046-2",
language = "English",
volume = "29",
pages = "641--652",
journal = "Information Systems",
issn = "0306-4379",
publisher = "Elsevier Limited",
number = "8",

}

Trie for similarity matching in large video databases. / Park, Sanghyun; Hyun, Ki Ho.

In: Information Systems, Vol. 29, No. 8, 01.12.2004, p. 641-652.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Trie for similarity matching in large video databases

AU - Park, Sanghyun

AU - Hyun, Ki Ho

PY - 2004/12/1

Y1 - 2004/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=3342926196&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3342926196&partnerID=8YFLogxK

U2 - 10.1016/S0306-4379(03)00046-2

DO - 10.1016/S0306-4379(03)00046-2

M3 - Article

AN - SCOPUS:3342926196

VL - 29

SP - 641

EP - 652

JO - Information Systems

JF - Information Systems

SN - 0306-4379

IS - 8

ER -