Indexing and matching multiple-attribute strings for efficient multimedia query processing

Multimedia data can be represented as a multiple-attribute string of feature values corresponding to multiple features of the data. Therefore, the retrieval problem can be transformed into the q-attribute string matching problem if q features are considered in a query. A general solution is proposed...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on multimedia 2006-04, Vol.8 (2), p.408-411
Main Authors: Chia-Han Lin, Chen, A.L.P.
Format: Article
Language:English
Subjects:
Acceleration
Applied sciences
Computer science
Computer science
control theory
systems
Data processing. List processing. Character string processing
Educational institutions
Exact sciences and technology
Index structure
Indexing
Information systems. Data bases
Matching
Memory organisation. Data processing
Multimedia
multimedia data
q-attribute string matching and query processing
Query processing
Retrieval
Software
String matching
Strings
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Multimedia data can be represented as a multiple-attribute string of feature values corresponding to multiple features of the data. Therefore, the retrieval problem can be transformed into the q-attribute string matching problem if q features are considered in a query. A general solution is proposed in this paper. It includes an index structure and the matching methodologies, which can be applied on different values of q. The experiment results show the efficiency of the proposed approach.
ISSN:1520-9210
1941-0077
DOI:10.1109/TMM.2005.864350