Slim-Tree and BitMatrix index structures in image retrieval system using MPEG-7 Descriptors

2008-06-20
Acar, Esra
Arslan, Serdar
Yazıcı, Adnan
KOYUNCU, Murat
Content-based retrieval of multimedia data has still been an active research area. The efficient retrieval in natural images has been proven a difficult task for content-based image retrieval systems. In this paper, we present a system that adapts two different index structures, namely Slim-Tree and BitMatrix, for efficient retrieval of images based on multidimensional low-level features such as color, texture and shape. These index structures also use metric space. We use MPEG-7 Descriptors extracted from images to represent these features and store them in a native XML database. The low-level features; Color Layout (CL), Dominant Color (DC), Edge Histogram (EH) and Region Shape (RS) are used in Slim-Tree and BitMatrix and aggregated by Ordered Weighted Averaging (OWA) method to find final similarity between any two objects. The experiments included in the paper are in the subject of index construction and update, query response time and retrieval effectiveness using ANMRR performance metric and precision/recall scores. The experimental results strengthen the case that uses BitMatrix along with Ordered Weighted Averaging method in content-based image retrieval systems.

Suggestions

Efficient index structures for video databases
Açar, Esra; Yazıcı, Adnan; Department of Computer Engineering (2008)
Content-based retrieval of multimedia data has been still an active research area. The efficient retrieval of video data is proven a difficult task for content-based video retrieval systems. In this thesis study, a Content-Based Video Retrieval (CBVR) system that adapts two different index structures, namely Slim-Tree and BitMatrix, for efficiently retrieving videos based on low-level features such as color, texture, shape and motion is presented. The system represents low-level features of video data with ...
A comparative evaluation of XML repositories
Ünal, Özgül; Doğaç, Asuman; Department of Information Systems (2002)
Recently XML has established itself as the standard for representing data in scientific and business applications. Starting out as a standard data exchange format over the web, it has become instrumental in all kinds of applications. Almost all standardization efforts on the web today are based on XML. As a consequence, the amount of XML data being stored and processed is large and will be increasing at a very rapid rate. This has caused XML data management to become a focus of research efforts in the datab...
Dominant sets based movie scene detection
SAKARYA, Ufuk; Telatar, Ziya; Alatan, Abdullah Aydın (Elsevier BV, 2012-01-01)
Multimedia indexing and retrieval has become a challenging topic in organizing huge amount of multimedia data. This problem is not a trivial task for large visual databases; hence, segmentation into low- and high-level temporal video segments might improve the realization of this task. In this paper, we introduce a weighted undirected graph-based movie scene detection approach to detect semantically meaningful temporal video segments. The method is based on the idea of finding the dominant scene of the vide...
Text Generation and Comprehension for Objects in Images and Videos
Anayurt Özyeğin, Hazan; Kalkan, Sinan; Department of Computer Engineering (2021-9-09)
Text generation from visual data is a problem often studied using deep learning, having a wide range of applications. This thesis focuses on two different aspects of this problem by proposing both supervised and unsupervised methods to solve it. In the first part of the thesis, we work on referring expression comprehension and generation from videos. We specifically work with relational referring expressions which we define to be expressions that describe an object with respect to another object. For this, ...
The strong partial transitive-closure problem: Algorithms and performance evaluation
Toroslu, İsmail Hakkı (1996-08-01)
The development of efficient algorithms to process the different forms of transitive-closure (To) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values...
Citation Formats
E. Acar, S. Arslan, A. Yazıcı, and M. KOYUNCU, “Slim-Tree and BitMatrix index structures in image retrieval system using MPEG-7 Descriptors,” 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40034.