Journal Article10.1007/S10462-018-9673-8
A survey of image data indexing techniques
14
TL;DR: A comprehensive survey of indexing techniques with application and evaluation framework is proposed to apprise the reader of the significance of different techniques, the dataset used and their respective pros and cons.
read more
Abstract: The Index is a data structure which stores data in a suitably abstracted and compressed form to facilitate rapid processing by an application. Multidimensional databases may have a lot of redundant data also. The indexed data, therefore need to be aggregated to decrease the size of the index which further eliminates unnecessary comparisons. Feature-based indexing is found to be quite useful to speed up retrieval, and much has been proposed in this regard in the current era. Hence, there is growing research efforts for developing new indexing techniques for data analysis. In this article, we propose a comprehensive survey of indexing techniques with application and evaluation framework. First, we present a review of articles by categorizing into a hash and non-hash based indexing techniques. A total of 45 techniques has been examined. We discuss advantages and disadvantages of each method that are listed in a tabular form. Then we study evaluation results of hash based indexing techniques on different image datasets followed by evaluation campaigns in multimedia retrieval. In this paper, in all 36 datasets and three evaluation campaigns have been reviewed. The primary aim of this study is to apprise the reader of the significance of different techniques, the dataset used and their respective pros and cons.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Learning to hash: forgiving hash functions and applicationsLearning to hash: forgiving hash functions and applications
Shumeet Baluja,Michele Covell +1 more
- 01 Jan 2008
TL;DR: In this article, the authors describe a method to learn a similarity function from only weakly labeled positive examples, which is used as the basis of a hash function to severely constrain the number of points considered for each lookup.
56
Diverse feature set based Keyphrase extraction and indexing techniques
TL;DR: This article proposed different unsupervised keyword extraction approaches, which is independent of the structure, size and domain of the documents, and relies on the novel and cognitive inspired set of standard, phrase, word embedding and external knowledge source features.
8
GeoNLU: Bridging the gap between natural language and spatial data infrastructures
Palanichamy Naveen,Rajagopal Maheswar,Pavel Trojovský +2 more
TL;DR: GeoNLU bridges the gap between natural language and spatial data infrastructures, enabling seamless interaction and querying of geospatial data through natural language, enhancing accessibility and usability for various users, and improving geospatial data exploration, analysis, and decision-making.
6
Feature-Based Place Recognition Using Forward-Looking Sonar
Ana Rita Gaspar,Aníbal Matos +1 more
TL;DR: A novel place recognition method based on forward-looking sonar data is proposed to solve perception problems in harbour facilities. The method achieves high recognition accuracy and outperforms optical images.
1
•Posted Content
A Survey on Personal Image Retrieval Systems.
Amit Kumar Nath,Andy Wang +1 more
TL;DR: In this paper, a survey explores existing image retrieval techniques as well as photo-organizer applications to highlight their relative strengths in addressing the challenge of finding specific images in personal photo repositories (shared or not shared).
1
References
SIMPLIcity: semantics-sensitive integrated matching for picture libraries
TL;DR: SIMPLIcity (semantics-sensitive integrated matching for picture libraries), an image retrieval system, which uses semantics classification methods, a wavelet-based approach for feature extraction, and integrated region matching based upon image segmentation to improve retrieval.
80 Million Tiny Images: A Large Data Set for Nonparametric Object and Scene Recognition
TL;DR: For certain classes that are particularly prevalent in the dataset, such as people, this work is able to demonstrate a recognition performance comparable to class-specific Viola-Jones style detectors.
Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval
TL;DR: This paper addresses the problem of learning similarity-preserving binary codes for efficient similarity search in large-scale image collections by proposing a simple and efficient alternating minimization algorithm, dubbed iterative quantization (ITQ), and demonstrating an application of ITQ to learning binary attributes or "classemes" on the ImageNet data set.
2.1K
•Posted Content
MatConvNet: Convolutional Neural Networks for MATLAB
Andrea Vedaldi,Karel Lenc +1 more
TL;DR: MatConvNet as discussed by the authors is an implementation of Convolutional Neural Networks (CNNs) for MATLAB, which exposes the building blocks of CNNs as easy to use MATLAB functions, providing routines for computing linear convolutions with filter banks, feature pooling, and many more.
2K
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Alexandr Andoni,Piotr Indyk +1 more
TL;DR: An algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn 1c2/+o(1)) and space O(DN + n1+1c2 + o(1) + 1/c2), which almost matches the lower bound for hashing-based algorithm recently obtained.