The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Distributed M-Tree for Similarity Search in Large Multimedia Database on Spark
|
Author(s): Phuc Do (University of Information Techonology (VNU-HCM), Vietnam)and Trung Hong Phan (University of Information Techonology (VNU-HCM), Vietnam)
Copyright: 2020
Pages: 19
Source title:
Handbook of Research on Multimedia Cyber Security
Source Author(s)/Editor(s): Brij B. Gupta (National Institute of Technology, Kurukshetra, India)and Deepak Gupta (LoginRadius Inc., Canada)
DOI: 10.4018/978-1-7998-2701-6.ch007
Purchase
|
Abstract
In this chapter, Image2vec or Video2vector are used to convert images and video clips to vectors in large multimedia database. The M-tree is an index structure that can be used for the efficient resolution of similarity queries on complex objects. M-tree can be profitably used for content-based retrieval on multimedia databases provided relevant features have been extracted from the objects. In a large multimedia database, to search for similarities such as k-NN queries and Range queries, distances from the query object to all remaining objects (images or video clips) are calculated. The calculation between query and entities in a large multimedia database is not feasible. This chapter proposes a solution to distribute the M-Tree structure on the Apache Spark framework to solve the Range Query and kNN Query problems in large multimedia database with a lot of images and video clips.
Related Content
Nithin Kalorth, Vidya Deshpande.
© 2024.
7 pages.
|
Nitesh Behare, Vinayak Chandrakant Shitole, Shubhada Nitesh Behare, Shrikant Ganpatrao Waghulkar, Tabrej Mulla, Suraj Ashok Sonawane.
© 2024.
24 pages.
|
T.S. Sujith.
© 2024.
13 pages.
|
C. Suganya, M. Vijayakumar.
© 2024.
11 pages.
|
B. Harry, Vijayakumar Muthusamy.
© 2024.
19 pages.
|
Munise Hayrun Sağlam, Ibrahim Kirçova.
© 2024.
19 pages.
|
Elif Karakoç Keskin.
© 2024.
19 pages.
|
|
|