Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Comparison of feature-based and image registration-based retrieval of image data using multidimensional data access methods
Date
2013-07-01
Author
Arslan, Serdar
Yazıcı, Adnan
Sacan, Ahmet
Toroslu, İsmail Hakkı
Acar, Esra
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
226
views
0
downloads
Cite This
In information retrieval, efficient similarity search in multimedia collections is a critical task In this paper, we present a rigorous comparison of three different approaches to the image retrieval problem, including cluster-based indexing, distance-based indexing, and multidimensional scaling methods. The time and accuracy trade-offs for each of these methods are demonstrated on three different image data sets. Similarity of images is obtained either by a feature-based similarity measure using four MPEG-7 low-level descriptors or by a whole image-based similarity measure. The effect of these similarity measurement techniques on the retrieval process is also evaluated through the performance tests performed on several data sets. We show that using low-level features of images in the similarity measurement function results in significantly better accuracy and time performance compared to the whole-image based approach. Moreover, an optimization of feature contributions to the distance measure for feature-based approach can identify the most relevant features and is necessary to obtain maximum accuracy. We further show that multidimensional scaling can achieve comparable accuracy, while speeding-up the query times significantly by allowing the use of spatial access methods.
Subject Keywords
Information Systems and Management
URI
https://hdl.handle.net/11511/41979
Journal
DATA & KNOWLEDGE ENGINEERING
DOI
https://doi.org/10.1016/j.datak.2013.01.007
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Exploiting information extraction techniques for automatic semantic video indexing with an application to Turkish news videos
Kucuk, Dilek; Yazıcı, Adnan (Elsevier BV, 2011-08-01)
This paper targets at the problem of automatic semantic indexing of news videos by presenting a video annotation and retrieval system which is able to perform automatic semantic annotation of news video archives and provide access to the archives via these annotations. The presented system relies on the video texts as the information source and exploits several information extraction techniques on these texts to arrive at representative semantic information regarding the underlying videos. These techniques ...
A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM
KIRCA, O; KOKTEN, M (Elsevier BV, 1994-06-09)
In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planni...
Multi-objective integer programming: A general approach for generating all non-dominated solutions
Oezlen, Melih; Azizoğlu, Meral (Elsevier BV, 2009-11-16)
In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement over classical epsilon-constraint method. Objective efficiency ranges are identified by solving simpler MOIP problems with fewer objectives. We first provide the classical epsilon-constraint method on the bi-objective integer programming problem for the sake of comple...
Semantic information-based alternative plan generation for multiple query optimization
Polat, Faruk; Alhajj, R (Elsevier BV, 2001-09-01)
This paper addresses the impact of semantic information about queries on alternative plan generation (APG) for multiple query optimization (MQO). MQO covers optimizing the execution of a set of queries together where each query in the set to be optimized has several alternative execution plans. A multiple query optimizer selects an alternative plan for each query to obtain an optimal global execution plan. Our approach uses information such as common relations, common possible joins and common conditions to...
THE SCHEDULING OF ACTIVITIES TO MAXIMIZE THE NET PRESENT VALUE OF PROJECTS - COMMENT
SEPIL, C (Elsevier BV, 1994-02-24)
In a recent paper, Elmaghraby and Herroelen have presented an algorithm to maximize the present value of a project. Here, with the help of an example, it is shown that the algorithm may not find the optimal solution.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Arslan, A. Yazıcı, A. Sacan, İ. H. Toroslu, and E. Acar, “Comparison of feature-based and image registration-based retrieval of image data using multidimensional data access methods,”
DATA & KNOWLEDGE ENGINEERING
, pp. 124–145, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41979.