Parallel processing algorithms for content-based retrieval from a multimedia database

Authors:
Matei Dobrescu;Manuela Stoian;Cosmin Leoveanu
Affiliations:
Insurance Supervisory Commission, Bucharest, Romania;Insurance Supervisory Commission, Bucharest, Romania;Insurance Supervisory Commission, Bucharest, Romania
Venue:
TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Year:
2008

Citing 4
Cited 0

Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel

IEEE Transactions on Parallel and Distributed Systems
Multimedia and Spatial Information Systems

IEEE MultiMedia
A federated approach to distributed network simulation

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Narrowing the semantic gap - improved text-based web document retrieval using visual features

IEEE Transactions on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper proposes a data partitioning algorithm for content-based retrieval from a multimedia database using a homogeneous cluster system. The multimedia data are represented in a unified model formed into a hierarchical multidimensional k-tree structure. The parallel retrieval algorithms run on a cluster of homogeneous processing units using a dedicated type of shared memory. We use system characteristics to help in partitioning the data and balancing the loads of the processors. The experimental results show that multi-resolution processing can reduce retrieval time, maintain the accuracy, and exploit parallelism.