Fast Similarity Search in High Dimensional Image Data Sets
Authors: 
Y. Hanyf, H. SilkanAuthors Info & Claims
Y. Hanyf, H. SilkanAuthors Info & ClaimsArticle No.: 70, Pages 1 - 5
Abstract
Due to the development of images data production and use, the size of images databases is exponentially increased recently. Consequently, the similarity search time in images databases becoming a severe problem which affects the exploitation of image data. In this paper, we address the problem of reducing the similarity search cost in large, high-dimensional and dynamic image datasets; we propose a coherent improvement of the D-index method, the amelioration aims to reduce the number of distances computed during a query search. The method is tested over a 112 dimensional color images databases, the experiences show that the proposed D-index version has proved a good performance in comparison with the classical D-index.
References
[1]
Zezula, P. Similarity Searching for Database Applications. Springer, City, 2016.
[2]
Dohnal, V. Indexing Structures for Searching in Metric Spaces. phd thesis2004).
[3]
Chakrabarti, K. and Mehrotra, S. The hybrid tree: An index structure for high dimensional feature spaces. IEEE, City, 1999.
[4]
Chávez, E., Navarro, G., Baeza-Yates, R. and Marroquín, J. L. Searching in metric spaces. ACM computing surveys (CSUR), 33, 3 2001), 273--321.
[5]
Dohnal, V., Gennaro, C., Savino, P. and Zezula, P. D-index: Distance searching index for metric data sets. Multimedia Tools and Applications, 21, 1 2003), 9--33.
[6]
Hanyf, Y., Silkan, H. and Labani, H. Fast and Efficient Indexing and Similarity Searching in 2D/3D Image Databases. International Review on Computers and Software (IRECOS), 10, 5 2015), 481--488.
[7]
Hanyf, Y., Silkan, H. and Labani, H. Criteria and technique to choose a good ρ parameter for the D-index. IEEE, City, 2015.
[8]
Youssef, H. and hassan, S. Prediction of Customers' Needs: An Approach Based on Similarity Search in Transactions Databases. City, 2016.
[9]
Ban, T. Using genetic algorithm to balance the d-index algorithm for metric search. Springer, City, 2007.
[10]
Müller-Molina, A. J. and Shinohara, T. On the configuration of the similarity search data structure d-index for high dimensional objects. Springer, City, 2010.
[11]
Figueroa, K., Navarro, G. and Chávez, E. Metric spaces library. Online http://www.sisap.org2007.
Recommendations
Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space
Similarity search (e.g., k-nearest neighbor search) in high-dimensional metric space is the key operation in many applications, such as multimedia databases, image retrieval and object recognition, among others. The high dimensionality and the huge size ...
Index Structures for Fast Similarity Search for Binary Vectors
This article reviews index structures for fast similarity search for objects represented by binary vectors (with components equal to 0 or 1). Structures for both exact and approximate search by Hamming distance and other similarity measures are ...
Indexing high-dimensional data for main-memory similarity search
As RAM gets cheaper and larger, in-memory processing of data becomes increasingly affordable. In this paper, we propose a novel index structure, the CSR^+-tree, to support efficient high-dimensional similarity search in main memory. We introduce ...
Comments
Information & Contributors
Information
Published In
March 2017
685 pages
ISBN:9781450348522
DOI:10.1145/3090354
- Conference Chairs:
- Mohamed Lazaar,
- Youness Tabii,
- Mohamed Chrayah,
- Mohammed Al Achhab
Copyright © 2017 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
- Ministère de I'enseignement supérieur: Ministère de I'enseignement supérieur
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 29 March 2017
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
BDCA'17
BDCA'17: 2nd international Conference on Big Data, Cloud and Applications
March 29 - 30, 2017
Tetouan, Morocco
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 63Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in