Improving search time for contentment based image retrieval via,  LSH, MTRee, and EMD bounds

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2013, Vol 13, Issue 3

Abstract

 Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. The Earth Mover’s Distance was introduced in Computer Vision to better approach human perceptual similarities. Its computation, however, is too complex for usage in interactive multimedia database  scenarios. Nearest neighbor (NN) search in high dimensional space is an important problem in many  applications, in particular if the method of similarity measure used be the EMD. Ideally, a practical solution (i)  should be implementable in a relational database, and (ii) its query cost should grow sub-linearly with the  dataset size, regardless of the data and query distributions. Despite the bulk of NN literature, no solution fulfills  both requirements, except locality sensitive hashing (LSH). In this paper, we propose a new index structure,  named LSH-LUBMTree, for efficient retrieval of multimedia objects. It combines the advantages of LSH [27,28], the technique used to embedding [33] the EMD, and the advantages, of LUBMTree [19]. Unlike the  images of each bucket are stored in the LUBMTree

Authors and Affiliations

Bahri abdelkhalak

Keywords

Related Articles

Problem Domains in Complex Networks

Abstract: Many real world Networks can be represented with the help of complex networks. Complex networks are special graphs with non trivial topological properties—features that do not occur in simple networks such as l...

 Emergency Vehicle Priority Preference at Multiple Wireless Network Sensors (MWNS) Intelligent Road Traffic Signal Control System

 Abstract: Traffic control management system has to be intelligent and equitable in signal allocation management system, especially priority order has to be given to emergency vehicles so as to prevent unforeseen...

 Detection of Lung Cancer Stages on CT scan Images by Using Various Image Processing Techniques

 Abstract: Lung cancer seems to be the common cause of death among people throughout the world. Early detection of lung cancer can increase the chance of survival among people. The overall 5-year survival rate for l...

SMS EncryptionUsing One-Time Pad Cipher

Abstract: The content of the SMS is very crucial. It consists of an imperative information. Unknown participants can not retrieve it. To protect the SMS content, the sender must provide the unique characterbefore it is...

Efficient Construction of Dictionary using Directed Acyclic Word Graph

Abstract: Implementation of dictionary is a topic on which research is going on since a long time in the search of a better and efficient algorithm both in terms of space and time complexity. Its necessity has increased...

Download PDF file
  • EP ID EP98731
  • DOI -
  • Views 103
  • Downloads 0

How To Cite

Bahri abdelkhalak (2013).  Improving search time for contentment based image retrieval via,  LSH, MTRee, and EMD bounds. IOSR Journals (IOSR Journal of Computer Engineering), 13(3), 43-52. https://europub.co.uk/articles/-A-98731