A PARALLEL MODEL FOR MULTIMEDIA RETRIEVAL BASED ON MULTIDIMENSIONAL SIGNAL STRUCTURE

Srakaew, S; Alexandridis, N; Piamsa-nga, P; Blankenship, G; Papakonstantinou, G; Tsanakas, P; Tzafestas, S

dc.contributor.author	Srakaew, S	en
dc.contributor.author	Alexandridis, N	en
dc.contributor.author	Piamsa-nga, P	en
dc.contributor.author	Blankenship, G	en
dc.contributor.author	Papakonstantinou, G	en
dc.contributor.author	Tsanakas, P	en
dc.contributor.author	Tzafestas, S	en
dc.date.accessioned	2014-03-01T01:46:38Z
dc.date.available	2014-03-01T01:46:38Z
dc.date.issued	1998	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24967
dc.subject	Cluster of Workstations	en
dc.subject	Data Structure	en
dc.subject	Indexing and Retrieval	en
dc.subject	Multimedia Data	en
dc.subject	Multimedia Database	en
dc.subject	Multimedia Retrieval	en
dc.subject	Parallel Algorithm	en
dc.subject	Parallel Models	en
dc.subject	Parallel Processing	en
dc.subject	Similarity Search	en
dc.subject	Tree Structure	en
dc.subject	Unified Model	en
dc.title	A PARALLEL MODEL FOR MULTIMEDIA RETRIEVAL BASED ON MULTIDIMENSIONAL SIGNAL STRUCTURE	en
heal.type	journalArticle	en
heal.publicationDate	1998	en
heal.abstract	In this paper, we propose a parallel, unified model for the indexing and retrieval by content of multimedia data using multiresolution processing. Each multimedia data type can be represented by k-dimensional (k-d) signals in the spatio-temporal domain. (1) These k-d signals are separated into small blocks and then formed into a multidimensional tree structure, called a k-tree. Using the k-tree	en