Search Algorithms for Subdatatype-Based Multimedia Retrieval

  • Authors:
  • Punpiti Piamsa-Nga;Nikitas A. Alexandridis

  • Affiliations:
  • Department of Computer Engineering, Faculty of Engineering, Kasetsart University, Bangkok, 10900, Thailand/ e-mail: pp@ku.ac.th;Department of Electrical and Computer Engineering and Computer Science, George Washington University, Washington DC, 20052 USA/ e-mail: alexan@seas.gwu.edu

  • Venue:
  • Journal of Intelligent and Robotic Systems
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, researchers have mainly been interested only in the search for data content that are globally similar to the query and not in the search for inside data items. This paper presents an algorithm, called a generalized virtual node (GVN) algorithm, to search for data items where parts (subdatatype) are similar to the incoming query. We call this “subdatatype”-based multimedia retrieval. Each multimedia datatype, such as image and audio is represented in this paper as a k-dimensional signal in the spatio-temporal domain. A k-dimensional signal is transformed into characteristic features and these features are stored in a hierarchical multidimensional structure, called the k-tree. Each node on the k-tree contains partial content corresponding to the spatial and/or temporal positions in the data. The k-tree structure allows us to build a unified retrieval model for any types of multimedia data. It also eliminates unnecessary comparisons of cross-media querying. The experimental results of the use of the new GVN algorithm for “subaudio” and “subimage” retrievals show that it takes much less retrieval times than other earlier algorithms such as brute-force and the partial-matching algorithm, while the accuracy is acceptable.